./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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_1153f490-5f2f-4071-8577-5db3213171b8/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.2.0-a4ecdab [2020-11-30 01:10:36,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:10:36,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:10:36,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:10:36,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:10:36,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:10:36,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:10:36,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:10:36,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:10:36,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:10:36,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:10:36,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:10:36,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:10:36,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:10:36,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:10:36,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:10:36,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:10:36,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:10:36,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:10:36,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:10:36,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:10:36,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:10:36,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:10:36,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:10:36,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:10:36,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:10:36,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:10:36,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:10:36,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:10:36,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:10:36,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:10:36,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:10:36,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:10:36,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:10:36,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:10:36,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:10:36,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:10:36,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:10:36,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:10:36,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:10:36,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:10:36,712 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 01:10:36,763 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:10:36,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:10:36,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:10:36,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:10:36,766 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:10:36,767 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 01:10:36,767 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 01:10:36,767 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 01:10:36,768 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 01:10:36,768 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 01:10:36,769 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 01:10:36,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:10:36,770 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:10:36,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:10:36,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:10:36,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:10:36,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:10:36,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 01:10:36,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 01:10:36,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 01:10:36,772 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:10:36,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:10:36,773 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 01:10:36,773 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:10:36,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 01:10:36,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:10:36,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:10:36,774 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 01:10:36,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:10:36,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:10:36,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:10:36,775 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 01:10:36,776 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 01:10:36,777 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:37,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:10:37,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:10:37,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:10:37,146 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:10:37,147 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:10:37,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2020-11-30 01:10:37,232 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/data/a11f6e201/3d5392c11b564988856f45380266bbe1/FLAG92c1fccf5 [2020-11-30 01:10:37,837 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:10:37,838 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2020-11-30 01:10:37,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/data/a11f6e201/3d5392c11b564988856f45380266bbe1/FLAG92c1fccf5 [2020-11-30 01:10:38,113 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/data/a11f6e201/3d5392c11b564988856f45380266bbe1 [2020-11-30 01:10:38,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:10:38,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:10:38,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:10:38,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:10:38,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:10:38,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cadfd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38, skipping insertion in model container [2020-11-30 01:10:38,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:10:38,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:10:38,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:10:38,629 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:10:38,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:10:38,751 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:10:38,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38 WrapperNode [2020-11-30 01:10:38,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:10:38,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:10:38,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:10:38,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:10:38,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:10:38,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:10:38,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:10:38,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:10:38,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... [2020-11-30 01:10:38,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:10:38,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:10:38,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:10:38,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:10:38,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:10:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:10:38,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:10:39,489 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:10:39,490 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:10:39,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:10:39 BoogieIcfgContainer [2020-11-30 01:10:39,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:10:39,493 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 01:10:39,493 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 01:10:39,498 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 01:10:39,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:10:39,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 01:10:38" (1/3) ... [2020-11-30 01:10:39,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c1b15fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:10:39, skipping insertion in model container [2020-11-30 01:10:39,501 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:10:39,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:10:38" (2/3) ... [2020-11-30 01:10:39,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c1b15fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:10:39, skipping insertion in model container [2020-11-30 01:10:39,501 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:10:39,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:10:39" (3/3) ... [2020-11-30 01:10:39,503 INFO L373 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2020-11-30 01:10:39,571 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 01:10:39,571 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 01:10:39,572 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 01:10:39,572 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:10:39,572 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:10:39,572 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 01:10:39,572 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:10:39,573 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 01:10:39,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-11-30 01:10:39,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 01:10:39,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:39,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:39,631 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 01:10:39,631 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 01:10:39,631 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 01:10:39,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-11-30 01:10:39,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-30 01:10:39,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:39,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:39,635 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 01:10:39,636 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 01:10:39,644 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 [2020-11-30 01:10:39,645 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 [2020-11-30 01:10:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-30 01:10:39,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:39,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323877731] [2020-11-30 01:10:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:39,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:39,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:39,886 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-30 01:10:39,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:39,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404450942] [2020-11-30 01:10:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:39,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:39,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:39,944 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-30 01:10:39,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:39,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172334855] [2020-11-30 01:10:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:39,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:40,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:40,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:40,349 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-30 01:10:40,428 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:10:40,429 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:10:40,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:10:40,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:10:40,430 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:10:40,430 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:40,430 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:10:40,430 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:10:40,430 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2020-11-30 01:10:40,431 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:10:40,431 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:10:40,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,689 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-30 01:10:40,850 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-11-30 01:10:40,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:40,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:41,295 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:10:41,305 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:41,312 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 [2020-11-30 01:10:41,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:41,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:41,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:41,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:41,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:41,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:41,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:41,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:41,375 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 [2020-11-30 01:10:41,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:41,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:41,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:41,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:41,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:41,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:41,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:41,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:41,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:10:41,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:41,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:41,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:41,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:41,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:41,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:41,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:41,512 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 [2020-11-30 01:10:41,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:41,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:41,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:41,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:41,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:41,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:41,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:41,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:41,550 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 [2020-11-30 01:10:41,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:41,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:41,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:41,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:41,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:41,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:41,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:41,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:41,607 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 [2020-11-30 01:10:41,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:41,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:41,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:41,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:41,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:41,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:41,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:10:41,738 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-30 01:10:41,739 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:41,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:41,753 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 01:10:41,754 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:10:41,754 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -2*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2020-11-30 01:10:41,816 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-11-30 01:10:41,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 01:10:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:41,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:10:41,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:41,935 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:10:41,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:41,992 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-11-30 01:10:41,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-11-30 01:10:42,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 38 states and 56 transitions. Complement of second has 9 states. [2020-11-30 01:10:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 01:10:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-30 01:10:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-11-30 01:10:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-30 01:10:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 01:10:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:42,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-30 01:10:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:42,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-11-30 01:10:42,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 01:10:42,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 14 states and 19 transitions. [2020-11-30 01:10:42,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-30 01:10:42,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-30 01:10:42,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-11-30 01:10:42,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:10:42,158 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-30 01:10:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-11-30 01:10:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-30 01:10:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 01:10:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-11-30 01:10:42,193 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-30 01:10:42,194 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-30 01:10:42,194 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 01:10:42,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-11-30 01:10:42,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 01:10:42,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:42,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:42,199 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:10:42,199 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 01:10:42,199 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 134#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; 135#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 138#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; 132#L536-3 assume !(main_~i~1 < main_~array_size~0); 133#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; 129#L515-3 [2020-11-30 01:10:42,201 INFO L796 eck$LassoCheckResult]: Loop: 129#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; 125#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 126#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); 128#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 129#L515-3 [2020-11-30 01:10:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-30 01:10:42,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729311597] [2020-11-30 01:10:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:42,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729311597] [2020-11-30 01:10:42,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:10:42,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:10:42,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796622697] [2020-11-30 01:10:42,318 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:10:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2020-11-30 01:10:42,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463043888] [2020-11-30 01:10:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:42,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463043888] [2020-11-30 01:10:42,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:10:42,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:10:42,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520514106] [2020-11-30 01:10:42,361 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:10:42,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:10:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:10:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:10:42,366 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 01:10:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:10:42,390 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-11-30 01:10:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:10:42,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2020-11-30 01:10:42,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-30 01:10:42,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2020-11-30 01:10:42,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-30 01:10:42,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 01:10:42,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-11-30 01:10:42,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:10:42,394 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-30 01:10:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-11-30 01:10:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-30 01:10:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 01:10:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-11-30 01:10:42,397 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-30 01:10:42,397 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-30 01:10:42,397 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 01:10:42,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-11-30 01:10:42,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-30 01:10:42,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:42,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:42,399 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:10:42,400 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:42,400 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 171#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; 172#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 175#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; 169#L536-3 assume !(main_~i~1 < main_~array_size~0); 170#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; 166#L515-3 [2020-11-30 01:10:42,400 INFO L796 eck$LassoCheckResult]: Loop: 166#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; 162#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); 163#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 173#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 176#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 164#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); 165#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 166#L515-3 [2020-11-30 01:10:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2020-11-30 01:10:42,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896759937] [2020-11-30 01:10:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:42,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896759937] [2020-11-30 01:10:42,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:10:42,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:10:42,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404831381] [2020-11-30 01:10:42,443 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:10:42,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2020-11-30 01:10:42,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530792420] [2020-11-30 01:10:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:42,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:42,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:42,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:42,686 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-30 01:10:42,813 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-11-30 01:10:42,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:10:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:10:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:10:42,815 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-11-30 01:10:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:10:42,852 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-11-30 01:10:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:10:42,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2020-11-30 01:10:42,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-30 01:10:42,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2020-11-30 01:10:42,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-30 01:10:42,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 01:10:42,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-11-30 01:10:42,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:10:42,856 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-30 01:10:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-11-30 01:10:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-30 01:10:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 01:10:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-11-30 01:10:42,859 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-30 01:10:42,859 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-30 01:10:42,859 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 01:10:42,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-11-30 01:10:42,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-30 01:10:42,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:42,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:42,861 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:42,861 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:42,861 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#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; 210#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 213#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; 207#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; 205#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 206#L536-3 assume !(main_~i~1 < main_~array_size~0); 208#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; 204#L515-3 [2020-11-30 01:10:42,861 INFO L796 eck$LassoCheckResult]: Loop: 204#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; 200#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); 201#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 211#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 214#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 202#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); 203#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 204#L515-3 [2020-11-30 01:10:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-11-30 01:10:42,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138352369] [2020-11-30 01:10:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:42,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:42,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:42,920 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2020-11-30 01:10:42,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478577004] [2020-11-30 01:10:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:42,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:42,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:42,989 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:42,990 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2020-11-30 01:10:42,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:42,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528200179] [2020-11-30 01:10:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:10:43,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528200179] [2020-11-30 01:10:43,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014831887] [2020-11-30 01:10:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:10:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:43,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:10:43,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:10:43,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:10:43,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-11-30 01:10:43,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123653173] [2020-11-30 01:10:43,438 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-30 01:10:43,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:10:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:10:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:10:43,498 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-11-30 01:10:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:10:43,653 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-11-30 01:10:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:10:43,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2020-11-30 01:10:43,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-30 01:10:43,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2020-11-30 01:10:43,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-30 01:10:43,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 01:10:43,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-11-30 01:10:43,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:10:43,657 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-11-30 01:10:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-11-30 01:10:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-30 01:10:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 01:10:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-11-30 01:10:43,660 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-30 01:10:43,660 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-30 01:10:43,660 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 01:10:43,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-11-30 01:10:43,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-30 01:10:43,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:43,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:43,662 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:43,662 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:43,662 INFO L794 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 313#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; 314#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 317#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; 310#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; 308#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 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; 311#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 319#L536-3 assume !(main_~i~1 < main_~array_size~0); 312#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; 307#L515-3 [2020-11-30 01:10:43,662 INFO L796 eck$LassoCheckResult]: Loop: 307#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; 303#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); 304#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 315#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 318#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 305#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); 306#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 307#L515-3 [2020-11-30 01:10:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-11-30 01:10:43,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:43,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145632426] [2020-11-30 01:10:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:43,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:43,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:43,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2020-11-30 01:10:43,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:43,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12476160] [2020-11-30 01:10:43,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:43,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:43,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:43,763 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2020-11-30 01:10:43,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:43,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782246825] [2020-11-30 01:10:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:43,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:43,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:43,861 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:44,065 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-30 01:10:44,453 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-11-30 01:10:44,570 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-11-30 01:10:44,573 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:10:44,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:10:44,573 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:10:44,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:10:44,573 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:10:44,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:44,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:10:44,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:10:44,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2020-11-30 01:10:44,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:10:44,574 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:10:44,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,781 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-11-30 01:10:44,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:44,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:45,137 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:10:45,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:10:45,420 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:45,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 [2020-11-30 01:10:45,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:45,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:45,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:45,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:45,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:10:45,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:45,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:45,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:45,564 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 [2020-11-30 01:10:45,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:45,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:45,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:45,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:45,634 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 [2020-11-30 01:10:45,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:45,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:45,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:45,689 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 [2020-11-30 01:10:45,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:45,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:45,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:45,755 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 [2020-11-30 01:10:45,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:45,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:45,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:45,825 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 [2020-11-30 01:10:45,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:45,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:45,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:45,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_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:45,919 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 [2020-11-30 01:10:45,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:45,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:45,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:45,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:45,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:45,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:45,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:10:46,024 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-30 01:10:46,024 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:46,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:46,035 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 01:10:46,036 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:10:46,036 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2020-11-30 01:10:46,072 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-11-30 01:10:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:46,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:10:46,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:10:46,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:10:46,171 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 [2020-11-30 01:10:46,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-30 01:10:46,212 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 30 transitions. Complement of second has 4 states. [2020-11-30 01:10:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 01:10:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 01:10:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-11-30 01:10:46,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2020-11-30 01:10:46,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:46,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2020-11-30 01:10:46,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:46,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2020-11-30 01:10:46,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:46,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2020-11-30 01:10:46,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:46,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2020-11-30 01:10:46,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 01:10:46,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-30 01:10:46,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-11-30 01:10:46,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 01:10:46,219 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-11-30 01:10:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-11-30 01:10:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-30 01:10:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-30 01:10:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-11-30 01:10:46,222 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-30 01:10:46,225 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-30 01:10:46,225 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 01:10:46,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-11-30 01:10:46,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:46,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:46,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:46,231 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:46,231 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:10:46,231 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 439#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; 440#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 445#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; 437#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; 434#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 435#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; 438#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 447#L536-3 assume !(main_~i~1 < main_~array_size~0); 441#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; 436#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; 427#L519-3 [2020-11-30 01:10:46,231 INFO L796 eck$LassoCheckResult]: Loop: 427#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); 428#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 442#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 427#L519-3 [2020-11-30 01:10:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-11-30 01:10:46,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:46,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266976515] [2020-11-30 01:10:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:46,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:46,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:46,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-11-30 01:10:46,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:46,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511910654] [2020-11-30 01:10:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:46,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:46,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:46,306 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2020-11-30 01:10:46,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:46,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244611249] [2020-11-30 01:10:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:46,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:46,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:46,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:46,762 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2020-11-30 01:10:46,900 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:10:46,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:10:46,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:10:46,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:10:46,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:10:46,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:46,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:10:46,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:10:46,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2020-11-30 01:10:46,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:10:46,901 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:10:46,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:46,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:46,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:46,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:46,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,228 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-11-30 01:10:47,352 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-11-30 01:10:47,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:47,636 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-11-30 01:10:47,981 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:10:47,983 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:47,990 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 [2020-11-30 01:10:47,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:47,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:47,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:47,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:47,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:47,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:47,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:47,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:48,023 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 [2020-11-30 01:10:48,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:48,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:48,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:48,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:48,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:48,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:48,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:48,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:48,058 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 [2020-11-30 01:10:48,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:48,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:48,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:48,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:48,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:48,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:48,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:48,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 [2020-11-30 01:10:48,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:48,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:10:48,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:48,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:48,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:48,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:10:48,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:10:48,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:48,123 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 [2020-11-30 01:10:48,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:10:48,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:10:48,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:10:48,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:10:48,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:10:48,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:10:48,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:10:48,282 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-11-30 01:10:48,282 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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) [2020-11-30 01:10:48,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:48,290 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 01:10:48,290 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:10:48,291 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 [] [2020-11-30 01:10:48,359 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-11-30 01:10:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:48,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:10:48,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:48,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:10:48,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:48,439 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 [2020-11-30 01:10:48,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-30 01:10:48,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 7 states. [2020-11-30 01:10:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 01:10:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 01:10:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-11-30 01:10:48,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2020-11-30 01:10:48,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:48,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-30 01:10:48,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2020-11-30 01:10:48,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:10:48,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2020-11-30 01:10:48,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:48,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 28 states and 36 transitions. [2020-11-30 01:10:48,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 01:10:48,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 01:10:48,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2020-11-30 01:10:48,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 01:10:48,487 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-11-30 01:10:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2020-11-30 01:10:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2020-11-30 01:10:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-30 01:10:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2020-11-30 01:10:48,490 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-11-30 01:10:48,490 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-11-30 01:10:48,496 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 01:10:48,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-11-30 01:10:48,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:48,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:48,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:48,499 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:48,499 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:10:48,500 INFO L794 eck$LassoCheckResult]: Stem: 594#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 589#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; 590#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 595#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; 587#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; 584#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 585#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; 588#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 597#L536-3 assume !(main_~i~1 < main_~array_size~0); 591#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; 586#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; 579#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); 580#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 593#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 596#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 581#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); 582#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 583#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; 577#L519-3 [2020-11-30 01:10:48,500 INFO L796 eck$LassoCheckResult]: Loop: 577#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); 578#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 592#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 577#L519-3 [2020-11-30 01:10:48,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1721425389, now seen corresponding path program 1 times [2020-11-30 01:10:48,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:48,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589529161] [2020-11-30 01:10:48,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:10:48,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589529161] [2020-11-30 01:10:48,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617758194] [2020-11-30 01:10:48,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:10:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:48,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:10:48,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:10:48,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:10:48,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-30 01:10:48,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108523142] [2020-11-30 01:10:48,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:10:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:48,746 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-11-30 01:10:48,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:48,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257002149] [2020-11-30 01:10:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:48,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:48,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:48,757 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:48,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:10:48,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:10:48,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:10:48,828 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-30 01:10:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:10:48,998 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-11-30 01:10:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:10:48,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-11-30 01:10:49,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:49,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 29 transitions. [2020-11-30 01:10:49,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 01:10:49,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 01:10:49,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2020-11-30 01:10:49,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 01:10:49,002 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-30 01:10:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2020-11-30 01:10:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-30 01:10:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-30 01:10:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-11-30 01:10:49,005 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-30 01:10:49,005 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-30 01:10:49,005 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 01:10:49,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2020-11-30 01:10:49,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:49,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:49,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:49,007 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:49,007 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:10:49,008 INFO L794 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 716#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; 717#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 721#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; 712#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; 713#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 714#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; 709#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 710#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; 724#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 723#L536-3 assume !(main_~i~1 < main_~array_size~0); 715#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; 711#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; 704#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); 705#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 719#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 722#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 706#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); 707#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 708#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; 702#L519-3 [2020-11-30 01:10:49,008 INFO L796 eck$LassoCheckResult]: Loop: 702#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); 703#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 718#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 702#L519-3 [2020-11-30 01:10:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1519356789, now seen corresponding path program 2 times [2020-11-30 01:10:49,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:49,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171102412] [2020-11-30 01:10:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:10:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:49,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171102412] [2020-11-30 01:10:49,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642288760] [2020-11-30 01:10:49,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1153f490-5f2f-4071-8577-5db3213171b8/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 [2020-11-30 01:10:49,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:10:49,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:10:49,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:10:49,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:10:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:10:49,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:10:49,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-11-30 01:10:49,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146328536] [2020-11-30 01:10:49,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:10:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-11-30 01:10:49,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:49,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893969048] [2020-11-30 01:10:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:49,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:10:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:10:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:10:49,446 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-11-30 01:10:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:10:49,722 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-11-30 01:10:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:10:49,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-11-30 01:10:49,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:49,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2020-11-30 01:10:49,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-30 01:10:49,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-30 01:10:49,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2020-11-30 01:10:49,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 01:10:49,726 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-11-30 01:10:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2020-11-30 01:10:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2020-11-30 01:10:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-30 01:10:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-11-30 01:10:49,732 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-11-30 01:10:49,733 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-11-30 01:10:49,733 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 01:10:49,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-11-30 01:10:49,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 01:10:49,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:10:49,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:10:49,735 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:10:49,735 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 01:10:49,735 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 859#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; 860#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 865#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; 856#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; 857#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 858#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; 852#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 853#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; 868#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 867#L536-3 assume !(main_~i~1 < main_~array_size~0); 861#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; 854#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; 855#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); 870#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 866#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 847#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); 848#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 863#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 869#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 849#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); 850#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 851#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; 845#L519-3 [2020-11-30 01:10:49,735 INFO L796 eck$LassoCheckResult]: Loop: 845#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); 846#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 862#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 845#L519-3 [2020-11-30 01:10:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 3 times [2020-11-30 01:10:49,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:49,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613939224] [2020-11-30 01:10:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,787 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-11-30 01:10:49,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:49,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055208830] [2020-11-30 01:10:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,798 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:10:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2020-11-30 01:10:49,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:10:49,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224262578] [2020-11-30 01:10:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:10:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:10:49,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:10:49,857 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:10:51,033 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 194 DAG size of output: 145 [2020-11-30 01:10:51,374 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-30 01:10:51,377 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:10:51,377 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:10:51,377 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:10:51,377 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:10:51,377 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:10:51,378 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:10:51,378 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:10:51,378 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:10:51,378 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2020-11-30 01:10:51,378 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:10:51,378 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:10:51,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:10:51,524 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:461) 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:382) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:10:51,528 INFO L168 Benchmark]: Toolchain (without parser) took 13409.71 ms. Allocated memory was 127.9 MB in the beginning and 234.9 MB in the end (delta: 107.0 MB). Free memory was 93.5 MB in the beginning and 116.5 MB in the end (delta: -23.0 MB). Peak memory consumption was 104.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:10:51,528 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 127.9 MB. Free memory was 98.4 MB in the beginning and 98.3 MB in the end (delta: 27.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:10:51,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.52 ms. Allocated memory is still 127.9 MB. Free memory was 93.5 MB in the beginning and 92.9 MB in the end (delta: 608.7 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:10:51,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.49 ms. Allocated memory is still 127.9 MB. Free memory was 92.9 MB in the beginning and 90.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:10:51,530 INFO L168 Benchmark]: Boogie Preprocessor took 32.22 ms. Allocated memory is still 127.9 MB. Free memory was 90.8 MB in the beginning and 89.9 MB in the end (delta: 951.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:10:51,530 INFO L168 Benchmark]: RCFGBuilder took 646.98 ms. Allocated memory is still 127.9 MB. Free memory was 89.3 MB in the beginning and 74.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:10:51,531 INFO L168 Benchmark]: BuchiAutomizer took 12034.00 ms. Allocated memory was 127.9 MB in the beginning and 234.9 MB in the end (delta: 107.0 MB). Free memory was 74.6 MB in the beginning and 116.5 MB in the end (delta: -42.0 MB). Peak memory consumption was 87.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:10:51,541 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96 ms. Allocated memory is still 127.9 MB. Free memory was 98.4 MB in the beginning and 98.3 MB in the end (delta: 27.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 632.52 ms. Allocated memory is still 127.9 MB. Free memory was 93.5 MB in the beginning and 92.9 MB in the end (delta: 608.7 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.49 ms. Allocated memory is still 127.9 MB. Free memory was 92.9 MB in the beginning and 90.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.22 ms. Allocated memory is still 127.9 MB. Free memory was 90.8 MB in the beginning and 89.9 MB in the end (delta: 951.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 646.98 ms. Allocated memory is still 127.9 MB. Free memory was 89.3 MB in the beginning and 74.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12034.00 ms. Allocated memory was 127.9 MB in the beginning and 234.9 MB in the end (delta: 107.0 MB). Free memory was 74.6 MB in the beginning and 116.5 MB in the end (delta: -42.0 MB). Peak memory consumption was 87.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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...