./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6ac1507c93933134ec25f982abf479335179fe0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:24:49,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:49,756 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:49,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:49,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:49,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:49,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:49,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:49,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:49,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:49,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:49,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:49,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:49,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:49,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:49,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:49,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:49,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:49,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:49,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:49,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:49,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:49,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:49,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:49,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:49,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:49,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:49,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:49,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:49,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:49,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:49,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:49,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:49,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:49,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:49,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:49,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:49,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:49,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:49,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:49,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:49,843 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:49,844 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:49,844 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:49,844 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:49,844 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:49,844 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:49,844 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:49,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:49,845 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:49,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:49,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:49,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:49,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:49,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:49,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:49,846 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:49,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:49,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:49,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:49,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:49,847 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:49,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:49,847 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:49,847 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:49,850 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:49,850 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ac1507c93933134ec25f982abf479335179fe0d [2018-11-28 23:24:49,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:49,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:49,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:49,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:49,932 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:49,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-28 23:24:50,005 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff31871a/f15a8fbfb09647a08c39c0abb7eb6048/FLAG11cd47984 [2018-11-28 23:24:50,469 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:50,470 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-11-28 23:24:50,477 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff31871a/f15a8fbfb09647a08c39c0abb7eb6048/FLAG11cd47984 [2018-11-28 23:24:50,832 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff31871a/f15a8fbfb09647a08c39c0abb7eb6048 [2018-11-28 23:24:50,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:50,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:50,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:50,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:50,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:50,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:50" (1/1) ... [2018-11-28 23:24:50,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51390636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:50, skipping insertion in model container [2018-11-28 23:24:50,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:50" (1/1) ... [2018-11-28 23:24:50,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:50,876 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:51,092 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:51,116 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:51,149 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:51,169 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:51,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51 WrapperNode [2018-11-28 23:24:51,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:51,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:51,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:51,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:51,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:51,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:51,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:51,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:51,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... [2018-11-28 23:24:51,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:51,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:51,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:51,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:51,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-11-28 23:24:51,366 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-11-28 23:24:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:51,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:51,751 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:24:51,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:51 BoogieIcfgContainer [2018-11-28 23:24:51,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:51,752 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:51,752 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:51,756 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:51,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:51,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:50" (1/3) ... [2018-11-28 23:24:51,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f584a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:51, skipping insertion in model container [2018-11-28 23:24:51,759 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:51,759 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:51" (2/3) ... [2018-11-28 23:24:51,759 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f584a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:51, skipping insertion in model container [2018-11-28 23:24:51,759 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:51,759 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:51" (3/3) ... [2018-11-28 23:24:51,761 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-11-28 23:24:51,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:51,820 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:51,820 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:51,820 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:51,821 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:51,821 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:51,821 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:51,821 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:51,821 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:51,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 23:24:51,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:51,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:51,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:51,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:51,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:51,871 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:51,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 23:24:51,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:51,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:51,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:51,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:24:51,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:51,883 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2018-11-28 23:24:51,884 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2018-11-28 23:24:51,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:24:51,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:51,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:52,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-11-28 23:24:52,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:52,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:52,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:52,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-11-28 23:24:52,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:52,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:52,322 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:24:52,510 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:24:52,539 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:52,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:52,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:52,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:52,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:52,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:52,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:52,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:52,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:24:52,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:52,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:52,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:52,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:52,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:52,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:52,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:52,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:53,337 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:24:53,445 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:24:53,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:53,540 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:53,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:53,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:53,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:53,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:53,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:53,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:53,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:53,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:53,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:53,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:53,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:53,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:53,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:53,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:53,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:53,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:53,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:53,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:53,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:53,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:53,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:53,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:53,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:53,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:53,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:53,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:53,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:53,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:53,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:53,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:53,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:53,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:53,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:53,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:53,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:53,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:53,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:53,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:53,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:53,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:53,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:53,702 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:53,765 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:53,766 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:24:53,769 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:53,771 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:53,772 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:53,773 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:24:53,805 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:53,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:53,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:53,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:53,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:24:53,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-11-28 23:24:54,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2018-11-28 23:24:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:24:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-28 23:24:54,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:24:54,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:54,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:24:54,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:54,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:24:54,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:54,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2018-11-28 23:24:54,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:24:54,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2018-11-28 23:24:54,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:24:54,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:24:54,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 23:24:54,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:54,077 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:24:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 23:24:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:24:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:24:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 23:24:54,104 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:24:54,104 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:24:54,104 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:54,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 23:24:54,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:24:54,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:54,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:54,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:54,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:54,106 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 122#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 120#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 121#L36-3 assume !(main_~i~0 < main_~n~0); 115#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 118#selectionSortENTRY [2018-11-28 23:24:54,107 INFO L796 eck$LassoCheckResult]: Loop: 118#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 119#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 123#L14-3 assume !(~index~0 < ~size); 124#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 116#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 118#selectionSortENTRY [2018-11-28 23:24:54,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2018-11-28 23:24:54,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:54,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:54,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:54,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:54,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:24:54,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:54,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2018-11-28 23:24:54,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:54,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:54,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:54,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:54,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:54,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:24:54,252 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:24:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:24:54,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:24:54,262 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:24:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:54,293 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 23:24:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:24:54,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 23:24:54,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:54,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:24:54,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:24:54,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:54,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 23:24:54,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:54,298 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:24:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 23:24:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:24:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:24:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:24:54,300 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:24:54,301 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:24:54,301 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:54,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 23:24:54,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:54,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:54,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:54,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:24:54,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:54,303 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 157#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 158#L36-3 assume !(main_~i~0 < main_~n~0); 152#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 154#selectionSortENTRY [2018-11-28 23:24:54,303 INFO L796 eck$LassoCheckResult]: Loop: 154#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 155#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 159#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 150#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 153#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 162#L14-3 assume !(~index~0 < ~size); 160#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 154#selectionSortENTRY [2018-11-28 23:24:54,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2018-11-28 23:24:54,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:54,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:54,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:54,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:24:54,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:54,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2018-11-28 23:24:54,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:54,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:54,818 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 23:24:54,930 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:24:55,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:24:55,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:24:55,084 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:24:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:55,097 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-28 23:24:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:24:55,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-28 23:24:55,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:55,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 23:24:55,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:24:55,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:55,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:24:55,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:55,101 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:24:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 23:24:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:24:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:24:55,103 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:24:55,103 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:24:55,103 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:55,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 23:24:55,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:55,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:55,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:55,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:55,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:55,105 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 194#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 195#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 200#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 201#L36-3 assume !(main_~i~0 < main_~n~0); 188#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 191#selectionSortENTRY [2018-11-28 23:24:55,106 INFO L796 eck$LassoCheckResult]: Loop: 191#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 192#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 196#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 187#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 190#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 199#L14-3 assume !(~index~0 < ~size); 197#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 189#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 191#selectionSortENTRY [2018-11-28 23:24:55,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2018-11-28 23:24:55,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:55,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:55,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:55,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2018-11-28 23:24:55,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:55,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:55,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:55,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2018-11-28 23:24:55,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:55,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:55,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:24:55,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:55,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:55,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:24:55,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:55,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 23:24:55,974 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 23:24:56,094 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-28 23:24:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:24:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:24:56,219 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-28 23:24:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:56,330 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-28 23:24:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:24:56,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-28 23:24:56,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:56,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2018-11-28 23:24:56,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:24:56,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:56,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 23:24:56,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:56,335 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:24:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 23:24:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 23:24:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:24:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 23:24:56,339 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 23:24:56,339 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 23:24:56,339 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:56,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 23:24:56,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:24:56,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:56,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:56,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:24:56,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:56,343 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 290#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 291#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 292#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 297#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 298#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 299#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 300#L36-3 assume !(main_~i~0 < main_~n~0); 285#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 288#selectionSortENTRY [2018-11-28 23:24:56,343 INFO L796 eck$LassoCheckResult]: Loop: 288#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 289#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 293#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 284#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 287#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 296#L14-3 assume !(~index~0 < ~size); 294#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 286#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 288#selectionSortENTRY [2018-11-28 23:24:56,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2018-11-28 23:24:56,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:56,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:56,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2018-11-28 23:24:56,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:56,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:56,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:56,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2018-11-28 23:24:56,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:56,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:56,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:56,920 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 23:24:57,112 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:24:57,311 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-28 23:24:57,542 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:24:57,788 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 23:24:57,998 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:57,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:57,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:57,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:57,999 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:57,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:57,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:57,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:58,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:24:58,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:58,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:58,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,276 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-11-28 23:24:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:58,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:58,672 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:58,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:58,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:58,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:58,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:58,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:58,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:58,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:58,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:58,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:58,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:58,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:58,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:58,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:58,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:58,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:58,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:58,856 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:58,901 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:24:58,901 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:24:58,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:58,903 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:58,903 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:58,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, v_rep(select #length selectionSort_#in~array.base)_1, selectionSort_#in~array.offset) = -4*selectionSort_#in~startIndex + 1*v_rep(select #length selectionSort_#in~array.base)_1 - 1*selectionSort_#in~array.offset Supporting invariants [] [2018-11-28 23:24:58,956 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:24:58,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:59,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:59,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:59,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:59,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:24:59,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 23:24:59,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 15 states. [2018-11-28 23:24:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-28 23:24:59,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-28 23:24:59,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:59,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-28 23:24:59,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:59,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-28 23:24:59,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:59,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-11-28 23:24:59,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:59,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2018-11-28 23:24:59,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:24:59,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:24:59,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-28 23:24:59,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:59,842 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-28 23:24:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-28 23:24:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-11-28 23:24:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:24:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-28 23:24:59,845 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 23:24:59,845 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 23:24:59,845 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:59,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-28 23:24:59,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:59,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:59,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:59,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:59,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:59,849 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 448#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 449#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 455#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 456#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 457#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 458#L36-3 assume !(main_~i~0 < main_~n~0); 438#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 443#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 445#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 450#L14-3 [2018-11-28 23:24:59,849 INFO L796 eck$LassoCheckResult]: Loop: 450#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 437#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 439#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 450#L14-3 [2018-11-28 23:24:59,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2018-11-28 23:24:59,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:59,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:59,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:59,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:59,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:59,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2018-11-28 23:24:59,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:59,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:59,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:59,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2018-11-28 23:24:59,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:59,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:59,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:59,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:00,066 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:25:00,420 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 23:25:00,667 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2018-11-28 23:25:00,817 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-28 23:25:00,819 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:25:00,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:25:00,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:25:00,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:25:00,819 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:25:00,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:25:00,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:25:00,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:25:00,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:25:00,820 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:25:00,820 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:25:00,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:00,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:01,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:01,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:01,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:01,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:01,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:01,325 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-11-28 23:25:01,699 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:25:01,700 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:25:01,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:01,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:01,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:01,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:01,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:01,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:01,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:01,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:01,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:01,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:01,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:01,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:01,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:01,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:01,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:01,809 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:25:01,833 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:25:01,833 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:25:01,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:25:01,835 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:25:01,835 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:25:01,835 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, v_rep(select #length selectionSort_~array.base)_1, selectionSort_~array.offset) = -4*selectionSort_~index~0 + 1*v_rep(select #length selectionSort_~array.base)_1 - 1*selectionSort_~array.offset Supporting invariants [] [2018-11-28 23:25:01,946 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:25:01,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:25:01,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:02,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:02,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:02,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:25:02,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:25:02,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2018-11-28 23:25:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:25:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:25:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:25:02,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:25:02,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:02,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:25:02,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:02,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:25:02,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:02,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-11-28 23:25:02,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:02,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2018-11-28 23:25:02,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:25:02,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:25:02,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-11-28 23:25:02,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:25:02,222 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-28 23:25:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-11-28 23:25:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-28 23:25:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:25:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 23:25:02,224 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:25:02,224 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:25:02,224 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:25:02,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 23:25:02,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:02,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:02,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:02,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:25:02,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:25:02,226 INFO L794 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 592#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 593#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 594#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 600#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 601#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 602#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 603#L36-3 assume !(main_~i~0 < main_~n~0); 586#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 588#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 589#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 596#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 585#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 587#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 599#L14-3 assume !(~index~0 < ~size); 597#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 583#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 590#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 591#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 595#L14-3 [2018-11-28 23:25:02,227 INFO L796 eck$LassoCheckResult]: Loop: 595#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 582#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 584#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 595#L14-3 [2018-11-28 23:25:02,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2018-11-28 23:25:02,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:02,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:25:02,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:02,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:02,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:02,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:25:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-11-28 23:25:02,606 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:02,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2018-11-28 23:25:02,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:02,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:02,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:25:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:25:02,727 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-11-28 23:25:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:03,039 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-28 23:25:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 23:25:03,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2018-11-28 23:25:03,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:03,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2018-11-28 23:25:03,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:25:03,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:25:03,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-11-28 23:25:03,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:25:03,044 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 23:25:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-11-28 23:25:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-28 23:25:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:25:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 23:25:03,049 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 23:25:03,050 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 23:25:03,050 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:25:03,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 23:25:03,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:03,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:03,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:03,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:25:03,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:25:03,055 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 754#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 755#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 762#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 769#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 765#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 763#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 764#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 766#L36-3 assume !(main_~i~0 < main_~n~0); 747#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 749#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 750#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 758#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 768#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 761#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 757#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 746#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 748#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 767#L14-3 assume !(~index~0 < ~size); 759#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 744#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 751#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 752#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 756#L14-3 [2018-11-28 23:25:03,055 INFO L796 eck$LassoCheckResult]: Loop: 756#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 743#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 745#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 756#L14-3 [2018-11-28 23:25:03,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2018-11-28 23:25:03,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:03,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:03,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:03,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2018-11-28 23:25:03,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:03,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:03,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:03,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:03,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:03,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2018-11-28 23:25:03,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:03,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:03,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:03,458 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:25:03,709 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:25:03,884 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:25:04,154 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-28 23:25:04,465 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-28 23:25:04,628 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 23:25:05,043 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-28 23:25:05,643 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-11-28 23:25:05,713 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:25:05,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:25:05,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:25:05,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:25:05,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:25:05,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:25:05,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:25:05,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:25:05,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-28 23:25:05,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:25:05,715 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:25:05,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:05,938 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-28 23:25:06,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:06,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:06,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:06,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:25:06,418 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:25:06,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:06,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:06,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:06,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:06,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,477 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:25:06,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,478 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:25:06,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:06,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:06,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:06,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:06,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:06,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:06,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:06,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:06,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:06,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:06,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:06,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:06,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:06,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:06,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:06,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:06,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:25:06,639 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:25:06,639 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:25:06,640 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:25:06,642 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:25:06,642 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:25:06,643 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_2) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [] [2018-11-28 23:25:06,833 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:25:06,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:25:07,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:07,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:07,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:07,436 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:25:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:07,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:25:07,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:25:07,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-28 23:25:07,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:25:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:25:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:25:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 23:25:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:07,660 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:25:07,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:08,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:08,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:08,035 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:25:08,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:25:08,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-28 23:25:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:25:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:25:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:25:08,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 23:25:08,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:08,061 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:25:08,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:08,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:08,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:08,155 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:25:08,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:25:08,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2018-11-28 23:25:08,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:25:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:25:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-28 23:25:08,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 23:25:08,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:08,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-11-28 23:25:08,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:08,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-28 23:25:08,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:08,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-11-28 23:25:08,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:25:08,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-28 23:25:08,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:25:08,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:25:08,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:25:08,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:08,208 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:25:08,208 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:25:08,208 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:25:08,208 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:25:08,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:25:08,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:25:08,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:25:08,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:25:08 BoogieIcfgContainer [2018-11-28 23:25:08,218 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:25:08,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:25:08,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:25:08,219 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:25:08,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:51" (3/4) ... [2018-11-28 23:25:08,224 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:25:08,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:25:08,225 INFO L168 Benchmark]: Toolchain (without parser) took 17388.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -320.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:08,227 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:08,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:08,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:08,229 INFO L168 Benchmark]: Boogie Preprocessor took 26.99 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:08,230 INFO L168 Benchmark]: RCFGBuilder took 510.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:08,231 INFO L168 Benchmark]: BuchiAutomizer took 16466.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -175.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:08,231 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:08,238 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.99 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 510.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16466.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -175.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -4 * \old(startIndex) + unknown-#length-unknown[array] + -1 * array and consists of 5 locations. One deterministic module has affine ranking function -4 * index + unknown-#length-unknown[array] + -1 * array and consists of 4 locations. One nondeterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.4s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 12.9s. Construction of modules took 0.5s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 112 SDtfs, 139 SDslu, 116 SDs, 0 SdLazy, 265 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp66 div100 bol100 ite100 ukn100 eq161 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...