./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.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_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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 a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:57:56,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:57:56,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:57:56,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:57:56,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:57:56,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:57:56,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:57:56,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:57:56,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:57:56,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:57:56,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:57:56,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:57:56,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:57:56,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:57:56,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:57:56,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:57:56,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:57:56,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:57:56,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:57:56,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:57:56,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:57:56,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:57:56,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:57:56,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:57:56,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:57:56,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:57:56,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:57:56,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:57:56,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:57:56,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:57:56,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:57:56,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:57:56,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:57:56,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:57:56,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:57:56,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:57:56,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:57:56,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:57:56,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:57:56,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:57:56,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:57:56,735 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 02:57:56,774 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:57:56,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:57:56,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:57:56,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:57:56,777 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:57:56,777 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 02:57:56,777 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 02:57:56,777 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 02:57:56,778 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 02:57:56,778 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 02:57:56,779 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 02:57:56,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:57:56,780 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:57:56,780 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 02:57:56,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:57:56,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:57:56,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:57:56,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 02:57:56,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 02:57:56,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 02:57:56,788 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:57:56,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:57:56,788 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 02:57:56,789 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:57:56,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 02:57:56,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:57:56,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:57:56,789 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 02:57:56,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:57:56,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:57:56,791 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:57:56,792 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 02:57:56,794 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 02:57:56,794 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_192be74f-a082-4df9-8887-03a37219fece/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_192be74f-a082-4df9-8887-03a37219fece/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 -> a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 [2020-11-28 02:57:57,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:57:57,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:57:57,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:57:57,130 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:57:57,131 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:57:57,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-11-28 02:57:57,203 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/data/2fa45d7c0/4792293bcdee4ad1a26d44aa3f90a0bc/FLAG024bac5a6 [2020-11-28 02:57:57,700 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:57:57,701 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-11-28 02:57:57,722 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/data/2fa45d7c0/4792293bcdee4ad1a26d44aa3f90a0bc/FLAG024bac5a6 [2020-11-28 02:57:58,026 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/data/2fa45d7c0/4792293bcdee4ad1a26d44aa3f90a0bc [2020-11-28 02:57:58,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:57:58,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:57:58,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:57:58,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:57:58,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:57:58,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f159b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58, skipping insertion in model container [2020-11-28 02:57:58,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:57:58,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:57:58,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:57:58,472 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:57:58,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:57:58,580 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:57:58,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58 WrapperNode [2020-11-28 02:57:58,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:57:58,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:57:58,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:57:58,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:57:58,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:57:58,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:57:58,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:57:58,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:57:58,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... [2020-11-28 02:57:58,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:57:58,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:57:58,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:57:58,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:57:58,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:57:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 02:57:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:57:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:57:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:57:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:57:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:57:59,259 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:57:59,259 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-28 02:57:59,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:59 BoogieIcfgContainer [2020-11-28 02:57:59,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:57:59,262 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 02:57:59,263 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 02:57:59,267 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 02:57:59,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 02:57:59,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:57:58" (1/3) ... [2020-11-28 02:57:59,272 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6541a204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:57:59, skipping insertion in model container [2020-11-28 02:57:59,272 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 02:57:59,273 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:58" (2/3) ... [2020-11-28 02:57:59,273 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6541a204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:57:59, skipping insertion in model container [2020-11-28 02:57:59,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 02:57:59,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:59" (3/3) ... [2020-11-28 02:57:59,275 INFO L373 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2020-11-28 02:57:59,376 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 02:57:59,376 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 02:57:59,377 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 02:57:59,377 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:57:59,377 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:57:59,377 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 02:57:59,377 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:57:59,378 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 02:57:59,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-28 02:57:59,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-28 02:57:59,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:57:59,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:57:59,433 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-28 02:57:59,433 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 02:57:59,433 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 02:57:59,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-28 02:57:59,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-28 02:57:59,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:57:59,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:57:59,435 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-28 02:57:59,435 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 02:57:59,440 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 18#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L527-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_~k~0 := 0; 13#L532-3true [2020-11-28 02:57:59,440 INFO L796 eck$LassoCheckResult]: Loop: 13#L532-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 11#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 13#L532-3true [2020-11-28 02:57:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-28 02:57:59,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:59,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434448766] [2020-11-28 02:57:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:59,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:59,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:59,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:57:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-28 02:57:59,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:59,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585060743] [2020-11-28 02:57:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:59,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:59,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:59,609 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:57:59,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-28 02:57:59,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:59,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471604002] [2020-11-28 02:57:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:59,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:59,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:59,690 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:57:59,993 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-28 02:58:00,086 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 02:58:00,093 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 02:58:00,093 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 02:58:00,093 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 02:58:00,093 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 02:58:00,094 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:00,094 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 02:58:00,094 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 02:58:00,094 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2020-11-28 02:58:00,094 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 02:58:00,095 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 02:58:00,119 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-28 02:58:00,127 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-28 02:58:00,134 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-28 02:58:00,141 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-28 02:58:00,147 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-28 02:58:00,155 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-28 02:58:00,162 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-28 02:58:00,172 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-28 02:58:00,331 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-28 02:58:00,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-28 02:58:00,721 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 02:58:00,727 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:00,738 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-28 02:58:00,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:00,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:00,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:00,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:00,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:00,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:00,746 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-28 02:58:00,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:00,796 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-28 02:58:00,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:00,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:00,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:00,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:00,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:00,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:00,801 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-28 02:58:00,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:00,834 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-28 02:58:00,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:00,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:00,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:00,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:00,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:00,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:58:00,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:00,895 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-28 02:58:00,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:00,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:00,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:00,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:00,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:00,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:58:00,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:00,951 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-28 02:58:00,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:00,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:00,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:00,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:00,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:00,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:00,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:00,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:00,986 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-28 02:58:00,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:00,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:00,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:00,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:00,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:00,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:58:01,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:01,048 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-28 02:58:01,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:01,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:01,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:01,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:58:01,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:01,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:01,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:58:01,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:01,148 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-28 02:58:01,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:01,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:01,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:01,207 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-28 02:58:01,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:01,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:58:01,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:01,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:01,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:01,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:58:01,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:01,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 02:58:01,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:01,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:01,323 INFO L402 nArgumentSynthesizer]: A total of 0 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-28 02:58:01,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:01,366 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-28 02:58:01,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:01,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:01,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:01,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:01,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:01,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:01,394 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 02:58:01,519 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-28 02:58:01,519 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:01,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 02:58:01,602 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-28 02:58:01,602 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 02:58:01,603 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2020-11-28 02:58:01,675 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 02:58:01,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-28 02:58:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:01,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 02:58:01,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:01,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 02:58:01,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:01,832 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-28 02:58:01,849 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-28 02:58:01,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-11-28 02:58:01,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2020-11-28 02:58:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-28 02:58:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 02:58:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-11-28 02:58:01,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-28 02:58:01,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:01,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-28 02:58:01,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:01,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-28 02:58:01,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:01,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-11-28 02:58:01,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 02:58:01,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2020-11-28 02:58:01,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:01,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 02:58:01,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-11-28 02:58:01,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 02:58:01,960 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-28 02:58:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-11-28 02:58:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-28 02:58:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-28 02:58:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-11-28 02:58:01,987 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-28 02:58:01,987 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-28 02:58:01,987 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 02:58:01,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-11-28 02:58:01,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-28 02:58:01,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:01,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:01,990 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-28 02:58:01,990 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:01,991 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 120#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 121#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 123#L527-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_~k~0 := 0; 124#L532-3 assume !(main_~k~0 < main_~array_size~0); 132#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 131#L515-3 [2020-11-28 02:58:01,991 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 128#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 129#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 131#L515-3 [2020-11-28 02:58:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-28 02:58:02,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:02,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266170043] [2020-11-28 02:58:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:02,066 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-28 02:58:02,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266170043] [2020-11-28 02:58:02,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:58:02,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:58:02,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929131427] [2020-11-28 02:58:02,070 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:58:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-11-28 02:58:02,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:02,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486321439] [2020-11-28 02:58:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:02,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:02,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:02,096 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:02,119 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 02:58:02,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 02:58:02,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 02:58:02,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 02:58:02,120 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-28 02:58:02,120 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,120 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 02:58:02,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 02:58:02,120 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-11-28 02:58:02,120 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 02:58:02,120 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 02:58:02,122 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-28 02:58:02,127 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-28 02:58:02,132 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-28 02:58:02,138 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-28 02:58:02,151 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-28 02:58:02,247 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 02:58:02,249 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:02,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 02:58:02,262 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-28 02:58:02,267 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:02,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 02:58:02,309 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-28 02:58:02,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:02,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 02:58:02,355 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,359 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-28 02:58:02,359 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:02,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 02:58:02,399 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:02,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-28 02:58:02,450 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,493 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-28 02:58:02,495 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 02:58:02,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 02:58:02,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 02:58:02,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 02:58:02,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 02:58:02,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,496 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 02:58:02,496 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 02:58:02,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-11-28 02:58:02,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 02:58:02,497 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 02:58:02,498 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-28 02:58:02,508 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-28 02:58:02,513 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-28 02:58:02,526 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-28 02:58:02,532 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-28 02:58:02,641 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 02:58:02,641 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:02,651 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 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:02,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:02,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:02,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:02,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:02,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:02,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:58:02,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:02,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:02,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:02,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:02,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:02,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:02,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 02:58:02,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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) [2020-11-28 02:58:02,758 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-28 02:58:02,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:02,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:02,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:02,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:02,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:02,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:02,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 02:58:02,779 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-28 02:58:02,779 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:02,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 02:58:02,783 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-28 02:58:02,783 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 02:58:02,783 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:02,819 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-28 02:58:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:02,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 02:58:02,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:02,876 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 02:58:02,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:02,893 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-28 02:58:02,894 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-28 02:58:02,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-28 02:58:02,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 28 transitions. Complement of second has 4 states. [2020-11-28 02:58:02,917 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-28 02:58:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 02:58:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-11-28 02:58:02,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2020-11-28 02:58:02,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:02,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2020-11-28 02:58:02,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:02,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2020-11-28 02:58:02,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:02,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2020-11-28 02:58:02,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:02,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2020-11-28 02:58:02,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:02,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 02:58:02,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-11-28 02:58:02,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:02,921 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-11-28 02:58:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-11-28 02:58:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-28 02:58:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-28 02:58:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-11-28 02:58:02,924 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-11-28 02:58:02,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:58:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:58:02,932 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2020-11-28 02:58:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:02,964 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-11-28 02:58:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:58:02,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-11-28 02:58:02,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:02,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-11-28 02:58:02,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:02,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 02:58:02,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-11-28 02:58:02,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:02,967 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-11-28 02:58:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-11-28 02:58:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-28 02:58:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-28 02:58:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-11-28 02:58:02,970 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-11-28 02:58:02,970 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-11-28 02:58:02,971 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 02:58:02,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-11-28 02:58:02,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:02,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:02,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:02,973 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:02,973 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:02,973 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 234#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 235#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 237#L527-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_~k~0 := 0; 238#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 243#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 244#L532-3 assume !(main_~k~0 < main_~array_size~0); 249#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 250#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 240#L516-3 [2020-11-28 02:58:02,973 INFO L796 eck$LassoCheckResult]: Loop: 240#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 245#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 239#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 240#L516-3 [2020-11-28 02:58:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-11-28 02:58:02,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:02,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402840127] [2020-11-28 02:58:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:02,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,010 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-11-28 02:58:03,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685497292] [2020-11-28 02:58:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,029 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2020-11-28 02:58:03,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675938350] [2020-11-28 02:58:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:03,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675938350] [2020-11-28 02:58:03,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783621194] [2020-11-28 02:58:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/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-28 02:58:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:03,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 02:58:03,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:03,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:03,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-28 02:58:03,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028760518] [2020-11-28 02:58:03,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:03,399 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-11-28 02:58:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:03,540 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-11-28 02:58:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 02:58:03,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2020-11-28 02:58:03,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:03,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2020-11-28 02:58:03,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:03,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 02:58:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-11-28 02:58:03,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:03,544 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-11-28 02:58:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-11-28 02:58:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-28 02:58:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-28 02:58:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-11-28 02:58:03,546 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-11-28 02:58:03,546 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-11-28 02:58:03,546 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 02:58:03,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-11-28 02:58:03,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:03,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:03,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:03,549 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:03,549 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:03,549 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 340#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 342#L527-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_~k~0 := 0; 343#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 344#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 345#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 350#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 357#L532-3 assume !(main_~k~0 < main_~array_size~0); 355#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 356#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 347#L516-3 [2020-11-28 02:58:03,549 INFO L796 eck$LassoCheckResult]: Loop: 347#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 351#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 346#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 347#L516-3 [2020-11-28 02:58:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-11-28 02:58:03,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535493619] [2020-11-28 02:58:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-11-28 02:58:03,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927520919] [2020-11-28 02:58:03,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,628 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:03,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2020-11-28 02:58:03,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:03,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154824956] [2020-11-28 02:58:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:03,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:03,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:04,153 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2020-11-28 02:58:04,273 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-28 02:58:04,276 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 02:58:04,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 02:58:04,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 02:58:04,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 02:58:04,276 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 02:58:04,276 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:04,276 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 02:58:04,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 02:58:04,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2020-11-28 02:58:04,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 02:58:04,277 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 02:58:04,281 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-28 02:58:04,285 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-28 02:58:04,288 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-28 02:58:04,292 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-28 02:58:04,296 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-28 02:58:04,299 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-28 02:58:04,303 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-28 02:58:04,308 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-28 02:58:04,492 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-11-28 02:58:04,548 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-28 02:58:04,558 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-28 02:58:04,561 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-28 02:58:04,565 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-28 02:58:04,569 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-28 02:58:04,572 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-28 02:58:04,576 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-28 02:58:04,578 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-28 02:58:04,925 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-28 02:58:05,052 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 02:58:05,053 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,056 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-28 02:58:05,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:05,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:05,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,104 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-28 02:58:05,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:05,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,153 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-28 02:58:05,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:05,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:05,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,196 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-28 02:58:05,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:05,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,242 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 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:05,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:05,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 02:58:05,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,284 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-28 02:58:05,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 02:58:05,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 02:58:05,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,327 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-28 02:58:05,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:05,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 02:58:05,374 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-28 02:58:05,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 02:58:05,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 02:58:05,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 02:58:05,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 02:58:05,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 02:58:05,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,408 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 02:58:05,439 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-11-28 02:58:05,439 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:05,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 02:58:05,444 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 02:58:05,444 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 02:58:05,444 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2020-11-28 02:58:05,478 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 02:58:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 02:58:05,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 02:58:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:05,558 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-28 02:58:05,559 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-28 02:58:05,559 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-28 02:58:05,604 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 7 states. [2020-11-28 02:58:05,606 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-28 02:58:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 02:58:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-11-28 02:58:05,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-11-28 02:58:05,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:05,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-28 02:58:05,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:05,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-11-28 02:58:05,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 02:58:05,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2020-11-28 02:58:05,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:05,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2020-11-28 02:58:05,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:05,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 02:58:05,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-11-28 02:58:05,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:05,610 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-11-28 02:58:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-11-28 02:58:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-11-28 02:58:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-28 02:58:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-11-28 02:58:05,612 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-28 02:58:05,612 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-28 02:58:05,612 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 02:58:05,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-11-28 02:58:05,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:05,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:05,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:05,613 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:05,613 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:05,613 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 474#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 475#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 477#L527-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_~k~0 := 0; 478#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 483#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 484#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 487#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 492#L532-3 assume !(main_~k~0 < main_~array_size~0); 491#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 490#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 482#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 485#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 486#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 480#L516-3 [2020-11-28 02:58:05,614 INFO L796 eck$LassoCheckResult]: Loop: 480#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 488#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 479#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 480#L516-3 [2020-11-28 02:58:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2020-11-28 02:58:05,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:05,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588842902] [2020-11-28 02:58:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:05,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588842902] [2020-11-28 02:58:05,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947991611] [2020-11-28 02:58:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:05,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 02:58:05,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:58:05,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:05,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-28 02:58:05,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168844869] [2020-11-28 02:58:05,848 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:58:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-11-28 02:58:05,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:05,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838655380] [2020-11-28 02:58:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:05,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:05,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:05,867 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:06,023 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-11-28 02:58:06,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:58:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:58:06,057 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-11-28 02:58:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:06,173 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-11-28 02:58:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:58:06,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-11-28 02:58:06,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:06,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2020-11-28 02:58:06,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:06,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 02:58:06,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-11-28 02:58:06,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:06,176 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-11-28 02:58:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-11-28 02:58:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-11-28 02:58:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 02:58:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-11-28 02:58:06,178 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-28 02:58:06,178 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-28 02:58:06,178 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 02:58:06,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-11-28 02:58:06,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:06,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:06,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:06,184 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:06,184 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:06,184 INFO L794 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 577#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 579#L527-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_~k~0 := 0; 580#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 587#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 588#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 581#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 582#L532-3 assume !(main_~k~0 < main_~array_size~0); 594#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 595#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 590#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 591#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 585#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 586#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 592#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 593#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 584#L516-3 [2020-11-28 02:58:06,184 INFO L796 eck$LassoCheckResult]: Loop: 584#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 589#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 583#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 584#L516-3 [2020-11-28 02:58:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-11-28 02:58:06,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513766065] [2020-11-28 02:58:06,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:06,241 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-11-28 02:58:06,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51982545] [2020-11-28 02:58:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:06,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2020-11-28 02:58:06,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741516756] [2020-11-28 02:58:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 02:58:06,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741516756] [2020-11-28 02:58:06,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176038086] [2020-11-28 02:58:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:06,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 02:58:06,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 02:58:06,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:06,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-11-28 02:58:06,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884420425] [2020-11-28 02:58:06,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 02:58:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:58:06,583 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-28 02:58:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:06,734 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-11-28 02:58:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 02:58:06,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-11-28 02:58:06,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:06,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2020-11-28 02:58:06,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:06,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 02:58:06,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-11-28 02:58:06,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:06,737 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-28 02:58:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-11-28 02:58:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-28 02:58:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-28 02:58:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-11-28 02:58:06,738 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-28 02:58:06,738 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-28 02:58:06,738 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 02:58:06,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-11-28 02:58:06,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:06,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:06,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:06,740 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:06,740 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:06,740 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 712#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 713#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 715#L527-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_~k~0 := 0; 716#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 723#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 724#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 717#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 718#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 733#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 732#L532-3 assume !(main_~k~0 < main_~array_size~0); 731#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 730#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 726#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 727#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 721#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 722#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 728#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 729#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 720#L516-3 [2020-11-28 02:58:06,740 INFO L796 eck$LassoCheckResult]: Loop: 720#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 725#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 719#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 720#L516-3 [2020-11-28 02:58:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-11-28 02:58:06,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464200563] [2020-11-28 02:58:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:06,831 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-28 02:58:06,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464200563] [2020-11-28 02:58:06,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999285808] [2020-11-28 02:58:06,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:06,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 02:58:06,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:58:06,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 02:58:06,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:06,991 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-28 02:58:06,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:06,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-11-28 02:58:06,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483318429] [2020-11-28 02:58:06,993 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 02:58:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-11-28 02:58:06,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:06,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718872464] [2020-11-28 02:58:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:06,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:07,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:07,008 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:07,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 02:58:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:58:07,108 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-11-28 02:58:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:07,301 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-11-28 02:58:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 02:58:07,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-11-28 02:58:07,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:07,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2020-11-28 02:58:07,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 02:58:07,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 02:58:07,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-11-28 02:58:07,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:07,303 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-11-28 02:58:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-11-28 02:58:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-11-28 02:58:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-28 02:58:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-11-28 02:58:07,306 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-28 02:58:07,306 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-28 02:58:07,306 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 02:58:07,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-11-28 02:58:07,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:07,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:07,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:07,307 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:07,308 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:07,308 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 846#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 847#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 849#L527-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_~k~0 := 0; 850#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 855#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 856#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 862#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 868#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 867#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 866#L532-3 assume !(main_~k~0 < main_~array_size~0); 865#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 863#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 864#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 870#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 869#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 858#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 859#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 853#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 854#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 860#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 861#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 852#L516-3 [2020-11-28 02:58:07,308 INFO L796 eck$LassoCheckResult]: Loop: 852#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 857#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 851#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 852#L516-3 [2020-11-28 02:58:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:07,308 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-11-28 02:58:07,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:07,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642183008] [2020-11-28 02:58:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:07,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:07,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:07,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2020-11-28 02:58:07,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:07,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564099911] [2020-11-28 02:58:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:07,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:07,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:07,354 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2020-11-28 02:58:07,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:07,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45602410] [2020-11-28 02:58:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:58:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 02:58:07,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45602410] [2020-11-28 02:58:07,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56067868] [2020-11-28 02:58:07,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_192be74f-a082-4df9-8887-03a37219fece/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:58:07,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 02:58:07,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 02:58:07,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-28 02:58:07,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:58:07,822 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-28 02:58:07,823 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-11-28 02:58:07,824 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 02:58:07,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 02:58:07,827 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 02:58:07,827 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-11-28 02:58:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 02:58:07,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:58:07,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-11-28 02:58:07,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088725172] [2020-11-28 02:58:07,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:58:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-28 02:58:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-11-28 02:58:07,928 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 15 states. [2020-11-28 02:58:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:58:08,209 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-11-28 02:58:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 02:58:08,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2020-11-28 02:58:08,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-28 02:58:08,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2020-11-28 02:58:08,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-28 02:58:08,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-28 02:58:08,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2020-11-28 02:58:08,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 02:58:08,213 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-11-28 02:58:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2020-11-28 02:58:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-11-28 02:58:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-28 02:58:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2020-11-28 02:58:08,216 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-11-28 02:58:08,216 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-11-28 02:58:08,216 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 02:58:08,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2020-11-28 02:58:08,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 02:58:08,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 02:58:08,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 02:58:08,218 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:58:08,218 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 02:58:08,218 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1023#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1024#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1026#L527-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_~k~0 := 0; 1027#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1034#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1035#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1028#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1029#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1047#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1046#L532-3 assume !(main_~k~0 < main_~array_size~0); 1042#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 1043#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1038#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1039#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1055#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1056#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1058#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1032#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1033#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1040#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1041#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1031#L516-3 [2020-11-28 02:58:08,218 INFO L796 eck$LassoCheckResult]: Loop: 1031#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1048#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1030#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1031#L516-3 [2020-11-28 02:58:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2020-11-28 02:58:08,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:08,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641570020] [2020-11-28 02:58:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:08,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:08,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:08,289 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2020-11-28 02:58:08,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:08,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388697734] [2020-11-28 02:58:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:08,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:08,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:08,299 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:58:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2020-11-28 02:58:08,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:58:08,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196454423] [2020-11-28 02:58:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:58:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:08,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:58:08,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:58:08,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:58:09,261 WARN L193 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 140 [2020-11-28 02:58:09,434 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-28 02:58:09,436 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 02:58:09,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 02:58:09,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 02:58:09,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 02:58:09,436 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 02:58:09,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 02:58:09,436 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 02:58:09,436 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 02:58:09,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2020-11-28 02:58:09,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 02:58:09,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 02:58:09,440 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-28 02:58:09,469 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-28 02:58:09,471 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-28 02:58:09,474 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-28 02:58:09,476 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-28 02:58:09,479 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-28 02:58:09,565 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-28 02:58:09,571 INFO L168 Benchmark]: Toolchain (without parser) took 11540.28 ms. Allocated memory was 86.0 MB in the beginning and 167.8 MB in the end (delta: 81.8 MB). Free memory was 65.0 MB in the beginning and 89.4 MB in the end (delta: -24.4 MB). Peak memory consumption was 101.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:09,571 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 69.2 MB. Free memory was 42.2 MB in the beginning and 42.1 MB in the end (delta: 77.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:58:09,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 551.87 ms. Allocated memory is still 86.0 MB. Free memory was 64.8 MB in the beginning and 44.3 MB in the end (delta: 20.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:09,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.63 ms. Allocated memory is still 86.0 MB. Free memory was 44.1 MB in the beginning and 42.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:09,572 INFO L168 Benchmark]: Boogie Preprocessor took 62.51 ms. Allocated memory is still 86.0 MB. Free memory was 42.5 MB in the beginning and 41.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:58:09,572 INFO L168 Benchmark]: RCFGBuilder took 531.59 ms. Allocated memory is still 86.0 MB. Free memory was 41.0 MB in the beginning and 58.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:09,573 INFO L168 Benchmark]: BuchiAutomizer took 10307.51 ms. Allocated memory was 86.0 MB in the beginning and 167.8 MB in the end (delta: 81.8 MB). Free memory was 58.4 MB in the beginning and 89.4 MB in the end (delta: -31.1 MB). Peak memory consumption was 95.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:58:09,575 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.76 ms. Allocated memory is still 69.2 MB. Free memory was 42.2 MB in the beginning and 42.1 MB in the end (delta: 77.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 551.87 ms. Allocated memory is still 86.0 MB. Free memory was 64.8 MB in the beginning and 44.3 MB in the end (delta: 20.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.63 ms. Allocated memory is still 86.0 MB. Free memory was 44.1 MB in the beginning and 42.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.51 ms. Allocated memory is still 86.0 MB. Free memory was 42.5 MB in the beginning and 41.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 531.59 ms. Allocated memory is still 86.0 MB. Free memory was 41.0 MB in the beginning and 58.6 MB in the end (delta: -17.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 10307.51 ms. Allocated memory was 86.0 MB in the beginning and 167.8 MB in the end (delta: 81.8 MB). Free memory was 58.4 MB in the beginning and 89.4 MB in the end (delta: -31.1 MB). Peak memory consumption was 95.8 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...