./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.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_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/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 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:34:40,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:34:40,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:34:40,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:34:40,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:34:40,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:34:40,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:34:40,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:34:40,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:34:40,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:34:40,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:34:40,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:34:40,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:34:40,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:34:40,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:34:40,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:34:40,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:34:40,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:34:40,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:34:40,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:34:40,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:34:40,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:34:40,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:34:40,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:34:40,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:34:40,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:34:40,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:34:40,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:34:40,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:34:40,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:34:40,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:34:40,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:34:40,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:34:40,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:34:40,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:34:40,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:34:40,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:34:40,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:34:40,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:34:40,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:34:40,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:34:40,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:34:40,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:34:40,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:34:40,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:34:40,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:34:40,594 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:34:40,594 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:34:40,594 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:34:40,595 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:34:40,595 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:34:40,595 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:34:40,595 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:34:40,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:34:40,596 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:34:40,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:34:40,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:34:40,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:34:40,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:34:40,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:34:40,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:34:40,597 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:34:40,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:34:40,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:34:40,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:34:40,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:34:40,598 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:34:40,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:34:40,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:34:40,599 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:34:40,600 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:34:40,600 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_2a5024d6-8112-4eb7-938c-460af8f83112/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 -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2019-11-15 22:34:40,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:34:40,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:34:40,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:34:40,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:34:40,637 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:34:40,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-11-15 22:34:40,687 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/data/0bbdd503b/e6d9db2e27b04932bdceef4f8915b98e/FLAG76f15fecf [2019-11-15 22:34:41,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:34:41,140 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-11-15 22:34:41,153 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/data/0bbdd503b/e6d9db2e27b04932bdceef4f8915b98e/FLAG76f15fecf [2019-11-15 22:34:41,165 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/bin/uautomizer/data/0bbdd503b/e6d9db2e27b04932bdceef4f8915b98e [2019-11-15 22:34:41,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:34:41,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:34:41,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:34:41,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:34:41,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:34:41,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b10e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41, skipping insertion in model container [2019-11-15 22:34:41,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:34:41,225 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:34:41,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:34:41,590 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:34:41,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:34:41,678 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:34:41,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41 WrapperNode [2019-11-15 22:34:41,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:34:41,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:34:41,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:34:41,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:34:41,686 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:34:41" (1/1) ... [2019-11-15 22:34:41,700 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:34:41" (1/1) ... [2019-11-15 22:34:41,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:34:41,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:34:41,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:34:41,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:34:41,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... [2019-11-15 22:34:41,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:34:41,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:34:41,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:34:41,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:34:41,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/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:34:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:34:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:34:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:34:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:34:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:34:41,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:34:42,021 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:34:42,021 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:34:42,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:42 BoogieIcfgContainer [2019-11-15 22:34:42,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:34:42,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:34:42,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:34:42,026 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:34:42,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:34:42,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:34:41" (1/3) ... [2019-11-15 22:34:42,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f3863ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:34:42, skipping insertion in model container [2019-11-15 22:34:42,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:34:42,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:34:41" (2/3) ... [2019-11-15 22:34:42,029 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f3863ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:34:42, skipping insertion in model container [2019-11-15 22:34:42,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:34:42,030 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:42" (3/3) ... [2019-11-15 22:34:42,031 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2019-11-15 22:34:42,090 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:34:42,091 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:34:42,091 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:34:42,091 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:34:42,091 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:34:42,091 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:34:42,092 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:34:42,092 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:34:42,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 22:34:42,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:34:42,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:42,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:42,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:34:42,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:34:42,142 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:34:42,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 22:34:42,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:34:42,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:42,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:42,144 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:34:42,144 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:34:42,150 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2019-11-15 22:34:42,150 INFO L793 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2019-11-15 22:34:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 22:34:42,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379979801] [2019-11-15 22:34:42,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,271 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2019-11-15 22:34:42,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779682721] [2019-11-15 22:34:42,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:42,305 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:34:42,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779682721] [2019-11-15 22:34:42,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:42,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:42,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564754238] [2019-11-15 22:34:42,311 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:34:42,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:42,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:34:42,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:34:42,330 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-15 22:34:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:42,336 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-15 22:34:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:34:42,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-15 22:34:42,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:34:42,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-11-15 22:34:42,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:34:42,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:34:42,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-15 22:34:42,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:34:42,345 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 22:34:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-15 22:34:42,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 22:34:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 22:34:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 22:34:42,373 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 22:34:42,373 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 22:34:42,373 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:34:42,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 22:34:42,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:34:42,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:42,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:42,375 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:34:42,375 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:34:42,375 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2019-11-15 22:34:42,375 INFO L793 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2019-11-15 22:34:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-15 22:34:42,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971584694] [2019-11-15 22:34:42,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,399 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2019-11-15 22:34:42,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233707826] [2019-11-15 22:34:42,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:42,436 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:34:42,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233707826] [2019-11-15 22:34:42,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:34:42,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:34:42,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095886545] [2019-11-15 22:34:42,437 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:34:42,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:34:42,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:34:42,438 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 22:34:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:42,489 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-11-15 22:34:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:34:42,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-11-15 22:34:42,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:34:42,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 22:34:42,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:34:42,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:34:42,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 22:34:42,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:34:42,492 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:34:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 22:34:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 22:34:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:34:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 22:34:42,493 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:34:42,493 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:34:42,493 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:34:42,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 22:34:42,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:34:42,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:42,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:42,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:34:42,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:42,495 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2019-11-15 22:34:42,495 INFO L793 eck$LassoCheckResult]: Loop: 66#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2019-11-15 22:34:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-15 22:34:42,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662860872] [2019-11-15 22:34:42,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2019-11-15 22:34:42,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006888587] [2019-11-15 22:34:42,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,583 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2019-11-15 22:34:42,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:42,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069961461] [2019-11-15 22:34:42,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:42,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:42,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:42,830 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-15 22:34:43,018 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:34:43,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:34:43,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:34:43,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:34:43,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:34:43,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:34:43,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:34:43,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:34:43,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2019-11-15 22:34:43,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:34:43,020 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:34:43,051 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:34:43,208 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-15 22:34:43,295 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:34:43,297 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:34:43,300 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:34:43,303 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:34:43,308 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:34:43,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:34:43,316 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:34:43,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:34:43,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:34:43,324 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:34:43,327 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:34:43,330 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:34:43,332 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:34:43,811 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:34:43,818 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:34:43,820 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:34:43,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:43,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:43,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:43,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:43,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:43,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:43,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:43,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:43,842 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:34:43,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:43,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:43,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:43,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:43,848 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:43,849 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:43,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:43,876 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:34:43,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:43,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:43,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:43,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:43,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:43,894 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:43,998 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:34:44,125 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:34:44,126 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:34:44,128 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:34:44,129 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:34:44,130 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:34:44,130 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2019-11-15 22:34:44,146 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:34:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:44,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:34:44,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:44,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:34:44,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:44,225 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:34:44,228 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:34:44,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 22:34:44,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-11-15 22:34:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:34:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:34:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-15 22:34:44,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2019-11-15 22:34:44,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:44,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2019-11-15 22:34:44,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:44,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2019-11-15 22:34:44,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:44,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-15 22:34:44,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:34:44,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2019-11-15 22:34:44,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 22:34:44,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:34:44,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 22:34:44,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:34:44,273 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 22:34:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 22:34:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 22:34:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:34:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-15 22:34:44,275 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 22:34:44,275 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 22:34:44,275 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:34:44,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-11-15 22:34:44,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:34:44,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:44,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:44,277 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:34:44,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:34:44,277 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 158#L566 assume !(main_~array_size~0 < 1); 159#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 160#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 165#L554-3 [2019-11-15 22:34:44,277 INFO L793 eck$LassoCheckResult]: Loop: 165#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 169#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 166#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 165#L554-3 [2019-11-15 22:34:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-15 22:34:44,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:44,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148155216] [2019-11-15 22:34:44,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:44,295 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-15 22:34:44,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:44,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819233096] [2019-11-15 22:34:44,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:44,306 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-15 22:34:44,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:44,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681436117] [2019-11-15 22:34:44,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:44,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:44,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:44,564 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-15 22:34:44,607 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:34:44,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:34:44,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:34:44,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:34:44,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:34:44,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:34:44,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:34:44,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:34:44,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2019-11-15 22:34:44,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:34:44,607 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:34:44,611 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:34:44,615 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:34:44,621 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:34:44,622 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:34:44,624 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:34:44,626 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:34:44,630 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:34:44,813 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:34:44,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:34:44,825 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:34:44,827 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:34:44,830 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:34:44,832 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:34:44,835 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:34:44,837 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:34:45,175 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:34:45,175 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:34:45,175 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:34:45,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:45,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:45,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:45,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,178 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:34:45,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:45,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,179 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,179 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:45,179 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:45,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,180 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:34:45,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:45,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:45,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:45,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,182 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:34:45,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,182 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:45,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:45,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:45,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,184 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:34:45,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:45,186 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:45,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,188 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:34:45,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:45,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,189 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:45,189 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:45,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,190 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:34:45,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,192 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:45,193 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:45,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:45,199 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:34:45,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:45,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:45,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:45,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:45,205 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:45,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:45,241 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:34:45,267 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:34:45,267 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:34:45,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:34:45,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:34:45,269 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:34:45,269 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2) = -4*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 Supporting invariants [] [2019-11-15 22:34:45,285 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:34:45,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:34:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:34:45,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:34:45,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:45,339 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:34:45,339 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:34:45,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:34:45,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2019-11-15 22:34:45,363 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:34:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:34:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 22:34:45,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:34:45,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:45,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 22:34:45,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:45,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 22:34:45,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:45,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-11-15 22:34:45,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:34:45,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2019-11-15 22:34:45,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 22:34:45,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 22:34:45,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-15 22:34:45,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:34:45,369 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-15 22:34:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-15 22:34:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-11-15 22:34:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:34:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 22:34:45,371 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:34:45,371 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:34:45,371 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:34:45,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 22:34:45,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:34:45,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:45,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:45,372 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:45,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:34:45,372 INFO L791 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 269#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 270#L566 assume !(main_~array_size~0 < 1); 271#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 272#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 276#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 282#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 279#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 280#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 283#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 273#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 274#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 277#L554-3 [2019-11-15 22:34:45,373 INFO L793 eck$LassoCheckResult]: Loop: 277#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 281#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 278#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 277#L554-3 [2019-11-15 22:34:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2019-11-15 22:34:45,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:45,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430796910] [2019-11-15 22:34:45,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:45,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430796910] [2019-11-15 22:34:45,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738709717] [2019-11-15 22:34:45,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a5024d6-8112-4eb7-938c-460af8f83112/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:34:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:45,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:34:45,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:34:45,513 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:34:45,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 22:34:45,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750465002] [2019-11-15 22:34:45,514 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:34:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-15 22:34:45,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:45,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842120170] [2019-11-15 22:34:45,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:45,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:34:45,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:34:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:34:45,597 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-15 22:34:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:34:45,665 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 22:34:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:34:45,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-15 22:34:45,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:34:45,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-11-15 22:34:45,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:34:45,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:34:45,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-11-15 22:34:45,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:34:45,668 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 22:34:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-11-15 22:34:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-11-15 22:34:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:34:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-15 22:34:45,670 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-15 22:34:45,670 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-15 22:34:45,670 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:34:45,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-15 22:34:45,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:34:45,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:34:45,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:34:45,672 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:34:45,672 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:34:45,672 INFO L791 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 360#L566 assume !(main_~array_size~0 < 1); 361#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 362#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 366#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 369#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 370#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 372#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 373#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 374#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 363#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 364#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 367#L554-3 [2019-11-15 22:34:45,672 INFO L793 eck$LassoCheckResult]: Loop: 367#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 371#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 368#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 367#L554-3 [2019-11-15 22:34:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2019-11-15 22:34:45,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:45,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931441625] [2019-11-15 22:34:45,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,724 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-15 22:34:45,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:45,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224177299] [2019-11-15 22:34:45,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,742 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:45,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2019-11-15 22:34:45,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:34:45,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661665112] [2019-11-15 22:34:45,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:34:45,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:34:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:34:45,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:34:46,278 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-11-15 22:34:46,356 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:34:46,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:34:46,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:34:46,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:34:46,356 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:34:46,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:34:46,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:34:46,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:34:46,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2019-11-15 22:34:46,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:34:46,357 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:34:46,360 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:34:46,364 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:34:46,366 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:34:46,368 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:34:46,375 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:34:46,377 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:34:46,379 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:34:46,618 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:34:46,621 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:34:46,627 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:34:46,629 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:34:46,631 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:34:46,634 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:34:46,643 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:34:46,644 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:34:46,646 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:34:46,983 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:34:46,984 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:34:46,984 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:34:46,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:46,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:46,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:46,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:46,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:46,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:46,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:46,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:46,987 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:34:46,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:46,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:46,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:46,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:46,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:46,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:46,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:46,995 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:34:46,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:46,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:46,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:46,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:46,999 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:47,000 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:47,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:47,002 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:34:47,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:47,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:47,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:47,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:47,006 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:47,008 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:47,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:47,010 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:34:47,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:47,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:47,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:47,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:47,012 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:47,012 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:47,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:47,014 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:34:47,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:47,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:34:47,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:47,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:47,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:47,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:34:47,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:34:47,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:47,021 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:34:47,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:47,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:47,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:47,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:47,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:47,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:47,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:47,028 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:34:47,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:47,029 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:34:47,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:47,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:47,033 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:34:47,033 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:47,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:34:47,039 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:34:47,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:34:47,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:34:47,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:34:47,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:34:47,042 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:34:47,042 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:34:47,075 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:34:47,105 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 22:34:47,105 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:34:47,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:34:47,107 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:34:47,107 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:34:47,107 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2019-11-15 22:34:47,136 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 22:34:47,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:34:47,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:34:47,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:34:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:47,206 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:34:47,206 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:34:47,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:34:47,232 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2019-11-15 22:34:47,232 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:34:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:34:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 22:34:47,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:34:47,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:47,233 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:34:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:34:47,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:34:47,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:47,283 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:34:47,283 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:34:47,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:34:47,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2019-11-15 22:34:47,306 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:34:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:34:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 22:34:47,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:34:47,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:47,306 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:34:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:34:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:34:47,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:34:47,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:34:47,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:34:47,359 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:34:47,359 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:34:47,359 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:34:47,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 39 transitions. Complement of second has 6 states. [2019-11-15 22:34:47,377 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:34:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:34:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-15 22:34:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:34:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 22:34:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 22:34:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:34:47,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2019-11-15 22:34:47,380 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:34:47,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-11-15 22:34:47,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:34:47,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:34:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:34:47,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:34:47,381 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:34:47,381 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:34:47,381 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:34:47,381 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:34:47,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:34:47,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:34:47,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:34:47,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:34:47 BoogieIcfgContainer [2019-11-15 22:34:47,387 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:34:47,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:34:47,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:34:47,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:34:47,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:34:42" (3/4) ... [2019-11-15 22:34:47,390 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:34:47,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:34:47,392 INFO L168 Benchmark]: Toolchain (without parser) took 6222.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 943.4 MB in the beginning and 957.9 MB in the end (delta: -14.5 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:47,392 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:34:47,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:47,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.06 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:47,394 INFO L168 Benchmark]: Boogie Preprocessor took 24.07 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:34:47,395 INFO L168 Benchmark]: RCFGBuilder took 278.39 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:47,395 INFO L168 Benchmark]: BuchiAutomizer took 5363.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 143.5 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:34:47,396 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 1.2 GB. Free memory is still 957.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:34:47,399 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 508.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.06 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.07 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 278.39 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5363.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 143.5 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.2 GB. Free memory is still 957.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -4 * j + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 85 SDtfs, 79 SDslu, 30 SDs, 0 SdLazy, 91 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf99 lsp86 ukn80 mio100 lsp68 div100 bol100 ite100 ukn100 eq173 hnf85 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 5 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...