./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer --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-cad4683 [2019-11-15 22:43:51,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:43:51,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:43:51,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:43:51,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:43:51,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:43:51,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:43:51,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:43:51,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:43:51,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:43:51,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:43:51,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:43:51,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:43:52,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:43:52,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:43:52,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:43:52,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:43:52,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:43:52,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:43:52,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:43:52,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:43:52,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:43:52,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:43:52,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:43:52,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:43:52,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:43:52,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:43:52,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:43:52,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:43:52,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:43:52,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:43:52,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:43:52,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:43:52,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:43:52,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:43:52,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:43:52,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:43:52,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:43:52,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:43:52,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:43:52,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:43:52,023 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:43:52,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:43:52,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:43:52,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:43:52,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:43:52,042 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:43:52,042 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:43:52,042 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:43:52,042 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:43:52,043 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:43:52,043 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:43:52,043 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:43:52,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:43:52,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:43:52,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:43:52,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:43:52,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:43:52,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:43:52,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:43:52,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:43:52,046 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:43:52,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:43:52,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:43:52,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:43:52,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:43:52,053 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:43:52,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:43:52,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:43:52,054 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:43:52,055 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:43:52,056 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer 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 [2019-11-15 22:43:52,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:43:52,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:43:52,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:43:52,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:43:52,112 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:43:52,112 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2019-11-15 22:43:52,160 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/data/7a610bca6/350a69272d63421391acdfef641c736e/FLAG78323a2c6 [2019-11-15 22:43:52,569 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:43:52,570 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2019-11-15 22:43:52,577 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/data/7a610bca6/350a69272d63421391acdfef641c736e/FLAG78323a2c6 [2019-11-15 22:43:52,593 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/data/7a610bca6/350a69272d63421391acdfef641c736e [2019-11-15 22:43:52,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:43:52,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:43:52,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:52,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:43:52,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:43:52,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14200580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52, skipping insertion in model container [2019-11-15 22:43:52,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:43:52,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:43:52,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:52,885 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:43:52,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:52,919 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:43:52,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52 WrapperNode [2019-11-15 22:43:52,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:52,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:52,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:43:52,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:43:52,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:52,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:43:52,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:43:52,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:43:52,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... [2019-11-15 22:43:52,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:43:52,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:43:52,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:43:52,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:43:52,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/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 [2019-11-15 22:43:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:43:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:43:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:43:53,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:43:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:43:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2019-11-15 22:43:53,048 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2019-11-15 22:43:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:43:53,302 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:43:53,302 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 22:43:53,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:53 BoogieIcfgContainer [2019-11-15 22:43:53,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:43:53,304 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:43:53,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:43:53,307 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:43:53,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:43:53,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:43:52" (1/3) ... [2019-11-15 22:43:53,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dc971d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:43:53, skipping insertion in model container [2019-11-15 22:43:53,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:43:53,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:52" (2/3) ... [2019-11-15 22:43:53,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dc971d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:43:53, skipping insertion in model container [2019-11-15 22:43:53,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:43:53,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:53" (3/3) ... [2019-11-15 22:43:53,312 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive.i [2019-11-15 22:43:53,351 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:43:53,351 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:43:53,352 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:43:53,352 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:43:53,352 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:43:53,352 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:43:53,352 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:43:53,352 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:43:53,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-15 22:43:53,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:43:53,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:53,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:53,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:43:53,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:43:53,428 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:43:53,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-15 22:43:53,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:43:53,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:53,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:53,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:43:53,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:43:53,438 INFO L791 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.allocOnHeap(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 [2019-11-15 22:43:53,438 INFO L793 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 [2019-11-15 22:43:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 22:43:53,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:53,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676424852] [2019-11-15 22:43:53,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:53,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:53,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:53,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2019-11-15 22:43:53,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:53,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066392220] [2019-11-15 22:43:53,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:53,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:53,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:53,582 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2019-11-15 22:43:53,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:53,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352559016] [2019-11-15 22:43:53,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:53,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:53,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:53,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:53,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:43:53,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:43:53,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:43:53,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:43:53,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:43:53,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:43:53,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:43:53,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:43:53,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration1_Lasso [2019-11-15 22:43:53,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:43:53,796 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:43:53,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:53,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:53,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:53,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:53,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:53,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:54,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:43:54,241 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:43:54,243 INFO L120 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 [2019-11-15 22:43:54,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:54,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:54,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:54,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:54,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:54,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:54,252 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:54,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:54,260 INFO L120 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 [2019-11-15 22:43:54,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:54,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:54,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:54,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:54,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:54,263 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:54,263 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:54,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:54,266 INFO L120 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 [2019-11-15 22:43:54,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:54,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:54,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:54,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:54,273 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:54,273 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:54,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:54,292 INFO L120 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 [2019-11-15 22:43:54,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:54,293 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:43:54,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:54,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:54,296 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:43:54,296 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:54,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:54,320 INFO L120 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 [2019-11-15 22:43:54,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:54,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:54,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:54,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:54,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:54,324 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:54,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:54,339 INFO L120 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 [2019-11-15 22:43:54,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:54,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:54,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:54,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:54,345 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:54,345 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:54,425 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:43:54,488 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:43:54,488 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:43:54,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:43:54,492 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:43:54,492 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:43:54,493 INFO L512 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 [] [2019-11-15 22:43:54,501 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:43:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:54,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:54,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:54,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:43:54,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:54,576 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 [2019-11-15 22:43:54,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2019-11-15 22:43:54,633 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. [2019-11-15 22:43:54,634 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 [2019-11-15 22:43:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:43:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-11-15 22:43:54,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 22:43:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:43:54,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:54,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 22:43:54,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:54,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-15 22:43:54,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:43:54,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2019-11-15 22:43:54,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:43:54,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:43:54,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 22:43:54,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:54,652 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:43:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 22:43:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 22:43:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 22:43:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 22:43:54,678 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:43:54,679 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:43:54,679 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:43:54,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 22:43:54,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:43:54,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:54,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:54,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:43:54,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:43:54,681 INFO L791 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.allocOnHeap(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 [2019-11-15 22:43:54,681 INFO L793 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 [2019-11-15 22:43:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:54,682 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2019-11-15 22:43:54,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:54,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931050385] [2019-11-15 22:43:54,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:54,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931050385] [2019-11-15 22:43:54,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:54,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:54,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737467251] [2019-11-15 22:43:54,734 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:43:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2019-11-15 22:43:54,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:54,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339109963] [2019-11-15 22:43:54,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:54,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339109963] [2019-11-15 22:43:54,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:54,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:54,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902169722] [2019-11-15 22:43:54,753 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:43:54,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:54,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:54,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:54,757 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 22:43:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:54,773 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-15 22:43:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:54,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-15 22:43:54,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:43:54,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 22:43:54,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:43:54,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:43:54,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-15 22:43:54,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:54,776 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:43:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-15 22:43:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 22:43:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:43:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 22:43:54,778 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:43:54,778 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:43:54,778 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:43:54,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-15 22:43:54,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:43:54,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:54,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:54,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:43:54,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:54,779 INFO L791 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.allocOnHeap(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 [2019-11-15 22:43:54,780 INFO L793 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~mem2;havoc #t~mem3;~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 [2019-11-15 22:43:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2019-11-15 22:43:54,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:54,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509293136] [2019-11-15 22:43:54,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:54,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509293136] [2019-11-15 22:43:54,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:54,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:54,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369847876] [2019-11-15 22:43:54,802 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:43:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2019-11-15 22:43:54,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:54,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083276464] [2019-11-15 22:43:54,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:54,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:54,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:55,065 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-15 22:43:55,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:55,284 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:43:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:55,296 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-15 22:43:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:55,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-15 22:43:55,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:43:55,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 22:43:55,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:43:55,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:43:55,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-15 22:43:55,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:55,299 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 22:43:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-15 22:43:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 22:43:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:43:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 22:43:55,301 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 22:43:55,301 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 22:43:55,301 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:43:55,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-15 22:43:55,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:43:55,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:55,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:55,302 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:55,303 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:55,303 INFO L791 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.allocOnHeap(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 [2019-11-15 22:43:55,306 INFO L793 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~mem2;havoc #t~mem3;~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 [2019-11-15 22:43:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2019-11-15 22:43:55,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:55,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008101920] [2019-11-15 22:43:55,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:55,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:55,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:55,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2019-11-15 22:43:55,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:55,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28827532] [2019-11-15 22:43:55,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:55,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:55,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:55,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2019-11-15 22:43:55,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:55,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993562339] [2019-11-15 22:43:55,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:55,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:55,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:43:55,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993562339] [2019-11-15 22:43:55,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334353159] [2019-11-15 22:43:55,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:55,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:43:55,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:43:55,633 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:43:55,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 22:43:55,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817505547] [2019-11-15 22:43:55,879 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-15 22:43:56,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:43:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:43:56,098 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-15 22:43:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:56,183 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-11-15 22:43:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:43:56,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-11-15 22:43:56,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:43:56,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2019-11-15 22:43:56,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:43:56,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:43:56,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-15 22:43:56,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:56,185 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 22:43:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-15 22:43:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 22:43:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:43:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 22:43:56,187 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 22:43:56,187 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 22:43:56,187 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:43:56,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 22:43:56,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:43:56,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:56,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:56,188 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:43:56,188 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:56,189 INFO L791 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.allocOnHeap(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 [2019-11-15 22:43:56,189 INFO L793 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~mem2;havoc #t~mem3;~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 [2019-11-15 22:43:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:56,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2019-11-15 22:43:56,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:56,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230854499] [2019-11-15 22:43:56,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:56,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:56,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2019-11-15 22:43:56,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:56,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817920830] [2019-11-15 22:43:56,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:56,228 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2019-11-15 22:43:56,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:56,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180753067] [2019-11-15 22:43:56,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:56,292 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:56,494 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-11-15 22:43:56,870 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-11-15 22:43:57,050 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:43:57,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:43:57,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:43:57,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:43:57,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:43:57,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:43:57,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:43:57,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:43:57,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration5_Lasso [2019-11-15 22:43:57,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:43:57,051 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:43:57,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:57,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:43:57,428 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:43:57,429 INFO L120 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 [2019-11-15 22:43:57,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,431 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,431 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,433 INFO L120 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 [2019-11-15 22:43:57,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:57,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:57,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,437 INFO L120 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 [2019-11-15 22:43:57,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,437 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,438 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,439 INFO L120 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 [2019-11-15 22:43:57,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,440 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,442 INFO L120 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 [2019-11-15 22:43:57,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,443 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,444 INFO L120 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 [2019-11-15 22:43:57,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,445 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,447 INFO L120 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 [2019-11-15 22:43:57,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,448 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,449 INFO L120 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 [2019-11-15 22:43:57,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,452 INFO L120 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 [2019-11-15 22:43:57,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,454 INFO L120 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 [2019-11-15 22:43:57,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,457 INFO L120 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 [2019-11-15 22:43:57,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,458 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,459 INFO L120 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 [2019-11-15 22:43:57,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,461 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,462 INFO L120 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 [2019-11-15 22:43:57,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,464 INFO L120 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 [2019-11-15 22:43:57,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,465 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,465 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,466 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,466 INFO L120 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 [2019-11-15 22:43:57,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,469 INFO L120 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 [2019-11-15 22:43:57,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:57,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:57,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,473 INFO L120 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 [2019-11-15 22:43:57,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,473 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,474 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,475 INFO L120 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 [2019-11-15 22:43:57,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,476 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,477 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,478 INFO L120 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 [2019-11-15 22:43:57,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,479 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,481 INFO L120 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 [2019-11-15 22:43:57,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,481 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,482 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,483 INFO L120 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 [2019-11-15 22:43:57,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,484 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,485 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,486 INFO L120 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 [2019-11-15 22:43:57,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,487 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,487 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,488 INFO L120 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 [2019-11-15 22:43:57,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,489 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,490 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,491 INFO L120 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 [2019-11-15 22:43:57,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,492 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,492 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,492 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,493 INFO L120 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 [2019-11-15 22:43:57,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,494 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,494 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,494 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,495 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,496 INFO L120 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 [2019-11-15 22:43:57,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,496 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,498 INFO L120 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 [2019-11-15 22:43:57,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:57,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:57,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:57,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,501 INFO L120 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 [2019-11-15 22:43:57,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,501 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:43:57,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,515 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:43:57,515 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:57,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:57,521 INFO L120 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 [2019-11-15 22:43:57,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:57,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:57,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:57,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:57,525 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:57,525 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:57,542 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:43:57,571 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:43:57,571 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:43:57,572 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:43:57,573 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:43:57,573 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:43:57,573 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, selectionSort_#in~size) = -1*selectionSort_#in~startIndex + 1*selectionSort_#in~size Supporting invariants [] [2019-11-15 22:43:57,578 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 22:43:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:57,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:43:57,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:57,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:43:57,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:43:57,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:43:57,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 22:43:57,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 39 states and 48 transitions. Complement of second has 11 states. [2019-11-15 22:43:57,710 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 [2019-11-15 22:43:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:43:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 22:43:57,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2019-11-15 22:43:57,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:57,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2019-11-15 22:43:57,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:57,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2019-11-15 22:43:57,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:57,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-11-15 22:43:57,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:43:57,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2019-11-15 22:43:57,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:43:57,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:43:57,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-15 22:43:57,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:43:57,718 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-15 22:43:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-15 22:43:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-15 22:43:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:43:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-15 22:43:57,721 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 22:43:57,721 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 22:43:57,721 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:43:57,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-15 22:43:57,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:43:57,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:57,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:57,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:57,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:43:57,723 INFO L791 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#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; 441#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 442#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; 448#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 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; 450#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 451#L36-3 assume !(main_~i~0 < main_~n~0); 431#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 436#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 438#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 443#L14-3 [2019-11-15 22:43:57,724 INFO L793 eck$LassoCheckResult]: Loop: 443#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); 430#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 432#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 443#L14-3 [2019-11-15 22:43:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:57,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2019-11-15 22:43:57,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:57,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260579299] [2019-11-15 22:43:57,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:57,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:57,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:57,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2019-11-15 22:43:57,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:57,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707048769] [2019-11-15 22:43:57,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:57,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:57,746 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2019-11-15 22:43:57,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:57,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379796123] [2019-11-15 22:43:57,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:57,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:57,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:57,764 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:58,048 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-11-15 22:43:58,260 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-15 22:43:58,306 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:43:58,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:43:58,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:43:58,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:43:58,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:43:58,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:43:58,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:43:58,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:43:58,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration6_Lasso [2019-11-15 22:43:58,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:43:58,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:43:58,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:58,835 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:43:58,836 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:43:58,836 INFO L120 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 [2019-11-15 22:43:58,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:58,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:58,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:58,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,838 INFO L120 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 [2019-11-15 22:43:58,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:58,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:58,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:58,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,841 INFO L120 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 [2019-11-15 22:43:58,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,842 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:58,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,843 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:58,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:58,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,843 INFO L120 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 [2019-11-15 22:43:58,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,845 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:58,845 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:58,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,847 INFO L120 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 [2019-11-15 22:43:58,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:58,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:58,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:58,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,849 INFO L120 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 [2019-11-15 22:43:58,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:58,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:58,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:58,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,852 INFO L120 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 [2019-11-15 22:43:58,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:58,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:58,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:58,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,854 INFO L120 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 [2019-11-15 22:43:58,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,855 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:58,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:58,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:58,857 INFO L120 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 [2019-11-15 22:43:58,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:58,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:58,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:58,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:58,860 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:58,860 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:58,888 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:43:58,923 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:43:58,930 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:43:58,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:43:58,939 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:43:58,939 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:43:58,940 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2019-11-15 22:43:58,948 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:43:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:58,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:43:58,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:59,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:43:59,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:59,016 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 [2019-11-15 22:43:59,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:43:59,044 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. [2019-11-15 22:43:59,046 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 [2019-11-15 22:43:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:43:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:43:59,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 22:43:59,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:59,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:43:59,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:59,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 22:43:59,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:59,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2019-11-15 22:43:59,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:43:59,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2019-11-15 22:43:59,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:43:59,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:43:59,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-15 22:43:59,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:43:59,050 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 22:43:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-15 22:43:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-11-15 22:43:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:43:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-15 22:43:59,055 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-15 22:43:59,055 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-15 22:43:59,056 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:43:59,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-15 22:43:59,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:43:59,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:59,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:59,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:59,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:43:59,058 INFO L791 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 585#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; 586#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 587#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; 593#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 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; 595#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 596#L36-3 assume !(main_~i~0 < main_~n~0); 579#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 581#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 582#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 589#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); 578#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 580#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 592#L14-3 assume !(~index~0 < ~size); 590#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); 576#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 583#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 584#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 588#L14-3 [2019-11-15 22:43:59,058 INFO L793 eck$LassoCheckResult]: Loop: 588#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); 575#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 577#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 588#L14-3 [2019-11-15 22:43:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2019-11-15 22:43:59,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:59,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299410901] [2019-11-15 22:43:59,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:43:59,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299410901] [2019-11-15 22:43:59,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806304316] [2019-11-15 22:43:59,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b3dc4a9-cec0-4bc0-be94-b1786d5be764/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:59,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:43:59,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:43:59,321 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:43:59,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2019-11-15 22:43:59,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423709493] [2019-11-15 22:43:59,321 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:43:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2019-11-15 22:43:59,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:59,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100257542] [2019-11-15 22:43:59,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,328 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:59,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:43:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:43:59,399 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-15 22:43:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:59,665 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-11-15 22:43:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:43:59,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2019-11-15 22:43:59,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:43:59,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2019-11-15 22:43:59,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:43:59,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:43:59,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-15 22:43:59,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:43:59,669 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-15 22:43:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-15 22:43:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-15 22:43:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:43:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-15 22:43:59,671 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-15 22:43:59,671 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-15 22:43:59,672 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:43:59,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-11-15 22:43:59,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:43:59,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:59,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:59,673 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:59,673 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:43:59,673 INFO L791 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 746#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; 747#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 748#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; 755#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 762#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; 758#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 756#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; 757#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 759#L36-3 assume !(main_~i~0 < main_~n~0); 740#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 742#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 743#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 751#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); 761#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 754#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 750#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); 739#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem2;havoc #t~mem3; 741#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 760#L14-3 assume !(~index~0 < ~size); 752#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); 737#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 744#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 745#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 749#L14-3 [2019-11-15 22:43:59,674 INFO L793 eck$LassoCheckResult]: Loop: 749#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); 736#L16 assume #t~mem2 < #t~mem3;havoc #t~mem2;havoc #t~mem3;~minIndex~0 := ~index~0; 738#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 749#L14-3 [2019-11-15 22:43:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:59,674 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2019-11-15 22:43:59,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:59,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510005730] [2019-11-15 22:43:59,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,701 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:59,701 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2019-11-15 22:43:59,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:59,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39332228] [2019-11-15 22:43:59,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,708 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2019-11-15 22:43:59,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:59,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98995781] [2019-11-15 22:43:59,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:59,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:59,757 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:59,992 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-11-15 22:44:00,212 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-11-15 22:44:00,479 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-11-15 22:44:00,847 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 106 [2019-11-15 22:44:00,943 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:44:00,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:44:00,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:44:00,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:44:00,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:44:00,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:44:00,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:44:00,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:44:00,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive.i_Iteration8_Lasso [2019-11-15 22:44:00,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:44:00,944 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:44:00,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:00,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:00,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:00,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:00,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:00,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:00,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,162 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-11-15 22:44:01,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:44:01,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:44:01,579 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:44:01,579 INFO L120 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 [2019-11-15 22:44:01,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:44:01,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:44:01,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:44:01,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:44:01,581 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:44:01,581 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:44:01,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:44:01,582 INFO L120 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 [2019-11-15 22:44:01,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:44:01,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:44:01,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:44:01,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:44:01,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:44:01,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:44:01,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:44:01,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:44:01,584 INFO L120 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 [2019-11-15 22:44:01,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:44:01,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:44:01,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:44:01,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:44:01,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:44:01,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:44:01,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:44:01,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:44:01,585 INFO L120 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 [2019-11-15 22:44:01,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:44:01,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:44:01,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:44:01,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:44:01,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:44:01,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:44:01,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:44:01,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:44:01,587 INFO L120 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 [2019-11-15 22:44:01,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:44:01,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:44:01,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:44:01,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:44:01,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:44:01,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:44:01,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:44:01,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:44:01,590 INFO L120 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 [2019-11-15 22:44:01,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:44:01,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:44:01,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:44:01,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:44:01,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:44:01,594 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:44:01,659 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:44:01,724 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:44:01,725 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 22:44:01,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:44:01,726 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:44:01,726 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:44:01,726 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~size) = -1*selectionSort_~index~0 + 1*selectionSort_~size Supporting invariants [] [2019-11-15 22:44:01,774 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-11-15 22:44:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:01,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:44:01,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:01,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:44:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:44:01,848 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 [2019-11-15 22:44:01,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:44:01,863 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. [2019-11-15 22:44:01,865 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 [2019-11-15 22:44:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:44:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:44:01,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 22:44:01,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:44:01,865 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:44:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:01,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:44:01,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:01,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:44:01,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:44:01,925 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 [2019-11-15 22:44:01,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:44:01,943 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. [2019-11-15 22:44:01,944 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 [2019-11-15 22:44:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:44:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:44:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 22:44:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:44:01,945 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:44:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:01,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:44:01,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:01,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:44:01,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:44:02,016 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 [2019-11-15 22:44:02,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:44:02,034 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. [2019-11-15 22:44:02,036 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 [2019-11-15 22:44:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:44:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 22:44:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 22:44:02,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:44:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2019-11-15 22:44:02,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:44:02,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2019-11-15 22:44:02,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:44:02,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-15 22:44:02,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:44:02,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-11-15 22:44:02,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:44:02,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:44:02,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:44:02,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:44:02,040 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:44:02,040 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:44:02,040 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:44:02,040 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:44:02,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:44:02,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:44:02,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:44:02,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:44:02 BoogieIcfgContainer [2019-11-15 22:44:02,048 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:44:02,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:44:02,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:44:02,048 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:44:02,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:53" (3/4) ... [2019-11-15 22:44:02,053 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:44:02,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:44:02,056 INFO L168 Benchmark]: Toolchain (without parser) took 9456.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 947.4 MB in the beginning and 1.0 GB in the end (delta: -74.4 MB). Peak memory consumption was 143.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,060 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:44:02,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:44:02,062 INFO L168 Benchmark]: Boogie Preprocessor took 21.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,062 INFO L168 Benchmark]: RCFGBuilder took 331.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,065 INFO L168 Benchmark]: BuchiAutomizer took 8743.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.1 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,065 INFO L168 Benchmark]: Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:02,072 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8743.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.1 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * 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 -1 * \old(startIndex) + \old(size) and consists of 4 locations. One deterministic module has affine ranking function -1 * index + size and consists of 4 locations. One nondeterministic module has affine ranking function -1 * index + size 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 8.7s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 7.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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: 1/1 HoareTripleCheckerStatistics: 118 SDtfs, 136 SDslu, 138 SDs, 0 SdLazy, 272 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital186 mio100 ax100 hnf99 lsp96 ukn70 mio100 lsp64 div100 bol100 ite100 ukn100 eq163 hnf89 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 3 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...