./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/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 32bit --witnessprinter.graph.data.programhash 82679d367c32c359f0c9c81b27b57deea5682b2b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:17:33,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:17:33,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:17:33,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:17:33,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:17:33,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:17:33,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:17:33,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:17:33,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:17:33,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:17:33,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:17:33,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:17:33,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:17:33,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:17:33,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:17:33,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:17:33,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:17:33,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:17:33,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:17:33,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:17:33,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:17:33,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:17:33,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:17:33,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:17:33,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:17:33,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:17:33,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:17:33,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:17:33,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:17:33,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:17:33,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:17:33,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:17:33,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:17:33,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:17:33,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:17:33,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:17:33,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:17:33,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:17:33,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:17:33,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:17:33,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:17:33,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 18:17:33,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:17:33,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:17:33,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:17:33,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:17:33,713 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:17:33,714 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:17:33,714 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:17:33,714 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:17:33,714 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:17:33,714 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:17:33,714 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:17:33,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:17:33,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:17:33,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:17:33,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:17:33,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:17:33,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:17:33,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:17:33,717 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:17:33,717 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:17:33,717 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_3556193e-55e8-45a3-8057-8dcee09c64c7/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82679d367c32c359f0c9c81b27b57deea5682b2b [2019-12-07 18:17:33,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:17:33,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:17:33,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:17:33,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:17:33,825 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:17:33,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-12-07 18:17:33,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/data/c2f7a24bd/77d0344de3a84065b67fceb3f556326f/FLAG8e7f605ec [2019-12-07 18:17:34,288 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:17:34,288 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-12-07 18:17:34,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/data/c2f7a24bd/77d0344de3a84065b67fceb3f556326f/FLAG8e7f605ec [2019-12-07 18:17:34,306 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/data/c2f7a24bd/77d0344de3a84065b67fceb3f556326f [2019-12-07 18:17:34,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:17:34,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:17:34,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:17:34,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:17:34,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:17:34,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3357ba65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34, skipping insertion in model container [2019-12-07 18:17:34,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:17:34,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:17:34,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:17:34,553 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:17:34,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:17:34,611 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:17:34,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34 WrapperNode [2019-12-07 18:17:34,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:17:34,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:17:34,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:17:34,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:17:34,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:17:34,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:17:34,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:17:34,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:17:34,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... [2019-12-07 18:17:34,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:17:34,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:17:34,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:17:34,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:17:34,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/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-12-07 18:17:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:17:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:17:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:17:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:17:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:17:34,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:17:34,864 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:17:34,864 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:17:34,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:17:34 BoogieIcfgContainer [2019-12-07 18:17:34,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:17:34,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:17:34,866 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:17:34,868 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:17:34,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:17:34,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:17:34" (1/3) ... [2019-12-07 18:17:34,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fcbbe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:17:34, skipping insertion in model container [2019-12-07 18:17:34,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:17:34,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:34" (2/3) ... [2019-12-07 18:17:34,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fcbbe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:17:34, skipping insertion in model container [2019-12-07 18:17:34,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:17:34,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:17:34" (3/3) ... [2019-12-07 18:17:34,871 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2019-12-07 18:17:34,899 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:17:34,899 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:17:34,899 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:17:34,899 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:17:34,899 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:17:34,899 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:17:34,899 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:17:34,899 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:17:34,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-12-07 18:17:34,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 18:17:34,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:34,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:34,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 18:17:34,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 18:17:34,927 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:17:34,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-12-07 18:17:34,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 18:17:34,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:34,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:34,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 18:17:34,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 18:17:34,934 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 14#L531true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L531-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;main_~i~1 := 0; 9#L536-3true [2019-12-07 18:17:34,934 INFO L796 eck$LassoCheckResult]: Loop: 9#L536-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 6#L536-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 9#L536-3true [2019-12-07 18:17:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 18:17:34,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:34,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499932327] [2019-12-07 18:17:34,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-12-07 18:17:35,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187475724] [2019-12-07 18:17:35,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-12-07 18:17:35,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805184751] [2019-12-07 18:17:35,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:35,216 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:35,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:35,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:35,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:35,217 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:35,217 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,217 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:35,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:35,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2019-12-07 18:17:35,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:35,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:35,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,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-12-07 18:17:35,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:35,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-12-07 18:17:35,452 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:17:35,455 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:17:35,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:35,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:35,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:35,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:17:35,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:35,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:35,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:35,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:17:35,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:35,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:35,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,487 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-12-07 18:17:35,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:35,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:35,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:17:35,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:35,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:35,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:35,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,507 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-12-07 18:17:35,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:35,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:35,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:35,510 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,514 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-12-07 18:17:35,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:35,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:35,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:35,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:17:35,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:35,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:35,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:35,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:35,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:35,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:35,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:17:35,574 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-12-07 18:17:35,574 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:35,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:17:35,581 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 18:17:35,581 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:17:35,582 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-12-07 18:17:35,593 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 18:17:35,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 18:17:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:35,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:17:35,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:35,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:17:35,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:35,680 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-12-07 18:17:35,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-12-07 18:17:35,742 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 7 states. [2019-12-07 18:17:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:17:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 18:17:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-12-07 18:17:35,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 18:17:35,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:35,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2019-12-07 18:17:35,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:35,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2019-12-07 18:17:35,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:35,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-12-07 18:17:35,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 18:17:35,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-12-07 18:17:35,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 18:17:35,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 18:17:35,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-12-07 18:17:35,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:17:35,756 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 18:17:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-12-07 18:17:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 18:17:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 18:17:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 18:17:35,774 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 18:17:35,775 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 18:17:35,775 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:17:35,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-12-07 18:17:35,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 18:17:35,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:35,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:35,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:17:35,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 18:17:35,776 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 133#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 134#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#L531-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;main_~i~1 := 0; 131#L536-3 assume !(main_~i~1 < main_~array_size~0); 132#L536-4 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; 128#L515-3 [2019-12-07 18:17:35,776 INFO L796 eck$LassoCheckResult]: Loop: 128#L515-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; 124#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 125#L519-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); 127#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 128#L515-3 [2019-12-07 18:17:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,777 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-12-07 18:17:35,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958116469] [2019-12-07 18:17:35,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:35,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958116469] [2019-12-07 18:17:35,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:35,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:17:35,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951126912] [2019-12-07 18:17:35,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:17:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2019-12-07 18:17:35,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257565798] [2019-12-07 18:17:35,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:35,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257565798] [2019-12-07 18:17:35,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:35,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:17:35,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923447836] [2019-12-07 18:17:35,844 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:17:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:35,848 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-12-07 18:17:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:35,860 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-12-07 18:17:35,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:35,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-12-07 18:17:35,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:35,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2019-12-07 18:17:35,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-12-07 18:17:35,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-12-07 18:17:35,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-12-07 18:17:35,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:17:35,863 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 18:17:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-12-07 18:17:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-12-07 18:17:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 18:17:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-12-07 18:17:35,864 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 18:17:35,864 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-12-07 18:17:35,864 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:17:35,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-12-07 18:17:35,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:35,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:35,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:35,865 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:17:35,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:35,865 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 170#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 171#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 174#L531-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;main_~i~1 := 0; 168#L536-3 assume !(main_~i~1 < main_~array_size~0); 169#L536-4 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; 165#L515-3 [2019-12-07 18:17:35,866 INFO L796 eck$LassoCheckResult]: Loop: 165#L515-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; 161#L519-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); 162#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 172#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 175#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 163#L519-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); 164#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 165#L515-3 [2019-12-07 18:17:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-12-07 18:17:35,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431243360] [2019-12-07 18:17:35,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:35,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431243360] [2019-12-07 18:17:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:35,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:17:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139839254] [2019-12-07 18:17:35,886 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:17:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2019-12-07 18:17:35,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485650941] [2019-12-07 18:17:35,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:35,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:36,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:17:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:17:36,012 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-12-07 18:17:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:36,026 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-12-07 18:17:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:17:36,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-12-07 18:17:36,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:36,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-12-07 18:17:36,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-12-07 18:17:36,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-12-07 18:17:36,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-12-07 18:17:36,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:17:36,028 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 18:17:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-12-07 18:17:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-12-07 18:17:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 18:17:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-12-07 18:17:36,030 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-12-07 18:17:36,030 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-12-07 18:17:36,030 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:17:36,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-12-07 18:17:36,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:36,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:36,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:36,031 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:36,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:36,031 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 209#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 212#L531-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;main_~i~1 := 0; 206#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 204#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 205#L536-3 assume !(main_~i~1 < main_~array_size~0); 207#L536-4 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; 203#L515-3 [2019-12-07 18:17:36,031 INFO L796 eck$LassoCheckResult]: Loop: 203#L515-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; 199#L519-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); 200#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 210#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 213#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 201#L519-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); 202#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 203#L515-3 [2019-12-07 18:17:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-12-07 18:17:36,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:36,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786084940] [2019-12-07 18:17:36,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2019-12-07 18:17:36,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:36,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537780673] [2019-12-07 18:17:36,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2019-12-07 18:17:36,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:36,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483934749] [2019-12-07 18:17:36,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:17:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483934749] [2019-12-07 18:17:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022262752] [2019-12-07 18:17:36,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:36,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:17:36,166 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:17:36,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:36,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-12-07 18:17:36,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219517163] [2019-12-07 18:17:36,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:17:36,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:17:36,302 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-12-07 18:17:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:36,369 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-12-07 18:17:36,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:17:36,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-12-07 18:17:36,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:36,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-12-07 18:17:36,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-12-07 18:17:36,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-12-07 18:17:36,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-12-07 18:17:36,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:17:36,371 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-12-07 18:17:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-12-07 18:17:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 18:17:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 18:17:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-12-07 18:17:36,372 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-12-07 18:17:36,372 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-12-07 18:17:36,372 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 18:17:36,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-12-07 18:17:36,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:36,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:36,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:36,373 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:36,373 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:36,373 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 312#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 313#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 316#L531-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;main_~i~1 := 0; 309#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 307#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 308#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 310#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 318#L536-3 assume !(main_~i~1 < main_~array_size~0); 311#L536-4 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; 306#L515-3 [2019-12-07 18:17:36,374 INFO L796 eck$LassoCheckResult]: Loop: 306#L515-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; 302#L519-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); 303#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 314#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 317#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 304#L519-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); 305#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 306#L515-3 [2019-12-07 18:17:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-12-07 18:17:36,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:36,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998577754] [2019-12-07 18:17:36,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,391 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2019-12-07 18:17:36,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:36,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977688208] [2019-12-07 18:17:36,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2019-12-07 18:17:36,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:36,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260196520] [2019-12-07 18:17:36,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:36,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:36,671 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-12-07 18:17:36,716 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:36,716 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:36,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:36,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:36,716 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:36,717 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:36,717 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:36,717 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:36,717 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2019-12-07 18:17:36,717 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:36,717 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:36,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:36,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,077 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:17:37,077 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,079 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-12-07 18:17:37,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:37,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:37,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:37,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:37,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:37,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:37,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,092 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-12-07 18:17:37,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:37,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:37,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:37,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:37,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:37,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:37,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:37,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,102 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-12-07 18:17:37,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:37,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:37,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:37,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:37,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:37,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:37,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,115 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-12-07 18:17:37,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:37,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:37,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:37,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:37,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:37,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:37,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,129 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-12-07 18:17:37,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:37,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:37,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:37,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:37,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:37,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:37,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:17:37,189 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-12-07 18:17:37,189 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:17:37,196 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 18:17:37,196 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:17:37,196 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0) = -2*ULTIMATE.start_SelectionSort_~i~0 + 1 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 2 >= 0] [2019-12-07 18:17:37,213 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-12-07 18:17:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:37,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:17:37,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:37,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:17:37,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:17:37,292 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-12-07 18:17:37,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-12-07 18:17:37,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 37 states and 46 transitions. Complement of second has 10 states. [2019-12-07 18:17:37,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-12-07 18:17:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 18:17:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-12-07 18:17:37,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 7 letters. [2019-12-07 18:17:37,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 17 letters. Loop has 7 letters. [2019-12-07 18:17:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 14 letters. [2019-12-07 18:17:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:37,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-12-07 18:17:37,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 18:17:37,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 44 transitions. [2019-12-07 18:17:37,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 18:17:37,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-12-07 18:17:37,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-12-07 18:17:37,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:37,371 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-12-07 18:17:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-12-07 18:17:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-12-07 18:17:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 18:17:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-12-07 18:17:37,373 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-12-07 18:17:37,373 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-12-07 18:17:37,373 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 18:17:37,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-12-07 18:17:37,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 18:17:37,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:37,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:37,374 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:37,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:17:37,375 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 486#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 487#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 492#L531-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;main_~i~1 := 0; 484#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 481#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 482#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 485#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 501#L536-3 assume !(main_~i~1 < main_~array_size~0); 498#L536-4 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; 497#L515-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; 471#L519-3 [2019-12-07 18:17:37,375 INFO L796 eck$LassoCheckResult]: Loop: 471#L519-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); 472#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 489#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 471#L519-3 [2019-12-07 18:17:37,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-12-07 18:17:37,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:37,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659993889] [2019-12-07 18:17:37,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:37,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-12-07 18:17:37,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:37,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975182953] [2019-12-07 18:17:37,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:37,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-12-07 18:17:37,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:37,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461686520] [2019-12-07 18:17:37,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:37,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:37,600 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 18:17:37,646 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:37,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:37,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:37,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:37,647 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:37,647 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:37,647 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:37,647 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:37,647 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2019-12-07 18:17:37,647 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:37,647 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:37,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,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-12-07 18:17:37,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:37,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:38,057 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:17:38,057 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,060 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-12-07 18:17:38,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:38,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:38,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:38,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,066 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-12-07 18:17:38,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:38,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:38,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:38,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,073 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-12-07 18:17:38,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:38,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:38,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,082 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-12-07 18:17:38,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:38,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:38,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:38,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,090 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-12-07 18:17:38,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:38,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:38,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:38,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,098 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-12-07 18:17:38,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:38,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:38,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,111 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-12-07 18:17:38,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:38,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:38,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:38,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:38,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:38,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:38,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:17:38,170 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 18:17:38,170 INFO L444 ModelExtractionUtils]: 23 out of 46 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:38,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:17:38,175 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-12-07 18:17:38,175 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:17:38,175 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~min~0) = -4*ULTIMATE.start_SelectionSort_~min~0 + 5 Supporting invariants [1*ULTIMATE.start_SelectionSort_~a.offset - 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 + 8 >= 0, 1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2019-12-07 18:17:38,194 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2019-12-07 18:17:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:38,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:17:38,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:38,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 18:17:38,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:17:38,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:38,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:17:38,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 18:17:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:38,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:17:38,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:38,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2019-12-07 18:17:38,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-12-07 18:17:38,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 59 states and 75 transitions. Complement of second has 13 states. [2019-12-07 18:17:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 18:17:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 18:17:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-12-07 18:17:38,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 11 letters. Loop has 3 letters. [2019-12-07 18:17:38,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:38,612 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-12-07 18:17:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:38,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:17:38,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:38,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 18:17:38,648 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:17:38,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:17:38,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:17:38,654 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 18:17:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:38,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:17:38,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:38,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2019-12-07 18:17:38,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-12-07 18:17:38,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 62 states and 83 transitions. Complement of second has 15 states. [2019-12-07 18:17:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2019-12-07 18:17:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 18:17:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2019-12-07 18:17:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2019-12-07 18:17:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 18:17:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2019-12-07 18:17:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:38,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 83 transitions. [2019-12-07 18:17:38,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 18:17:38,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 76 transitions. [2019-12-07 18:17:38,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-12-07 18:17:38,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-12-07 18:17:38,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 76 transitions. [2019-12-07 18:17:38,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:38,962 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 76 transitions. [2019-12-07 18:17:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 76 transitions. [2019-12-07 18:17:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-12-07 18:17:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 18:17:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-12-07 18:17:38,965 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-12-07 18:17:38,965 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-12-07 18:17:38,965 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 18:17:38,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2019-12-07 18:17:38,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 18:17:38,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:38,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:38,967 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:38,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:38,967 INFO L794 eck$LassoCheckResult]: Stem: 852#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 846#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 847#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 853#L531-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;main_~i~1 := 0; 844#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 840#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 841#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 845#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 860#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 861#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 866#L536-3 assume !(main_~i~1 < main_~array_size~0); 848#L536-4 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; 838#L515-3 [2019-12-07 18:17:38,967 INFO L796 eck$LassoCheckResult]: Loop: 838#L515-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; 842#L519-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); 856#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 857#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 855#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 834#L519-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); 835#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 838#L515-3 [2019-12-07 18:17:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -304680909, now seen corresponding path program 3 times [2019-12-07 18:17:38,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:38,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650682582] [2019-12-07 18:17:38,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:38,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:38,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 4 times [2019-12-07 18:17:38,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:38,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769022590] [2019-12-07 18:17:38,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:38,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1848279784, now seen corresponding path program 3 times [2019-12-07 18:17:38,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:38,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806626831] [2019-12-07 18:17:38,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:39,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806626831] [2019-12-07 18:17:39,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452180319] [2019-12-07 18:17:39,047 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:39,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 18:17:39,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:39,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:17:39,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:39,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:39,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 18:17:39,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504844749] [2019-12-07 18:17:39,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:17:39,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:17:39,226 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 25 Second operand 17 states. [2019-12-07 18:17:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:39,392 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-12-07 18:17:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:17:39,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 82 transitions. [2019-12-07 18:17:39,393 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 18:17:39,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 82 transitions. [2019-12-07 18:17:39,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-12-07 18:17:39,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-12-07 18:17:39,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2019-12-07 18:17:39,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:39,395 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-12-07 18:17:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2019-12-07 18:17:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-12-07 18:17:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 18:17:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-12-07 18:17:39,398 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-12-07 18:17:39,398 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-12-07 18:17:39,398 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 18:17:39,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-12-07 18:17:39,399 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 18:17:39,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:39,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:39,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:39,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:17:39,400 INFO L794 eck$LassoCheckResult]: Stem: 1048#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1041#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1042#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1049#L531-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;main_~i~1 := 0; 1039#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1036#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1037#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1040#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1055#L536-3 assume !(main_~i~1 < main_~array_size~0); 1057#L536-4 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; 1069#L515-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; 1065#L519-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); 1066#L521 [2019-12-07 18:17:39,400 INFO L796 eck$LassoCheckResult]: Loop: 1066#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1074#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1075#L519-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); 1066#L521 [2019-12-07 18:17:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2019-12-07 18:17:39,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:39,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769163386] [2019-12-07 18:17:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 1 times [2019-12-07 18:17:39,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:39,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712051354] [2019-12-07 18:17:39,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1166709708, now seen corresponding path program 1 times [2019-12-07 18:17:39,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:39,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383179624] [2019-12-07 18:17:39,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:39,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383179624] [2019-12-07 18:17:39,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974013647] [2019-12-07 18:17:39,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:39,500 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:17:39,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:39,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:39,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-07 18:17:39,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520366207] [2019-12-07 18:17:39,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:17:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:17:39,567 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-12-07 18:17:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:39,677 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-12-07 18:17:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:17:39,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2019-12-07 18:17:39,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:39,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 24 states and 28 transitions. [2019-12-07 18:17:39,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 18:17:39,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 18:17:39,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-12-07 18:17:39,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:17:39,679 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-12-07 18:17:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-12-07 18:17:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-12-07 18:17:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 18:17:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-12-07 18:17:39,680 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-12-07 18:17:39,680 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-12-07 18:17:39,680 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 18:17:39,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-12-07 18:17:39,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:39,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:39,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:39,681 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:39,681 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:39,681 INFO L794 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1216#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1217#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1220#L531-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;main_~i~1 := 0; 1212#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1213#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1226#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1209#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1210#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1214#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1224#L536-3 assume !(main_~i~1 < main_~array_size~0); 1215#L536-4 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; 1211#L515-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; 1204#L519-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); 1205#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1218#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1221#L519-3 [2019-12-07 18:17:39,682 INFO L796 eck$LassoCheckResult]: Loop: 1221#L519-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); 1223#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1225#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1222#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1206#L519-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); 1207#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1208#L515-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; 1221#L519-3 [2019-12-07 18:17:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:39,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1270631965, now seen corresponding path program 2 times [2019-12-07 18:17:39,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:39,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905829144] [2019-12-07 18:17:39,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 5 times [2019-12-07 18:17:39,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:39,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679987726] [2019-12-07 18:17:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,704 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash 38430022, now seen corresponding path program 1 times [2019-12-07 18:17:39,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:39,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542167694] [2019-12-07 18:17:39,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:39,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:39,835 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-12-07 18:17:40,107 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-12-07 18:17:40,176 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:40,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:40,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:40,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:40,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:40,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:40,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:40,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2019-12-07 18:17:40,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:40,177 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:40,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:40,668 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:17:40,668 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,670 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-12-07 18:17:40,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,677 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-12-07 18:17:40,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,686 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-12-07 18:17:40,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,692 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-12-07 18:17:40,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,701 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-12-07 18:17:40,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,710 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-12-07 18:17:40,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,717 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-12-07 18:17:40,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,726 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-12-07 18:17:40,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,732 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-12-07 18:17:40,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,739 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-12-07 18:17:40,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:40,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:40,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:40,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,746 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-12-07 18:17:40,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,756 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-12-07 18:17:40,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,771 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-12-07 18:17:40,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,784 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-12-07 18:17:40,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,792 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-12-07 18:17:40,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:40,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:40,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:40,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:40,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:40,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:40,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:17:40,858 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 18:17:40,858 INFO L444 ModelExtractionUtils]: 21 out of 46 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:40,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:17:40,863 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 18:17:40,863 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:17:40,863 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~j~0) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~j~0 Supporting invariants [] [2019-12-07 18:17:40,885 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-12-07 18:17:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:40,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:17:40,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:40,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:17:40,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:40,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-12-07 18:17:40,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-12-07 18:17:40,969 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 11 states. [2019-12-07 18:17:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-12-07 18:17:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-12-07 18:17:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-12-07 18:17:40,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2019-12-07 18:17:40,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:40,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 23 letters. Loop has 7 letters. [2019-12-07 18:17:40,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:40,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 14 letters. [2019-12-07 18:17:40,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:40,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-12-07 18:17:40,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:40,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 45 transitions. [2019-12-07 18:17:40,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 18:17:40,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 18:17:40,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-12-07 18:17:40,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:40,972 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-12-07 18:17:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-12-07 18:17:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-12-07 18:17:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 18:17:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-12-07 18:17:40,974 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-12-07 18:17:40,974 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-12-07 18:17:40,974 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 18:17:40,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-12-07 18:17:40,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 18:17:40,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:40,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:40,975 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:40,975 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:40,975 INFO L794 eck$LassoCheckResult]: Stem: 1428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1422#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1423#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1429#L531-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;main_~i~1 := 0; 1420#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1418#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1419#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1421#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1435#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1434#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1433#L536-3 assume !(main_~i~1 < main_~array_size~0); 1424#L536-4 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; 1425#L515-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; 1439#L519-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); 1438#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1437#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1436#L519-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); 1411#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1430#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1407#L519-3 [2019-12-07 18:17:40,975 INFO L796 eck$LassoCheckResult]: Loop: 1407#L519-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); 1408#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1426#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1432#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1412#L519-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); 1413#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1416#L515-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; 1407#L519-3 [2019-12-07 18:17:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1850128556, now seen corresponding path program 3 times [2019-12-07 18:17:40,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:40,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877310435] [2019-12-07 18:17:40,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:40,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:41,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 6 times [2019-12-07 18:17:41,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:41,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028872175] [2019-12-07 18:17:41,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash 333237207, now seen corresponding path program 2 times [2019-12-07 18:17:41,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:41,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880751673] [2019-12-07 18:17:41,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:41,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880751673] [2019-12-07 18:17:41,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061057251] [2019-12-07 18:17:41,096 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:41,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:17:41,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:41,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:17:41,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:41,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:41,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-12-07 18:17:41,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235810702] [2019-12-07 18:17:41,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:17:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:17:41,363 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 11 Second operand 21 states. [2019-12-07 18:17:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:41,557 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-12-07 18:17:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:17:41,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 92 transitions. [2019-12-07 18:17:41,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-12-07 18:17:41,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 88 transitions. [2019-12-07 18:17:41,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-12-07 18:17:41,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-12-07 18:17:41,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 88 transitions. [2019-12-07 18:17:41,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:41,559 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-12-07 18:17:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 88 transitions. [2019-12-07 18:17:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2019-12-07 18:17:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 18:17:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-12-07 18:17:41,562 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-12-07 18:17:41,562 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-12-07 18:17:41,562 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 18:17:41,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 77 transitions. [2019-12-07 18:17:41,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-12-07 18:17:41,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:41,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:41,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:41,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:41,563 INFO L794 eck$LassoCheckResult]: Stem: 1653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1646#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1647#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1654#L531-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;main_~i~1 := 0; 1643#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1644#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1672#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1638#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1639#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1645#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1657#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1658#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1660#L536-3 assume !(main_~i~1 < main_~array_size~0); 1648#L536-4 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; 1649#L515-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; 1668#L519-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); 1669#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1664#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1665#L519-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); 1662#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1673#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1629#L519-3 [2019-12-07 18:17:41,563 INFO L796 eck$LassoCheckResult]: Loop: 1629#L519-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); 1630#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1650#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1674#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1675#L519-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); 1689#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1640#L515-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; 1629#L519-3 [2019-12-07 18:17:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash -764839030, now seen corresponding path program 4 times [2019-12-07 18:17:41,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:41,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777327403] [2019-12-07 18:17:41,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 7 times [2019-12-07 18:17:41,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:41,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812840610] [2019-12-07 18:17:41,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash -557796551, now seen corresponding path program 3 times [2019-12-07 18:17:41,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:41,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970518529] [2019-12-07 18:17:41,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:41,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:42,213 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 137 [2019-12-07 18:17:42,287 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:42,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:42,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:42,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:42,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:42,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:42,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:42,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration11_Lasso [2019-12-07 18:17:42,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:42,288 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:42,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,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-12-07 18:17:42,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-12-07 18:17:42,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,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-12-07 18:17:42,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:42,806 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:17:42,807 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,809 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-12-07 18:17:42,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:42,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:42,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:42,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,815 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-12-07 18:17:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:42,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:42,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:42,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,821 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-12-07 18:17:42,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:42,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:42,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:42,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,827 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-12-07 18:17:42,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:42,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:42,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:42,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,833 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-12-07 18:17:42,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:42,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:42,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:42,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,839 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-12-07 18:17:42,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:42,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:42,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:17:42,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:42,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:42,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,855 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-12-07 18:17:42,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:42,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:42,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,863 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-12-07 18:17:42,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:17:42,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:17:42,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:17:42,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,869 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-12-07 18:17:42,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:42,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:42,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,881 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-12-07 18:17:42,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:42,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:42,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:42,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:42,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:42,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:42,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:17:42,954 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2019-12-07 18:17:42,954 INFO L444 ModelExtractionUtils]: 17 out of 43 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:42,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:17:42,959 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 18:17:42,959 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:17:42,959 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_4, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_4 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2019-12-07 18:17:43,000 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-12-07 18:17:43,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 18:17:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:43,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:17:43,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:43,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:17:43,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:43,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-12-07 18:17:43,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 77 transitions. cyclomatic complexity: 21 Second operand 7 states. [2019-12-07 18:17:43,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 77 transitions. cyclomatic complexity: 21. Second operand 7 states. Result 96 states and 127 transitions. Complement of second has 11 states. [2019-12-07 18:17:43,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-12-07 18:17:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 18:17:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-12-07 18:17:43,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-12-07 18:17:43,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:43,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 28 letters. Loop has 7 letters. [2019-12-07 18:17:43,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:43,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 14 letters. [2019-12-07 18:17:43,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:43,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 127 transitions. [2019-12-07 18:17:43,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:17:43,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 43 states and 57 transitions. [2019-12-07 18:17:43,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-12-07 18:17:43,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 18:17:43,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2019-12-07 18:17:43,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:43,190 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-12-07 18:17:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2019-12-07 18:17:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-12-07 18:17:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 18:17:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-12-07 18:17:43,192 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-12-07 18:17:43,192 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-12-07 18:17:43,192 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 18:17:43,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2019-12-07 18:17:43,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:17:43,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:43,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:43,193 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:43,193 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:17:43,194 INFO L794 eck$LassoCheckResult]: Stem: 1980#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1976#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1977#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1981#L531-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;main_~i~1 := 0; 1973#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1967#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1968#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1974#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1987#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1986#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1985#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1984#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1983#L536-3 assume !(main_~i~1 < main_~array_size~0); 1975#L536-4 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; 1969#L515-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; 1970#L519-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); 1996#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1995#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1992#L519-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); 1960#L521 [2019-12-07 18:17:43,194 INFO L796 eck$LassoCheckResult]: Loop: 1960#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1978#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1959#L519-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); 1960#L521 [2019-12-07 18:17:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1931519992, now seen corresponding path program 5 times [2019-12-07 18:17:43,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:43,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607973031] [2019-12-07 18:17:43,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:43,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 2 times [2019-12-07 18:17:43,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:43,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729569914] [2019-12-07 18:17:43,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:43,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2059791963, now seen corresponding path program 1 times [2019-12-07 18:17:43,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:43,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174098497] [2019-12-07 18:17:43,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:43,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:43,672 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 132 [2019-12-07 18:17:43,747 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:43,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:43,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:43,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:43,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:43,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:43,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:43,748 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:43,748 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration12_Lasso [2019-12-07 18:17:43,748 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:43,748 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:43,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:43,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:44,201 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:17:44,201 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,204 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-12-07 18:17:44,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:44,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:44,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:44,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:44,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:44,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:44,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,212 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-12-07 18:17:44,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:44,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:44,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:44,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:44,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:44,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:44,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,231 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-12-07 18:17:44,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:44,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:44,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:44,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:44,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:44,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:44,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,253 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-12-07 18:17:44,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:44,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:44,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:44,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:44,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:44,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:44,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,263 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-12-07 18:17:44,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:44,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:44,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:44,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:44,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:44,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:44,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,271 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-12-07 18:17:44,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:17:44,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:17:44,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:17:44,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:17:44,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:17:44,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:17:44,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:17:44,314 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-12-07 18:17:44,314 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:44,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:17:44,319 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 18:17:44,319 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:17:44,319 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-12-07 18:17:44,339 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-12-07 18:17:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:44,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:17:44,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:44,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:17:44,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:44,366 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-12-07 18:17:44,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-12-07 18:17:44,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 73 states and 95 transitions. Complement of second has 7 states. [2019-12-07 18:17:44,380 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-12-07 18:17:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:17:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-12-07 18:17:44,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 3 letters. [2019-12-07 18:17:44,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:44,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2019-12-07 18:17:44,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:44,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 6 letters. [2019-12-07 18:17:44,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:17:44,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 95 transitions. [2019-12-07 18:17:44,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:17:44,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 56 states and 72 transitions. [2019-12-07 18:17:44,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-12-07 18:17:44,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 18:17:44,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2019-12-07 18:17:44,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:44,382 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-12-07 18:17:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2019-12-07 18:17:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-12-07 18:17:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 18:17:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-12-07 18:17:44,384 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 18:17:44,384 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 18:17:44,384 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 18:17:44,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2019-12-07 18:17:44,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:17:44,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:44,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:44,385 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:44,385 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:17:44,385 INFO L794 eck$LassoCheckResult]: Stem: 2213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2207#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2208#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2214#L531-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;main_~i~1 := 0; 2205#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2200#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2201#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2206#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2223#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2222#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2221#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2220#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2219#L536-3 assume !(main_~i~1 < main_~array_size~0); 2209#L536-4 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; 2202#L515-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; 2193#L519-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); 2194#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2210#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2231#L519-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); 2226#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2225#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2224#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2197#L519-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); 2198#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2199#L515-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; 2229#L519-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); 2218#L521 [2019-12-07 18:17:44,385 INFO L796 eck$LassoCheckResult]: Loop: 2218#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2215#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2216#L519-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); 2218#L521 [2019-12-07 18:17:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:44,385 INFO L82 PathProgramCache]: Analyzing trace with hash 417927685, now seen corresponding path program 1 times [2019-12-07 18:17:44,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:44,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616450975] [2019-12-07 18:17:44,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:44,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616450975] [2019-12-07 18:17:44,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486687222] [2019-12-07 18:17:44,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3556193e-55e8-45a3-8057-8dcee09c64c7/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:44,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:17:44,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:44,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:44,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-12-07 18:17:44,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283632922] [2019-12-07 18:17:44,562 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:17:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 3 times [2019-12-07 18:17:44,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:44,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068328973] [2019-12-07 18:17:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:44,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:17:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:17:44,607 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. cyclomatic complexity: 20 Second operand 21 states. [2019-12-07 18:17:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:44,796 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2019-12-07 18:17:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:17:44,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2019-12-07 18:17:44,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:17:44,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 42 states and 55 transitions. [2019-12-07 18:17:44,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-12-07 18:17:44,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-12-07 18:17:44,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2019-12-07 18:17:44,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:17:44,798 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-12-07 18:17:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2019-12-07 18:17:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-12-07 18:17:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 18:17:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-12-07 18:17:44,799 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-12-07 18:17:44,799 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-12-07 18:17:44,799 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 18:17:44,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-12-07 18:17:44,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 18:17:44,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:17:44,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:17:44,800 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:44,800 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:17:44,800 INFO L794 eck$LassoCheckResult]: Stem: 2412#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2407#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2408#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2413#L531-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;main_~i~1 := 0; 2405#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2401#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2402#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2406#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2423#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2422#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2421#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 2420#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2419#L536-3 assume !(main_~i~1 < main_~array_size~0); 2409#L536-4 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; 2403#L515-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; 2394#L519-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); 2395#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2410#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2396#L519-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); 2397#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2411#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2416#L519-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); 2426#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2425#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2424#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2398#L519-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); 2399#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2400#L515-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; 2404#L519-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); 2417#L521 [2019-12-07 18:17:44,800 INFO L796 eck$LassoCheckResult]: Loop: 2417#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2414#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2415#L519-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); 2417#L521 [2019-12-07 18:17:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1663183504, now seen corresponding path program 2 times [2019-12-07 18:17:44,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:44,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403547804] [2019-12-07 18:17:44,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,818 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 4 times [2019-12-07 18:17:44,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:44,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071220615] [2019-12-07 18:17:44,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1157082835, now seen corresponding path program 4 times [2019-12-07 18:17:44,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:44,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897257183] [2019-12-07 18:17:44,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:44,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:46,054 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 251 DAG size of output: 185 [2019-12-07 18:17:46,230 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-12-07 18:17:46,232 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:17:46,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:17:46,232 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:17:46,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:17:46,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:17:46,233 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:17:46,233 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:17:46,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:17:46,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration14_Lasso [2019-12-07 18:17:46,233 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:17:46,233 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:17:46,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:17:46,415 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 18:17:46,417 INFO L168 Benchmark]: Toolchain (without parser) took 12107.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.9 MB). Free memory was 935.4 MB in the beginning and 847.1 MB in the end (delta: 88.3 MB). Peak memory consumption was 346.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:46,417 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:17:46,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:46,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:17:46,418 INFO L168 Benchmark]: Boogie Preprocessor took 19.36 ms. Allocated memory is still 1.1 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-12-07 18:17:46,418 INFO L168 Benchmark]: RCFGBuilder took 202.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:46,418 INFO L168 Benchmark]: BuchiAutomizer took 11550.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 847.1 MB in the end (delta: 212.9 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:46,419 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.36 ms. Allocated memory is still 1.1 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 202.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11550.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 847.1 MB in the end (delta: 212.9 MB). Peak memory consumption was 367.6 MB. 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.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...