/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:00:16,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:00:16,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:00:16,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:00:16,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:00:16,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:00:16,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:00:16,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:00:16,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:00:16,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:00:16,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:00:16,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:00:16,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:00:16,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:00:16,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:00:16,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:00:16,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:00:16,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:00:16,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:00:16,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:00:16,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:00:16,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:00:16,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:00:16,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:00:16,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:00:16,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:00:16,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:00:16,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:00:16,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:00:16,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:00:16,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:00:16,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:00:16,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:00:16,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:00:16,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:00:16,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:00:16,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:00:16,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:00:16,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:00:16,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:00:16,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:00:16,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-09-29 15:00:16,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:00:16,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:00:16,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:00:16,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:00:16,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:00:16,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:00:16,368 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:00:16,368 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:00:16,368 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:00:16,368 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:00:16,369 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:00:16,369 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:00:16,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:00:16,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:00:16,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:00:16,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:00:16,371 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:00:16,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:00:16,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:00:16,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:00:16,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:00:16,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:00:16,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:00:16,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:00:16,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:00:16,374 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:00:16,374 INFO L138 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 [2022-09-29 15:00:16,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:00:16,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:00:16,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:00:16,604 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:00:16,605 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:00:16,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl [2022-09-29 15:00:16,607 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2022-09-29 15:00:16,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:00:16,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:00:16,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:16,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:00:16,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:00:16,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,661 INFO L137 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:00:16,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:16,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:00:16,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:00:16,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:00:16,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:00:16,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:00:16,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:00:16,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:00:16,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/1) ... [2022-09-29 15:00:16,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:16,733 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) [2022-09-29 15:00:16,760 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 [2022-09-29 15:00:16,776 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2022-09-29 15:00:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2022-09-29 15:00:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2022-09-29 15:00:16,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:00:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:00:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:00:16,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2022-09-29 15:00:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2022-09-29 15:00:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2022-09-29 15:00:16,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2022-09-29 15:00:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2022-09-29 15:00:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2022-09-29 15:00:16,778 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2022-09-29 15:00:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2022-09-29 15:00:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2022-09-29 15:00:16,778 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2022-09-29 15:00:16,779 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2022-09-29 15:00:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2022-09-29 15:00:16,780 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 15:00:16,828 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:00:16,830 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:00:16,950 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:00:16,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:00:16,977 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-09-29 15:00:16,979 INFO L202 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:16 BoogieIcfgContainer [2022-09-29 15:00:16,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:00:16,982 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:00:16,982 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:00:16,998 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:00:16,999 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:16,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:16" (1/2) ... [2022-09-29 15:00:17,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b99979f and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:00:17, skipping insertion in model container [2022-09-29 15:00:17,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:17,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:16" (2/2) ... [2022-09-29 15:00:17,001 INFO L322 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2022-09-29 15:00:17,098 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-09-29 15:00:17,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 137 flow [2022-09-29 15:00:17,144 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:17,145 INFO L123 PetriNetUnfolderBase]: 5/40 cut-off events. [2022-09-29 15:00:17,145 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:00:17,149 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 8. Compared 80 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. [2022-09-29 15:00:17,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 137 flow [2022-09-29 15:00:17,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2022-09-29 15:00:17,157 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:00:17,169 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 107 flow [2022-09-29 15:00:17,171 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 107 flow [2022-09-29 15:00:17,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 107 flow [2022-09-29 15:00:17,183 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:17,183 INFO L123 PetriNetUnfolderBase]: 5/40 cut-off events. [2022-09-29 15:00:17,184 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:00:17,184 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 84 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. [2022-09-29 15:00:17,185 INFO L116 LiptonReduction]: Number of co-enabled transitions 730 [2022-09-29 15:00:17,424 INFO L131 LiptonReduction]: Checked pairs total: 719 [2022-09-29 15:00:17,425 INFO L133 LiptonReduction]: Total number of compositions: 11 [2022-09-29 15:00:17,441 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:00:17,441 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:00:17,441 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:00:17,441 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:00:17,441 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:00:17,441 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:00:17,441 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:00:17,442 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 15:00:17,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 15:00:17,695 INFO L131 ngComponentsAnalysis]: Automaton has 303 accepting balls. 672 [2022-09-29 15:00:17,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:17,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:17,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:17,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:17,701 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:00:17,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 736 states, but on-demand construction may add more states [2022-09-29 15:00:17,720 INFO L131 ngComponentsAnalysis]: Automaton has 303 accepting balls. 672 [2022-09-29 15:00:17,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:17,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:17,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:17,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:17,735 INFO L733 eck$LassoCheckResult]: Stem: 59#[ULTIMATE.startENTRY]don't care [161] ULTIMATE.startENTRY-->L100: Formula: (let ((.cse0 (select v_A_31 0))) (and (<= v_k_24 v_N_16) (= .cse0 v_array_max_38) (<= 0 v_k_24) (= .cse0 v_array_min_38))) InVars {A=v_A_31, N=v_N_16, k=v_k_24} OutVars{A=v_A_31, array_min=v_array_min_38, N=v_N_16, array_max=v_array_max_38, k=v_k_24} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]don't care [140] L100-->computeMin1ENTRY: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[computeMin1ENTRY, L100-1]don't care [112] computeMin1ENTRY-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1] 66#[L100-1, L36-1]don't care [2022-09-29 15:00:17,735 INFO L735 eck$LassoCheckResult]: Loop: 66#[L100-1, L36-1]don't care [159] L36-1-->L36-1: Formula: (and (< v_i1_17 v_k_18) (= v_array_min_32 (let ((.cse0 (select v_A_25 v_i1_17))) (ite (< v_array_min_33 .cse0) v_array_min_33 .cse0))) (= (+ v_i1_17 1) v_i1_16)) InVars {A=v_A_25, array_min=v_array_min_33, k=v_k_18, i1=v_i1_17} OutVars{A=v_A_25, array_min=v_array_min_32, k=v_k_18, i1=v_i1_16} AuxVars[] AssignedVars[array_min, i1] 66#[L100-1, L36-1]don't care [2022-09-29 15:00:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 188964, now seen corresponding path program 1 times [2022-09-29 15:00:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:17,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54073775] [2022-09-29 15:00:17,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 190, now seen corresponding path program 1 times [2022-09-29 15:00:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:17,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090837767] [2022-09-29 15:00:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 5858043, now seen corresponding path program 1 times [2022-09-29 15:00:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:17,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732442171] [2022-09-29 15:00:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:18,101 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:18,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:18,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:18,102 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:18,102 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:18,102 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:18,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:18,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:00:18,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:18,103 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:18,124 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,178 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,291 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:18,295 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:18,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:18,301 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) [2022-09-29 15:00:18,302 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 [2022-09-29 15:00:18,303 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 [2022-09-29 15:00:18,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:18,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:18,310 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-09-29 15:00:18,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:18,326 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-09-29 15:00:18,327 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-09-29 15:00:18,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:18,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:18,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:18,380 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) [2022-09-29 15:00:18,387 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 [2022-09-29 15:00:18,412 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 [2022-09-29 15:00:18,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:18,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:18,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:18,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:18,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:18,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:18,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:18,461 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-09-29 15:00:18,461 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-09-29 15:00:18,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:18,465 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) [2022-09-29 15:00:18,467 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 [2022-09-29 15:00:18,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:18,489 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:18,490 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:18,490 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2022-09-29 15:00:18,516 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 [2022-09-29 15:00:18,519 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:18,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:18,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:18,595 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:18,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:18,632 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-09-29 15:00:18,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 736 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:18,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 736 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1992 states and 11413 transitions. Complement of second has 4 states. [2022-09-29 15:00:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-09-29 15:00:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-09-29 15:00:18,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:00:18,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:18,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:18,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:18,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:00:18,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:18,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1992 states and 11413 transitions. [2022-09-29 15:00:18,884 INFO L131 ngComponentsAnalysis]: Automaton has 280 accepting balls. 649 [2022-09-29 15:00:18,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1992 states to 1593 states and 9210 transitions. [2022-09-29 15:00:18,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 899 [2022-09-29 15:00:18,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1246 [2022-09-29 15:00:18,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1593 states and 9210 transitions. [2022-09-29 15:00:18,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:18,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1593 states and 9210 transitions. [2022-09-29 15:00:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states and 9210 transitions. [2022-09-29 15:00:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1248. [2022-09-29 15:00:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1248 states have (on average 6.051282051282051) internal successors, (7552), 1247 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 7552 transitions. [2022-09-29 15:00:19,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1248 states and 7552 transitions. [2022-09-29 15:00:19,059 INFO L428 stractBuchiCegarLoop]: Abstraction has 1248 states and 7552 transitions. [2022-09-29 15:00:19,059 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:00:19,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1248 states and 7552 transitions. [2022-09-29 15:00:19,075 INFO L131 ngComponentsAnalysis]: Automaton has 280 accepting balls. 649 [2022-09-29 15:00:19,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:19,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:19,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-09-29 15:00:19,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:19,077 INFO L733 eck$LassoCheckResult]: Stem: 6040#[ULTIMATE.startENTRY]don't care [161] ULTIMATE.startENTRY-->L100: Formula: (let ((.cse0 (select v_A_31 0))) (and (<= v_k_24 v_N_16) (= .cse0 v_array_max_38) (<= 0 v_k_24) (= .cse0 v_array_min_38))) InVars {A=v_A_31, N=v_N_16, k=v_k_24} OutVars{A=v_A_31, array_min=v_array_min_38, N=v_N_16, array_max=v_array_max_38, k=v_k_24} AuxVars[] AssignedVars[array_min, array_max] 5212#[L100]don't care [140] L100-->computeMin1ENTRY: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 5214#[computeMin1ENTRY, L100-1]don't care [143] L100-1-->computeMin2ENTRY: 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] 5498#[L101, computeMin2ENTRY, computeMin1ENTRY]don't care [107] computeMin2ENTRY-->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] 5654#[L101, L48-1, computeMin1ENTRY]don't care [2022-09-29 15:00:19,077 INFO L735 eck$LassoCheckResult]: Loop: 5654#[L101, L48-1, computeMin1ENTRY]don't care [156] L48-1-->L48-1: Formula: (and (= v_i2_14 (+ v_i2_15 1)) (< v_i2_15 v_N_10) (= (let ((.cse0 (select v_A_19 v_i2_15))) (ite (< v_array_min_23 .cse0) v_array_min_23 .cse0)) v_array_min_22)) InVars {A=v_A_19, array_min=v_array_min_23, N=v_N_10, i2=v_i2_15} OutVars{A=v_A_19, array_min=v_array_min_22, N=v_N_10, i2=v_i2_14} AuxVars[] AssignedVars[array_min, i2] 5654#[L101, L48-1, computeMin1ENTRY]don't care [2022-09-29 15:00:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash 5858952, now seen corresponding path program 1 times [2022-09-29 15:00:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766796072] [2022-09-29 15:00:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:19,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:19,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 187, now seen corresponding path program 1 times [2022-09-29 15:00:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:19,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550186805] [2022-09-29 15:00:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:19,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:19,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 181627668, now seen corresponding path program 1 times [2022-09-29 15:00:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:19,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613101365] [2022-09-29 15:00:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:19,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:19,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:19,219 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:19,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:19,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:19,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:19,219 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:19,219 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:19,219 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:19,219 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:19,219 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:00:19,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:19,220 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:19,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:19,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:19,227 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:19,267 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:19,373 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:19,373 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:19,376 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) [2022-09-29 15:00:19,388 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 [2022-09-29 15:00:19,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:19,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:19,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:19,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:19,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:19,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:19,403 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 [2022-09-29 15:00:19,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:19,437 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 [2022-09-29 15:00:19,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:19,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:19,439 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) [2022-09-29 15:00:19,446 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 [2022-09-29 15:00:19,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:19,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:19,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:19,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:19,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:19,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:19,460 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 [2022-09-29 15:00:19,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:19,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:19,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:19,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:19,509 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) [2022-09-29 15:00:19,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 [2022-09-29 15:00:19,512 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 [2022-09-29 15:00:19,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:19,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:19,520 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-09-29 15:00:19,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:19,533 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-09-29 15:00:19,534 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-09-29 15:00:19,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:19,595 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 [2022-09-29 15:00:19,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-09-29 15:00:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:19,599 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) [2022-09-29 15:00:19,604 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 [2022-09-29 15:00:19,608 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 [2022-09-29 15:00:19,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:19,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:19,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:19,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:19,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:19,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:19,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:19,643 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:00:19,643 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:00:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:19,648 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) [2022-09-29 15:00:19,657 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 [2022-09-29 15:00:19,657 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:19,677 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:19,677 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:19,677 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2022-09-29 15:00:19,706 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 [2022-09-29 15:00:19,707 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:19,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:19,736 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:19,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:19,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-09-29 15:00:19,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 7552 transitions. cyclomatic complexity: 6677 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:19,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 7552 transitions. cyclomatic complexity: 6677. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3762 states and 24139 transitions. Complement of second has 4 states. [2022-09-29 15:00:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-09-29 15:00:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-09-29 15:00:19,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:19,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:19,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 15:00:19,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:19,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2022-09-29 15:00:19,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:19,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3762 states and 24139 transitions. [2022-09-29 15:00:19,973 INFO L131 ngComponentsAnalysis]: Automaton has 243 accepting balls. 612 [2022-09-29 15:00:20,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3762 states to 3036 states and 19299 transitions. [2022-09-29 15:00:20,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1214 [2022-09-29 15:00:20,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1642 [2022-09-29 15:00:20,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3036 states and 19299 transitions. [2022-09-29 15:00:20,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:20,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3036 states and 19299 transitions. [2022-09-29 15:00:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states and 19299 transitions. [2022-09-29 15:00:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2326. [2022-09-29 15:00:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2326 states have (on average 6.57609630266552) internal successors, (15296), 2325 states have internal predecessors, (15296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 15296 transitions. [2022-09-29 15:00:20,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2326 states and 15296 transitions. [2022-09-29 15:00:20,135 INFO L428 stractBuchiCegarLoop]: Abstraction has 2326 states and 15296 transitions. [2022-09-29 15:00:20,135 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:00:20,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2326 states and 15296 transitions. [2022-09-29 15:00:20,212 INFO L131 ngComponentsAnalysis]: Automaton has 243 accepting balls. 612 [2022-09-29 15:00:20,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:20,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:20,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-09-29 15:00:20,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:20,213 INFO L733 eck$LassoCheckResult]: Stem: 13881#[ULTIMATE.startENTRY]don't care [161] ULTIMATE.startENTRY-->L100: Formula: (let ((.cse0 (select v_A_31 0))) (and (<= v_k_24 v_N_16) (= .cse0 v_array_max_38) (<= 0 v_k_24) (= .cse0 v_array_min_38))) InVars {A=v_A_31, N=v_N_16, k=v_k_24} OutVars{A=v_A_31, array_min=v_array_min_38, N=v_N_16, array_max=v_array_max_38, k=v_k_24} AuxVars[] AssignedVars[array_min, array_max] 12109#[L100]don't care [140] L100-->computeMin1ENTRY: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 12111#[computeMin1ENTRY, L100-1]don't care [143] L100-1-->computeMin2ENTRY: 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] 12611#[L101, computeMin2ENTRY, computeMin1ENTRY]don't care [146] L101-->computeMax1ENTRY: 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] 12887#[computeMax1ENTRY, computeMin1ENTRY, computeMin2ENTRY, L102]don't care [122] computeMax1ENTRY-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3] 12959#[L61-1, computeMin2ENTRY, computeMin1ENTRY, L102]don't care [2022-09-29 15:00:20,213 INFO L735 eck$LassoCheckResult]: Loop: 12959#[L61-1, computeMin2ENTRY, computeMin1ENTRY, L102]don't care [160] L61-1-->L61-1: Formula: (and (= (let ((.cse0 (select v_A_29 v_i3_19))) (ite (< v_array_max_35 .cse0) .cse0 v_array_max_35)) v_array_max_34) (< v_i3_19 v_k_22) (= v_i3_18 (+ v_i3_19 1))) InVars {A=v_A_29, array_max=v_array_max_35, i3=v_i3_19, k=v_k_22} OutVars{A=v_A_29, array_max=v_array_max_34, i3=v_i3_18, k=v_k_22} AuxVars[] AssignedVars[array_max, i3] 12959#[L61-1, computeMin2ENTRY, computeMin1ENTRY, L102]don't care [2022-09-29 15:00:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 181628843, now seen corresponding path program 1 times [2022-09-29 15:00:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:20,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167843788] [2022-09-29 15:00:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:20,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:20,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash 191, now seen corresponding path program 1 times [2022-09-29 15:00:20,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:20,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332638873] [2022-09-29 15:00:20,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:20,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:20,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:20,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1335526997, now seen corresponding path program 1 times [2022-09-29 15:00:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212418286] [2022-09-29 15:00:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:20,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:20,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:20,283 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 [2022-09-29 15:00:20,370 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:20,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:20,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:20,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:20,371 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:20,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:20,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:20,371 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration3_Lasso [2022-09-29 15:00:20,371 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:20,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:20,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,378 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,394 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:20,538 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:20,538 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:20,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,539 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) [2022-09-29 15:00:20,550 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 [2022-09-29 15:00:20,550 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 [2022-09-29 15:00:20,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,599 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 [2022-09-29 15:00:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,601 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) [2022-09-29 15:00:20,603 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 [2022-09-29 15:00:20,603 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 [2022-09-29 15:00:20,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,651 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 [2022-09-29 15:00:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,653 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) [2022-09-29 15:00:20,654 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 [2022-09-29 15:00:20,655 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 [2022-09-29 15:00:20,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,701 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 [2022-09-29 15:00:20,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,704 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) [2022-09-29 15:00:20,706 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 [2022-09-29 15:00:20,707 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 [2022-09-29 15:00:20,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-09-29 15:00:20,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,736 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) [2022-09-29 15:00:20,737 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 [2022-09-29 15:00:20,738 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 [2022-09-29 15:00:20,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,791 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 [2022-09-29 15:00:20,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,794 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) [2022-09-29 15:00:20,795 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 [2022-09-29 15:00:20,796 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 [2022-09-29 15:00:20,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-09-29 15:00:20,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,852 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) [2022-09-29 15:00:20,852 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 [2022-09-29 15:00:20,854 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 [2022-09-29 15:00:20,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,861 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-09-29 15:00:20,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,884 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-09-29 15:00:20,885 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-09-29 15:00:20,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:20,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-09-29 15:00:20,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,929 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) [2022-09-29 15:00:20,930 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 [2022-09-29 15:00:20,931 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 [2022-09-29 15:00:20,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:20,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:20,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:20,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:20,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:20,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:20,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:20,976 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-09-29 15:00:20,976 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-09-29 15:00:20,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,980 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) [2022-09-29 15:00:20,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:20,997 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 [2022-09-29 15:00:21,002 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-09-29 15:00:21,002 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:21,003 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i3, N) = -1*i3 + 1*N Supporting invariants [-1*k + 1*N >= 0] [2022-09-29 15:00:21,029 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 [2022-09-29 15:00:21,032 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-09-29 15:00:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:21,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-29 15:00:21,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:21,100 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-29 15:00:21,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:21,101 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-09-29 15:00:21,102 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2326 states and 15296 transitions. cyclomatic complexity: 13471 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:21,286 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2326 states and 15296 transitions. cyclomatic complexity: 13471. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6934 states and 46139 transitions. Complement of second has 5 states. [2022-09-29 15:00:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-09-29 15:00:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-09-29 15:00:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 15:00:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 6 letters. Loop has 1 letters. [2022-09-29 15:00:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 5 letters. Loop has 2 letters. [2022-09-29 15:00:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:21,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6934 states and 46139 transitions. [2022-09-29 15:00:21,512 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 [2022-09-29 15:00:21,541 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 559 [2022-09-29 15:00:21,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6934 states to 5357 states and 35165 transitions. [2022-09-29 15:00:21,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1620 [2022-09-29 15:00:21,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2052 [2022-09-29 15:00:21,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5357 states and 35165 transitions. [2022-09-29 15:00:21,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:21,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5357 states and 35165 transitions. [2022-09-29 15:00:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states and 35165 transitions. [2022-09-29 15:00:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 4126. [2022-09-29 15:00:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 4126 states have (on average 6.719583131362094) internal successors, (27725), 4125 states have internal predecessors, (27725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 27725 transitions. [2022-09-29 15:00:21,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4126 states and 27725 transitions. [2022-09-29 15:00:21,902 INFO L428 stractBuchiCegarLoop]: Abstraction has 4126 states and 27725 transitions. [2022-09-29 15:00:21,902 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-09-29 15:00:21,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4126 states and 27725 transitions. [2022-09-29 15:00:22,024 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 559 [2022-09-29 15:00:22,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:22,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:22,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-09-29 15:00:22,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:22,026 INFO L733 eck$LassoCheckResult]: Stem: 26918#[ULTIMATE.startENTRY]don't care [161] ULTIMATE.startENTRY-->L100: Formula: (let ((.cse0 (select v_A_31 0))) (and (<= v_k_24 v_N_16) (= .cse0 v_array_max_38) (<= 0 v_k_24) (= .cse0 v_array_min_38))) InVars {A=v_A_31, N=v_N_16, k=v_k_24} OutVars{A=v_A_31, array_min=v_array_min_38, N=v_N_16, array_max=v_array_max_38, k=v_k_24} AuxVars[] AssignedVars[array_min, array_max] 24214#[L100]don't care [140] L100-->computeMin1ENTRY: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 24216#[computeMin1ENTRY, L100-1]don't care [143] L100-1-->computeMin2ENTRY: 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] 24886#[L101, computeMin2ENTRY, computeMin1ENTRY]don't care [146] L101-->computeMax1ENTRY: 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] 25358#[computeMax1ENTRY, computeMin1ENTRY, computeMin2ENTRY, L102]don't care [134] L102-->computeMax2ENTRY: 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] 26254#[L103, computeMin1ENTRY, computeMax1ENTRY, computeMin2ENTRY, computeMax2ENTRY]don't care [117] computeMax2ENTRY-->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] 24360#[L103, computeMin1ENTRY, computeMax1ENTRY, L74-1, computeMin2ENTRY]don't care [2022-09-29 15:00:22,026 INFO L735 eck$LassoCheckResult]: Loop: 24360#[L103, computeMin1ENTRY, computeMax1ENTRY, L74-1, computeMin2ENTRY]don't care [157] L74-1-->L74-1: Formula: (and (< v_i4_20 v_N_12) (= (let ((.cse0 (select v_A_23 v_i4_20))) (ite (< v_array_max_27 .cse0) .cse0 v_array_max_27)) v_array_max_26) (= v_i4_19 (+ v_i4_20 1))) InVars {A=v_A_23, N=v_N_12, array_max=v_array_max_27, i4=v_i4_20} OutVars{A=v_A_23, N=v_N_12, array_max=v_array_max_26, i4=v_i4_19} AuxVars[] AssignedVars[array_max, i4] 24360#[L103, computeMin1ENTRY, computeMax1ENTRY, L74-1, computeMin2ENTRY]don't care [2022-09-29 15:00:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1335527326, now seen corresponding path program 1 times [2022-09-29 15:00:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922403176] [2022-09-29 15:00:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 188, now seen corresponding path program 1 times [2022-09-29 15:00:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333012763] [2022-09-29 15:00:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,044 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1548325697, now seen corresponding path program 1 times [2022-09-29 15:00:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710873718] [2022-09-29 15:00:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,164 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:22,165 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:22,165 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:22,165 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:22,165 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:22,165 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,165 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:22,165 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:22,165 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration4_Lasso [2022-09-29 15:00:22,165 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:22,165 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:22,167 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,169 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,172 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,174 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,179 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,181 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,258 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,261 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,395 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:22,395 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:22,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,397 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) [2022-09-29 15:00:22,404 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 [2022-09-29 15:00:22,405 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 [2022-09-29 15:00:22,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-09-29 15:00:22,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,450 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) [2022-09-29 15:00:22,455 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 [2022-09-29 15:00:22,455 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 [2022-09-29 15:00:22,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,501 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 [2022-09-29 15:00:22,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,503 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) [2022-09-29 15:00:22,512 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 [2022-09-29 15:00:22,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,520 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 [2022-09-29 15:00:22,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,553 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 [2022-09-29 15:00:22,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,555 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) [2022-09-29 15:00:22,557 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 [2022-09-29 15:00:22,557 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 [2022-09-29 15:00:22,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,600 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 [2022-09-29 15:00:22,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,603 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) [2022-09-29 15:00:22,608 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 [2022-09-29 15:00:22,610 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 [2022-09-29 15:00:22,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,655 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 [2022-09-29 15:00:22,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,658 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-09-29 15:00:22,664 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 [2022-09-29 15:00:22,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-09-29 15:00:22,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:22,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,715 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-09-29 15:00:22,719 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 [2022-09-29 15:00:22,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,728 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-09-29 15:00:22,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-09-29 15:00:22,734 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-09-29 15:00:22,734 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-09-29 15:00:22,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-09-29 15:00:22,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,786 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-09-29 15:00:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-09-29 15:00:22,797 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 [2022-09-29 15:00:22,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,810 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:22,816 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-09-29 15:00:22,816 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-09-29 15:00:22,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,818 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-09-29 15:00:22,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-09-29 15:00:22,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:22,826 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:22,826 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:22,827 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i4) = 1*N - 1*i4 Supporting invariants [] [2022-09-29 15:00:22,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-09-29 15:00:22,843 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,877 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:22,879 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-09-29 15:00:22,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4126 states and 27725 transitions. cyclomatic complexity: 24284 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:23,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:23,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4126 states and 27725 transitions. cyclomatic complexity: 24284. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11722 states and 78589 transitions. Complement of second has 4 states. [2022-09-29 15:00:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-09-29 15:00:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-09-29 15:00:23,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 6 letters. Loop has 1 letters. [2022-09-29 15:00:23,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:23,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 7 letters. Loop has 1 letters. [2022-09-29 15:00:23,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:23,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2022-09-29 15:00:23,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:23,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11722 states and 78589 transitions. [2022-09-29 15:00:23,326 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 492 [2022-09-29 15:00:23,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11722 states to 8193 states and 54323 transitions. [2022-09-29 15:00:23,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1947 [2022-09-29 15:00:23,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2313 [2022-09-29 15:00:23,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8193 states and 54323 transitions. [2022-09-29 15:00:23,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:23,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8193 states and 54323 transitions. [2022-09-29 15:00:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8193 states and 54323 transitions. [2022-09-29 15:00:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8193 to 6408. [2022-09-29 15:00:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6408 states, 6408 states have (on average 6.752965043695381) internal successors, (43273), 6407 states have internal predecessors, (43273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6408 states to 6408 states and 43273 transitions. [2022-09-29 15:00:23,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6408 states and 43273 transitions. [2022-09-29 15:00:23,950 INFO L428 stractBuchiCegarLoop]: Abstraction has 6408 states and 43273 transitions. [2022-09-29 15:00:23,950 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-09-29 15:00:23,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6408 states and 43273 transitions. [2022-09-29 15:00:24,010 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 492 [2022-09-29 15:00:24,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:24,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:24,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-09-29 15:00:24,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-09-29 15:00:24,013 INFO L733 eck$LassoCheckResult]: Stem: 47497#[ULTIMATE.startENTRY]don't care [161] ULTIMATE.startENTRY-->L100: Formula: (let ((.cse0 (select v_A_31 0))) (and (<= v_k_24 v_N_16) (= .cse0 v_array_max_38) (<= 0 v_k_24) (= .cse0 v_array_min_38))) InVars {A=v_A_31, N=v_N_16, k=v_k_24} OutVars{A=v_A_31, array_min=v_array_min_38, N=v_N_16, array_max=v_array_max_38, k=v_k_24} AuxVars[] AssignedVars[array_min, array_max] 44159#[L100]don't care [140] L100-->computeMin1ENTRY: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 44161#[computeMin1ENTRY, L100-1]don't care [143] L100-1-->computeMin2ENTRY: 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] 44933#[L101, computeMin2ENTRY, computeMin1ENTRY]don't care [146] L101-->computeMax1ENTRY: 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] 45523#[computeMax1ENTRY, computeMin1ENTRY, computeMin2ENTRY, L102]don't care [134] L102-->computeMax2ENTRY: 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] 46633#[L103, computeMin1ENTRY, computeMax1ENTRY, computeMin2ENTRY, computeMax2ENTRY]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] 42131#[computeMin2ENTRY, computeMin1ENTRY, computeMax2ENTRY, L84, L104, computeMax1ENTRY]don't care [2022-09-29 15:00:24,014 INFO L735 eck$LassoCheckResult]: Loop: 42131#[computeMin2ENTRY, computeMin1ENTRY, computeMax2ENTRY, L84, L104, computeMax1ENTRY]don't care [127] 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] 46529#[computeMin2ENTRY, computeMin1ENTRY, computeMax2ENTRY, L104, computeMax1ENTRY, L86]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] 44233#[computeMin2ENTRY, L87, computeMin1ENTRY, computeMax2ENTRY, L104, computeMax1ENTRY]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] 42127#[computeMin2ENTRY, L88, computeMin1ENTRY, computeMax2ENTRY, L104, computeMax1ENTRY]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] 42131#[computeMin2ENTRY, computeMin1ENTRY, computeMax2ENTRY, L84, L104, computeMax1ENTRY]don't care [2022-09-29 15:00:24,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1335527346, now seen corresponding path program 1 times [2022-09-29 15:00:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:24,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688970319] [2022-09-29 15:00:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:24,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:24,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 4835108, now seen corresponding path program 1 times [2022-09-29 15:00:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:24,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938220817] [2022-09-29 15:00:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:24,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:24,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1795624533, now seen corresponding path program 1 times [2022-09-29 15:00:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:24,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126197305] [2022-09-29 15:00:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:24,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:24,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:24,252 INFO L202 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:00:24 BoogieIcfgContainer [2022-09-29 15:00:24,252 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:00:24,253 INFO L158 Benchmark]: Toolchain (without parser) took 7619.82ms. Allocated memory was 178.3MB in the beginning and 596.6MB in the end (delta: 418.4MB). Free memory was 130.7MB in the beginning and 333.8MB in the end (delta: -203.0MB). Peak memory consumption was 217.9MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,253 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:00:24,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.09ms. Allocated memory is still 178.3MB. Free memory was 130.7MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,254 INFO L158 Benchmark]: Boogie Preprocessor took 27.70ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 128.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,254 INFO L158 Benchmark]: RCFGBuilder took 284.36ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 147.1MB in the end (delta: -19.1MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,255 INFO L158 Benchmark]: BuchiAutomizer took 7270.64ms. Allocated memory was 178.3MB in the beginning and 596.6MB in the end (delta: 418.4MB). Free memory was 147.1MB in the beginning and 333.8MB in the end (delta: -186.6MB). Peak memory consumption was 232.3MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,256 INFO L339 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.14ms. Allocated memory is still 178.3MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.09ms. Allocated memory is still 178.3MB. Free memory was 130.7MB in the beginning and 129.1MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.70ms. Allocated memory is still 178.3MB. Free memory was 129.1MB in the beginning and 128.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.36ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 147.1MB in the end (delta: -19.1MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 7270.64ms. Allocated memory was 178.3MB in the beginning and 596.6MB in the end (delta: 418.4MB). Free memory was 147.1MB in the beginning and 333.8MB in the end (delta: -186.6MB). Peak memory consumption was 232.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function k + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 3 locations. One deterministic module has affine ranking function -1 * i3 + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i4 and consists of 3 locations. The remainder module has 6408 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.7s AutomataMinimizationTime, 4 MinimizatonAttempts, 4071 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 62 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital67 mio100 ax100 hnf100 lsp91 ukn70 mio100 lsp57 div100 bol100 ite100 ukn100 eq173 hnf94 smp100 dnf127 smp74 tf100 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms 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.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 84]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {k=0, N=0} State at position 1 is {array_max=8, array_min=8, i1=4612, i2=15182, i3=0, i4=9605, k=0, N=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 84]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L95] 0 assume 0 <= k && k <= N; [L97] 0 array_min := A[0]; [L98] 0 array_max := A[0]; [L100] FORK 0 fork 1 computeMin1(); [L101] FORK 0 fork 2, 2 computeMin2(); [L102] FORK 0 fork 3, 3, 3 computeMax1(); [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 51 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 719 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 542, positive: 524, positive conditional: 0, positive unconditional: 524, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 352, positive: 340, positive conditional: 0, positive unconditional: 340, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 352, positive: 340, positive conditional: 0, positive unconditional: 340, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 542, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 352, unknown conditional: 0, unknown unconditional: 352] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 RESULT: Ultimate proved your program to be incorrect! [2022-09-29 15:00:24,319 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...