/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:24:45,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:24:45,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:24:45,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:24:45,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:24:45,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:24:45,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:24:45,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:24:45,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:24:45,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:24:45,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:24:45,159 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:24:45,160 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:24:45,161 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:24:45,161 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:24:45,162 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:24:45,162 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:24:45,162 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:24:45,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:24:45,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:24:45,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:24:45,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:24:45,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:24:45,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:24:45,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:24:45,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:24:45,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:24:45,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:24:45,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:24:45,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:24:45,167 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:24:45,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:24:45,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:24:45,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:24:45,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:24:45,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:24:45,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:24:45,169 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:24:45,169 INFO L153 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 [2024-02-09 23:24:45,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:24:45,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:24:45,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:24:45,499 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:24:45,504 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:24:45,506 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 [2024-02-09 23:24:45,506 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2024-02-09 23:24:45,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:24:45,556 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:24:45,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:45,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:24:45,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:24:45,569 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,583 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,611 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:24:45,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:24:45,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:24:45,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:24:45,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:24:45,643 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,643 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,644 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,644 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,647 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,650 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,652 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,652 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 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:24:45,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:24:45,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:24:45,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:24:45,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:45" (1/1) ... [2024-02-09 23:24:45,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:45,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:45,697 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) [2024-02-09 23:24:45,699 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 [2024-02-09 23:24:45,737 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2024-02-09 23:24:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2024-02-09 23:24:45,737 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2024-02-09 23:24:45,737 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:24:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:24:45,738 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2024-02-09 23:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2024-02-09 23:24:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2024-02-09 23:24:45,738 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2024-02-09 23:24:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2024-02-09 23:24:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2024-02-09 23:24:45,739 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2024-02-09 23:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2024-02-09 23:24:45,739 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2024-02-09 23:24:45,739 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-09 23:24:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-09 23:24:45,739 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-09 23:24:45,740 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:24:45,784 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:24:45,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:24:45,887 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:24:45,905 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:24:45,906 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-09 23:24:45,908 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:24:45 BoogieIcfgContainer [2024-02-09 23:24:45,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:24:45,909 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:24:45,909 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:24:45,913 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:24:45,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:45,914 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:24:45" (1/2) ... [2024-02-09 23:24:45,916 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28f29d0b and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:24:45, skipping insertion in model container [2024-02-09 23:24:45,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:24:45,916 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 09.02 11:24:45" (2/2) ... [2024-02-09 23:24:45,917 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2024-02-09 23:24:45,987 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-09 23:24:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 132 flow [2024-02-09 23:24:46,038 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2024-02-09 23:24:46,039 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-09 23:24:46,044 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. [2024-02-09 23:24:46,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 132 flow [2024-02-09 23:24:46,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2024-02-09 23:24:46,060 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:24:46,061 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:24:46,061 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:24:46,061 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:24:46,061 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:24:46,061 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:24:46,061 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:24:46,061 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:24:46,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:24:46,612 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 4456 [2024-02-09 23:24:46,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:46,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:46,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:24:46,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:46,620 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:24:46,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 4703 states, but on-demand construction may add more states [2024-02-09 23:24:46,731 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 4456 [2024-02-09 23:24:46,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:46,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:46,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 23:24:46,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:46,745 INFO L748 eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] 62#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 64#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 66#[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] 68#[$Ultimate##0, L100-1]don't care [112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1] 70#[L36-1, L100-1]don't care [2024-02-09 23:24:46,746 INFO L750 eck$LassoCheckResult]: Loop: 70#[L36-1, L100-1]don't care [114] L36-1-->L36: Formula: (< v_i1_3 v_k_4) InVars {i1=v_i1_3, k=v_k_4} OutVars{i1=v_i1_3, k=v_k_4} AuxVars[] AssignedVars[] 76#[L36, L100-1]don't care [116] L36-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_11 v_i1_9))) (ite (< v_array_min_15 .cse0) v_array_min_15 .cse0)) v_array_min_14) (= (+ v_i1_9 1) v_i1_8)) InVars {A=v_A_11, i1=v_i1_9, array_min=v_array_min_15} OutVars{A=v_A_11, i1=v_i1_8, array_min=v_array_min_14} AuxVars[] AssignedVars[array_min, i1] 70#[L36-1, L100-1]don't care [2024-02-09 23:24:46,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 127812647, now seen corresponding path program 1 times [2024-02-09 23:24:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742351762] [2024-02-09 23:24:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:46,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:46,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:46,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2024-02-09 23:24:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:46,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826529185] [2024-02-09 23:24:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:46,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:46,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:46,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1726094167, now seen corresponding path program 1 times [2024-02-09 23:24:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292116797] [2024-02-09 23:24:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:47,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:47,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:47,192 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:47,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:47,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:47,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:47,193 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:47,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:47,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:47,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:47,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:24:47,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:47,196 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:47,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:47,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:47,392 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:47,396 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:47,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:47,404 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) [2024-02-09 23:24:47,414 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 [2024-02-09 23:24:47,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:47,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:47,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:47,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:47,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:47,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:47,448 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 [2024-02-09 23:24:47,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:47,469 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-09 23:24:47,469 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:24:47,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:47,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:47,476 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) [2024-02-09 23:24:47,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:47,492 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 [2024-02-09 23:24:47,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:47,516 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:47,516 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2024-02-09 23:24:47,522 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 [2024-02-09 23:24:47,525 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:47,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:47,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:47,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:47,615 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:47,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:47,674 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:47,684 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 4703 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:48,281 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 [2024-02-09 23:24:48,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 4703 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12522 states and 71683 transitions. Complement of second has 6 states. [2024-02-09 23:24:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-02-09 23:24:48,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-09 23:24:48,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:48,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-09 23:24:48,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:48,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-09 23:24:48,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:48,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12522 states and 71683 transitions. [2024-02-09 23:24:48,844 INFO L131 ngComponentsAnalysis]: Automaton has 863 accepting balls. 4322 [2024-02-09 23:24:49,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12522 states to 10051 states and 58010 transitions. [2024-02-09 23:24:49,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5415 [2024-02-09 23:24:49,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7733 [2024-02-09 23:24:49,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10051 states and 58010 transitions. [2024-02-09 23:24:49,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:49,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10051 states and 58010 transitions. [2024-02-09 23:24:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10051 states and 58010 transitions. [2024-02-09 23:24:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10051 to 7736. [2024-02-09 23:24:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7736 states, 7736 states have (on average 6.015899689762151) internal successors, (46539), 7735 states have internal predecessors, (46539), 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) [2024-02-09 23:24:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7736 states to 7736 states and 46539 transitions. [2024-02-09 23:24:49,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7736 states and 46539 transitions. [2024-02-09 23:24:49,862 INFO L428 stractBuchiCegarLoop]: Abstraction has 7736 states and 46539 transitions. [2024-02-09 23:24:49,862 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:24:49,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7736 states and 46539 transitions. [2024-02-09 23:24:50,052 INFO L131 ngComponentsAnalysis]: Automaton has 863 accepting balls. 4322 [2024-02-09 23:24:50,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:50,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:50,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-02-09 23:24:50,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:50,054 INFO L748 eck$LassoCheckResult]: Stem: 24429#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] 24431#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 32267#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 35807#[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] 35809#[$Ultimate##0, L100-1]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] 33753#[L101, $Ultimate##0, $Ultimate##0]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] 33759#[L101, $Ultimate##0, L48-1]don't care [2024-02-09 23:24:50,054 INFO L750 eck$LassoCheckResult]: Loop: 33759#[L101, $Ultimate##0, L48-1]don't care [109] L48-1-->L48: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[] 35111#[L101, $Ultimate##0, L48]don't care [111] L48-->L48-1: Formula: (and (= v_i2_8 (+ v_i2_9 1)) (= (let ((.cse0 (select v_A_7 v_i2_9))) (ite (< v_array_min_11 .cse0) v_array_min_11 .cse0)) v_array_min_10)) InVars {A=v_A_7, i2=v_i2_9, array_min=v_array_min_11} OutVars{A=v_A_7, i2=v_i2_8, array_min=v_array_min_10} AuxVars[] AssignedVars[array_min, i2] 33759#[L101, $Ultimate##0, L48-1]don't care [2024-02-09 23:24:50,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -332774171, now seen corresponding path program 1 times [2024-02-09 23:24:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210618750] [2024-02-09 23:24:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:50,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2024-02-09 23:24:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977789754] [2024-02-09 23:24:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:50,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1968394937, now seen corresponding path program 1 times [2024-02-09 23:24:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963707055] [2024-02-09 23:24:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:50,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:50,220 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:50,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:50,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:50,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:50,220 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:50,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:50,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:50,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:50,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:24:50,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:50,221 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:50,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:50,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:50,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:50,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:50,378 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:50,378 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:50,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:50,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:50,379 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) [2024-02-09 23:24:50,385 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 [2024-02-09 23:24:50,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:50,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:50,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:50,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:50,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:50,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:50,392 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 [2024-02-09 23:24:50,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:50,403 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 [2024-02-09 23:24:50,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:50,404 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) [2024-02-09 23:24:50,408 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 [2024-02-09 23:24:50,409 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 [2024-02-09 23:24:50,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:50,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:50,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:50,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:50,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:50,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:50,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:50,448 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 [2024-02-09 23:24:50,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:50,450 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) [2024-02-09 23:24:50,459 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 [2024-02-09 23:24:50,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:50,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:50,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:50,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:50,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:50,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:50,477 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 [2024-02-09 23:24:50,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:50,490 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:24:50,490 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:24:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:50,493 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) [2024-02-09 23:24:50,503 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:50,511 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 [2024-02-09 23:24:50,525 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:50,526 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:50,526 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-09 23:24:50,532 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 [2024-02-09 23:24:50,533 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:50,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:50,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:50,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:50,575 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:50,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:50,594 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:50,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7736 states and 46539 transitions. cyclomatic complexity: 39871 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:50,848 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 [2024-02-09 23:24:51,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7736 states and 46539 transitions. cyclomatic complexity: 39871. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23978 states and 153568 transitions. Complement of second has 6 states. [2024-02-09 23:24:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-02-09 23:24:51,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-09 23:24:51,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:51,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 8 letters. Loop has 2 letters. [2024-02-09 23:24:51,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:51,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-09 23:24:51,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:51,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23978 states and 153568 transitions. [2024-02-09 23:24:51,959 INFO L131 ngComponentsAnalysis]: Automaton has 922 accepting balls. 4084 [2024-02-09 23:24:52,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23978 states to 18632 states and 119240 transitions. [2024-02-09 23:24:52,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7120 [2024-02-09 23:24:52,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9761 [2024-02-09 23:24:52,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18632 states and 119240 transitions. [2024-02-09 23:24:52,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:52,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18632 states and 119240 transitions. [2024-02-09 23:24:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18632 states and 119240 transitions. [2024-02-09 23:24:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18632 to 14475. [2024-02-09 23:24:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14475 states, 14475 states have (on average 6.552746113989637) internal successors, (94851), 14474 states have internal predecessors, (94851), 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) [2024-02-09 23:24:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14475 states to 14475 states and 94851 transitions. [2024-02-09 23:24:53,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14475 states and 94851 transitions. [2024-02-09 23:24:53,251 INFO L428 stractBuchiCegarLoop]: Abstraction has 14475 states and 94851 transitions. [2024-02-09 23:24:53,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:24:53,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14475 states and 94851 transitions. [2024-02-09 23:24:53,630 INFO L131 ngComponentsAnalysis]: Automaton has 922 accepting balls. 4084 [2024-02-09 23:24:53,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:53,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:53,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:24:53,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:53,631 INFO L748 eck$LassoCheckResult]: Stem: 64297#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] 64299#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 74191#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 80417#[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] 80419#[$Ultimate##0, L100-1]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] 76551#[L101, $Ultimate##0, $Ultimate##0]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] 76555#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L102]don't care [122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3] 66817#[$Ultimate##0, $Ultimate##0, L102, L61-1]don't care [2024-02-09 23:24:53,632 INFO L750 eck$LassoCheckResult]: Loop: 66817#[$Ultimate##0, $Ultimate##0, L102, L61-1]don't care [124] L61-1-->L61: Formula: (< v_i3_1 v_k_6) InVars {i3=v_i3_1, k=v_k_6} OutVars{i3=v_i3_1, k=v_k_6} AuxVars[] AssignedVars[] 66827#[L61, $Ultimate##0, $Ultimate##0, L102]don't care [126] L61-->L61-1: Formula: (and (= v_i3_8 (+ v_i3_9 1)) (= (let ((.cse0 (select v_A_13 v_i3_9))) (ite (< v_array_max_15 .cse0) .cse0 v_array_max_15)) v_array_max_14)) InVars {A=v_A_13, array_max=v_array_max_15, i3=v_i3_9} OutVars{A=v_A_13, array_max=v_array_max_14, i3=v_i3_8} AuxVars[] AssignedVars[array_max, i3] 66817#[$Ultimate##0, $Ultimate##0, L102, L61-1]don't care [2024-02-09 23:24:53,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1726063378, now seen corresponding path program 1 times [2024-02-09 23:24:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:53,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720515684] [2024-02-09 23:24:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:53,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:53,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:53,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2024-02-09 23:24:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:53,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667875228] [2024-02-09 23:24:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:53,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:53,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:53,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash -889526032, now seen corresponding path program 1 times [2024-02-09 23:24:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033363468] [2024-02-09 23:24:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:53,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:53,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:53,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:53,765 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:53,765 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:53,765 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:53,766 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:53,766 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:53,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:53,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:53,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:53,766 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration3_Lasso [2024-02-09 23:24:53,766 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:53,766 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:53,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:53,945 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:53,945 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:53,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:53,947 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) [2024-02-09 23:24:53,950 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 [2024-02-09 23:24:53,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:53,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:53,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:53,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:53,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:53,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:53,963 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 [2024-02-09 23:24:53,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:53,976 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 [2024-02-09 23:24:53,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:53,980 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) [2024-02-09 23:24:53,986 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 [2024-02-09 23:24:53,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:53,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:53,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:53,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:53,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:53,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:53,995 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 [2024-02-09 23:24:54,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:54,018 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 [2024-02-09 23:24:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:54,020 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) [2024-02-09 23:24:54,027 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 [2024-02-09 23:24:54,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:54,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:54,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:54,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:54,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:54,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:54,041 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 [2024-02-09 23:24:54,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:54,063 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 [2024-02-09 23:24:54,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:54,065 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) [2024-02-09 23:24:54,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:54,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:54,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:54,079 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:24:54,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:54,092 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:24:54,093 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:24:54,096 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 [2024-02-09 23:24:54,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:54,122 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 [2024-02-09 23:24:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:54,123 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) [2024-02-09 23:24:54,131 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 [2024-02-09 23:24:54,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:54,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:54,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:54,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:54,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:54,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:54,150 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 [2024-02-09 23:24:54,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:54,167 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-09 23:24:54,167 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-09 23:24:54,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:54,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:54,170 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) [2024-02-09 23:24:54,180 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:54,183 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 [2024-02-09 23:24:54,213 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:54,214 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:54,214 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, i3) = 1*k - 1*i3 Supporting invariants [] [2024-02-09 23:24:54,221 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 [2024-02-09 23:24:54,222 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:54,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:54,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:54,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:54,265 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:54,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:54,280 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:54,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14475 states and 94851 transitions. cyclomatic complexity: 81915 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:54,694 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 [2024-02-09 23:24:55,303 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14475 states and 94851 transitions. cyclomatic complexity: 81915. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45457 states and 305698 transitions. Complement of second has 6 states. [2024-02-09 23:24:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:24:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:24:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-02-09 23:24:55,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-09 23:24:55,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:55,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 9 letters. Loop has 2 letters. [2024-02-09 23:24:55,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:55,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 4 letters. [2024-02-09 23:24:55,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:24:55,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45457 states and 305698 transitions. [2024-02-09 23:24:56,377 INFO L131 ngComponentsAnalysis]: Automaton has 909 accepting balls. 3698 [2024-02-09 23:24:57,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45457 states to 33498 states and 224712 transitions. [2024-02-09 23:24:57,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9503 [2024-02-09 23:24:57,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12088 [2024-02-09 23:24:57,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33498 states and 224712 transitions. [2024-02-09 23:24:57,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:24:57,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33498 states and 224712 transitions. [2024-02-09 23:24:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33498 states and 224712 transitions. [2024-02-09 23:24:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33498 to 26459. [2024-02-09 23:24:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26459 states, 26459 states have (on average 6.822933595373975) internal successors, (180528), 26458 states have internal predecessors, (180528), 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) [2024-02-09 23:24:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26459 states to 26459 states and 180528 transitions. [2024-02-09 23:24:58,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26459 states and 180528 transitions. [2024-02-09 23:24:58,234 INFO L428 stractBuchiCegarLoop]: Abstraction has 26459 states and 180528 transitions. [2024-02-09 23:24:58,235 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:24:58,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26459 states and 180528 transitions. [2024-02-09 23:24:58,834 INFO L131 ngComponentsAnalysis]: Automaton has 909 accepting balls. 3698 [2024-02-09 23:24:58,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:24:58,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:24:58,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:24:58,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:24:58,836 INFO L748 eck$LassoCheckResult]: Stem: 138789#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] 138791#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 149699#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 159329#[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] 159331#[$Ultimate##0, L100-1]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] 152995#[L101, $Ultimate##0, $Ultimate##0]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] 152999#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L102]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] 147137#[$Ultimate##0, L103, $Ultimate##0, $Ultimate##0, $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] 147141#[$Ultimate##0, L74-1, $Ultimate##0, L103, $Ultimate##0]don't care [2024-02-09 23:24:58,836 INFO L750 eck$LassoCheckResult]: Loop: 147141#[$Ultimate##0, L74-1, $Ultimate##0, L103, $Ultimate##0]don't care [119] L74-1-->L74: Formula: (< v_i4_2 v_N_4) InVars {N=v_N_4, i4=v_i4_2} OutVars{N=v_N_4, i4=v_i4_2} AuxVars[] AssignedVars[] 161473#[$Ultimate##0, L103, $Ultimate##0, L74, $Ultimate##0]don't care [121] L74-->L74-1: Formula: (and (= (let ((.cse0 (select v_A_9 v_i4_9))) (ite (< v_array_max_11 .cse0) .cse0 v_array_max_11)) v_array_max_10) (= (+ v_i4_9 1) v_i4_8)) InVars {A=v_A_9, array_max=v_array_max_11, i4=v_i4_9} OutVars{A=v_A_9, array_max=v_array_max_10, i4=v_i4_8} AuxVars[] AssignedVars[array_max, i4] 147141#[$Ultimate##0, L74-1, $Ultimate##0, L103, $Ultimate##0]don't care [2024-02-09 23:24:58,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356677, now seen corresponding path program 1 times [2024-02-09 23:24:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:58,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351369611] [2024-02-09 23:24:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:58,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:58,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash 4771, now seen corresponding path program 1 times [2024-02-09 23:24:58,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:58,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323403078] [2024-02-09 23:24:58,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:58,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1805152547, now seen corresponding path program 1 times [2024-02-09 23:24:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:24:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606437748] [2024-02-09 23:24:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:24:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:24:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:24:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:24:58,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:24:59,010 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:24:59,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:24:59,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:24:59,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:24:59,010 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:24:59,010 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:24:59,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:24:59,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration4_Lasso [2024-02-09 23:24:59,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:24:59,011 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:24:59,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:24:59,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:24:59,219 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:24:59,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,221 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) [2024-02-09 23:24:59,229 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 [2024-02-09 23:24:59,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,243 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 [2024-02-09 23:24:59,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-02-09 23:24:59,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,254 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) [2024-02-09 23:24:59,261 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 [2024-02-09 23:24:59,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-09 23:24:59,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:59,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,294 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) [2024-02-09 23:24:59,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:59,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,311 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 [2024-02-09 23:24:59,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,348 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) [2024-02-09 23:24:59,350 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 [2024-02-09 23:24:59,350 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 [2024-02-09 23:24:59,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,376 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) [2024-02-09 23:24:59,378 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 [2024-02-09 23:24:59,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:59,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-09 23:24:59,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,404 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) [2024-02-09 23:24:59,406 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 [2024-02-09 23:24:59,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:24:59,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,434 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 [2024-02-09 23:24:59,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,436 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) [2024-02-09 23:24:59,441 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 [2024-02-09 23:24:59,444 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 [2024-02-09 23:24:59,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,468 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 [2024-02-09 23:24:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,470 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) [2024-02-09 23:24:59,471 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 [2024-02-09 23:24:59,472 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 [2024-02-09 23:24:59,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,478 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:24:59,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,485 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:24:59,485 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:24:59,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:24:59,510 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 [2024-02-09 23:24:59,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,511 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) [2024-02-09 23:24:59,516 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 [2024-02-09 23:24:59,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:24:59,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:24:59,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:24:59,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:24:59,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:24:59,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:24:59,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-09 23:24:59,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:24:59,555 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-09 23:24:59,555 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-09 23:24:59,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:24:59,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:24:59,557 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) [2024-02-09 23:24:59,559 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 [2024-02-09 23:24:59,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:24:59,566 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:24:59,566 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:24:59,566 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i4, N) = -1*i4 + 1*N Supporting invariants [] [2024-02-09 23:24:59,571 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 [2024-02-09 23:24:59,571 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:24:59,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:24:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:59,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:24:59,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:24:59,607 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:24:59,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:24:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:24:59,619 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-09 23:24:59,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26459 states and 180528 transitions. cyclomatic complexity: 156268 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:00,288 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 [2024-02-09 23:25:01,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26459 states and 180528 transitions. cyclomatic complexity: 156268. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80934 states and 561853 transitions. Complement of second has 6 states. [2024-02-09 23:25:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:25:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:25:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-02-09 23:25:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 8 letters. Loop has 2 letters. [2024-02-09 23:25:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 10 letters. Loop has 2 letters. [2024-02-09 23:25:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-09 23:25:01,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:25:01,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80934 states and 561853 transitions. [2024-02-09 23:25:03,280 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 3136 [2024-02-09 23:25:04,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80934 states to 54826 states and 379327 transitions. [2024-02-09 23:25:04,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11817 [2024-02-09 23:25:04,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14056 [2024-02-09 23:25:04,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54826 states and 379327 transitions. [2024-02-09 23:25:04,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:25:04,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54826 states and 379327 transitions. [2024-02-09 23:25:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54826 states and 379327 transitions. [2024-02-09 23:25:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54826 to 44089. [2024-02-09 23:25:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44089 states, 44089 states have (on average 7.0269681780035835) internal successors, (309812), 44088 states have internal predecessors, (309812), 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) [2024-02-09 23:25:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44089 states to 44089 states and 309812 transitions. [2024-02-09 23:25:06,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44089 states and 309812 transitions. [2024-02-09 23:25:06,797 INFO L428 stractBuchiCegarLoop]: Abstraction has 44089 states and 309812 transitions. [2024-02-09 23:25:06,797 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-09 23:25:06,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44089 states and 309812 transitions. [2024-02-09 23:25:07,612 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 3136 [2024-02-09 23:25:07,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:25:07,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:25:07,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:25:07,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-02-09 23:25:07,614 INFO L748 eck$LassoCheckResult]: Stem: 272437#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] 272439#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 282817#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 293773#[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] 293775#[$Ultimate##0, L100-1]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] 286453#[L101, $Ultimate##0, $Ultimate##0]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] 286457#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L102]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] 280147#[$Ultimate##0, L103, $Ultimate##0, $Ultimate##0, $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] 271317#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L104, L84, $Ultimate##0]don't care [2024-02-09 23:25:07,614 INFO L750 eck$LassoCheckResult]: Loop: 271317#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L104, L84, $Ultimate##0]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] 272073#[$Ultimate##0, L86, $Ultimate##0, $Ultimate##0, L104, $Ultimate##0]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] 272077#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L104, $Ultimate##0, L87]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] 271313#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L104, L88, $Ultimate##0]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] 271317#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L104, L84, $Ultimate##0]don't care [2024-02-09 23:25:07,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356657, now seen corresponding path program 1 times [2024-02-09 23:25:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595500222] [2024-02-09 23:25:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:07,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 4864899, now seen corresponding path program 1 times [2024-02-09 23:25:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237393629] [2024-02-09 23:25:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:07,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:25:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 433940305, now seen corresponding path program 1 times [2024-02-09 23:25:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:25:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255932446] [2024-02-09 23:25:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:25:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:25:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:25:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:25:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:25:07,905 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:25:07 BoogieIcfgContainer [2024-02-09 23:25:07,906 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:25:07,906 INFO L158 Benchmark]: Toolchain (without parser) took 22349.92ms. Allocated memory was 164.6MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 136.0MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2024-02-09 23:25:07,912 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:25:07,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.57ms. Allocated memory was 164.6MB in the beginning and 250.6MB in the end (delta: 86.0MB). Free memory was 135.7MB in the beginning and 226.2MB in the end (delta: -90.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:25:07,914 INFO L158 Benchmark]: Boogie Preprocessor took 18.55ms. Allocated memory is still 250.6MB. Free memory was 226.2MB in the beginning and 225.2MB in the end (delta: 942.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:25:07,914 INFO L158 Benchmark]: RCFGBuilder took 253.63ms. Allocated memory is still 250.6MB. Free memory was 225.1MB in the beginning and 213.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-09 23:25:07,916 INFO L158 Benchmark]: BuchiAutomizer took 21996.90ms. Allocated memory was 250.6MB in the beginning and 7.4GB in the end (delta: 7.1GB). Free memory was 213.3MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2024-02-09 23:25:07,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.57ms. Allocated memory was 164.6MB in the beginning and 250.6MB in the end (delta: 86.0MB). Free memory was 135.7MB in the beginning and 226.2MB in the end (delta: -90.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.55ms. Allocated memory is still 250.6MB. Free memory was 226.2MB in the beginning and 225.2MB in the end (delta: 942.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 253.63ms. Allocated memory is still 250.6MB. Free memory was 225.1MB in the beginning and 213.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 21996.90ms. Allocated memory was 250.6MB in the beginning and 7.4GB in the end (delta: 7.1GB). Free memory was 213.3MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.6GB. 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 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i3 + k and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i4 and consists of 4 locations. The remainder module has 44089 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 4.9s AutomataMinimizationTime, 4 MinimizatonAttempts, 24248 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 6.9s Buchi closure took 0.1s. 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, 347 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 204 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp110 ukn59 mio100 lsp56 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf149 smp63 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms 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.0s - 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; VAL [N=0, k=0] [L97] 0 array_min := A[0]; VAL [N=0, array_min=9, k=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; VAL [N=0, k=0] [L97] 0 array_min := A[0]; VAL [N=0, array_min=9, k=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. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:25:07,957 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...