./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/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_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:00:34,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:00:34,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:00:34,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:00:34,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:00:34,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:00:34,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:00:34,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:00:34,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:00:34,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:00:34,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:00:34,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:00:34,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:00:34,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:00:34,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:00:34,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:00:34,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:00:34,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:00:34,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:00:34,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:00:34,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:00:34,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:00:34,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:00:34,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:00:34,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:00:34,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:00:34,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:00:34,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:00:34,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:00:34,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:00:34,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:00:34,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:00:34,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:00:34,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:00:34,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:00:34,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:00:34,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:00:34,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:00:34,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:00:34,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:00:34,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:00:34,857 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 16:00:34,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:00:34,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:00:34,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:00:34,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:00:34,870 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:00:34,870 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 16:00:34,870 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 16:00:34,870 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 16:00:34,870 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 16:00:34,870 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 16:00:34,871 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 16:00:34,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:00:34,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:00:34,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:00:34,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:00:34,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:00:34,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:00:34,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 16:00:34,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:00:34,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:00:34,873 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 16:00:34,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:00:34,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:00:34,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:00:34,873 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 16:00:34,874 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 16:00:34,874 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/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 [2019-12-07 16:00:34,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:00:34,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:00:34,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:00:34,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:00:34,988 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:00:34,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-12-07 16:00:35,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/data/913736de0/a2dcd072ac864290b36698211c56cbe7/FLAG8c1ab3d05 [2019-12-07 16:00:35,499 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:00:35,500 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-12-07 16:00:35,509 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/data/913736de0/a2dcd072ac864290b36698211c56cbe7/FLAG8c1ab3d05 [2019-12-07 16:00:35,518 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/data/913736de0/a2dcd072ac864290b36698211c56cbe7 [2019-12-07 16:00:35,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:00:35,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:00:35,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:00:35,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:00:35,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:00:35,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3357ba65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35, skipping insertion in model container [2019-12-07 16:00:35,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:00:35,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:00:35,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:00:35,780 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:00:35,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:00:35,838 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:00:35,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35 WrapperNode [2019-12-07 16:00:35,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:00:35,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:00:35,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:00:35,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:00:35,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:00:35,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:00:35,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:00:35,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:00:35,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... [2019-12-07 16:00:35,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:00:35,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:00:35,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:00:35,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:00:35,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:00:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:00:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:00:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:00:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:00:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:00:36,095 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:00:36,095 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 16:00:36,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:00:36 BoogieIcfgContainer [2019-12-07 16:00:36,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:00:36,096 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 16:00:36,096 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 16:00:36,098 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 16:00:36,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 16:00:36,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 04:00:35" (1/3) ... [2019-12-07 16:00:36,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23beb1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 04:00:36, skipping insertion in model container [2019-12-07 16:00:36,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 16:00:36,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:00:35" (2/3) ... [2019-12-07 16:00:36,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23beb1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 04:00:36, skipping insertion in model container [2019-12-07 16:00:36,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 16:00:36,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:00:36" (3/3) ... [2019-12-07 16:00:36,102 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2019-12-07 16:00:36,130 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 16:00:36,130 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 16:00:36,130 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 16:00:36,131 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:00:36,131 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:00:36,131 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 16:00:36,131 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:00:36,131 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 16:00:36,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 16:00:36,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 16:00:36,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:36,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:36,162 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 16:00:36,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 16:00:36,162 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 16:00:36,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-12-07 16:00:36,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-12-07 16:00:36,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:36,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:36,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 16:00:36,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 16:00:36,170 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 [2019-12-07 16:00:36,170 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 [2019-12-07 16:00:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-12-07 16:00:36,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:36,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609275965] [2019-12-07 16:00:36,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:36,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-12-07 16:00:36,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:36,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232253631] [2019-12-07 16:00:36,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:36,275 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:36,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-12-07 16:00:36,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:36,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726557583] [2019-12-07 16:00:36,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:36,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:36,451 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 16:00:36,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 16:00:36,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 16:00:36,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 16:00:36,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 16:00:36,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 16:00:36,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 16:00:36,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2019-12-07 16:00:36,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 16:00:36,452 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 16:00:36,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:36,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 16:00:36,709 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:36,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:36,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 16:00:36,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:36,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:36,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:36,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 16:00:36,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 16:00:36,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:36,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:36,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:36,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:36,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:36,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:36,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:36,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,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 [2019-12-07 16:00:36,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:36,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:36,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:36,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:36,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:36,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:36,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:36,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:36,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:36,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:36,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:36,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:36,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:36,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:36,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:36,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 16:00:36,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:36,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:36,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:36,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 16:00:36,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 16:00:36,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:36,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:36,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:36,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:36,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:36,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:36,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:36,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 16:00:36,834 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-12-07 16:00:36,834 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:36,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 16:00:36,844 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 16:00:36,844 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 16:00:36,845 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-12-07 16:00:36,858 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 16:00:36,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 16:00:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:36,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:00:36,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:36,928 WARN L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:00:36,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:36,959 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 16:00:36,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-12-07 16:00:37,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 35 states and 53 transitions. Complement of second has 8 states. [2019-12-07 16:00:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 16:00:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 16:00:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-12-07 16:00:37,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 16:00:37,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:37,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2019-12-07 16:00:37,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:37,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2019-12-07 16:00:37,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:37,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2019-12-07 16:00:37,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 16:00:37,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2019-12-07 16:00:37,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:37,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 16:00:37,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-12-07 16:00:37,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 16:00:37,038 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 16:00:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-12-07 16:00:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 16:00:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 16:00:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-12-07 16:00:37,056 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 16:00:37,057 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 16:00:37,057 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 16:00:37,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-12-07 16:00:37,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 16:00:37,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:37,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:37,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:00:37,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:37,058 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 118#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; 119#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 121#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; 122#L532-3 assume !(main_~k~0 < main_~array_size~0); 130#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; 129#L515-3 [2019-12-07 16:00:37,058 INFO L796 eck$LassoCheckResult]: Loop: 129#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 126#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 127#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 129#L515-3 [2019-12-07 16:00:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-12-07 16:00:37,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852151008] [2019-12-07 16:00:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:37,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852151008] [2019-12-07 16:00:37,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:00:37,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:00:37,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8607048] [2019-12-07 16:00:37,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 16:00:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-12-07 16:00:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545690734] [2019-12-07 16:00:37,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:37,117 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 16:00:37,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 16:00:37,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 16:00:37,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 16:00:37,118 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 16:00:37,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 16:00:37,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 16:00:37,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-12-07 16:00:37,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 16:00:37,119 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 16:00:37,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,177 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 16:00:37,178 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 16:00:37,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 16:00:37,185 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 16:00:37,185 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_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 16:00:37,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 16:00:37,192 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 16:00:37,192 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_b6b0d545-da41-4c97-a477-86b20392b496/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 [2019-12-07 16:00:37,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 16:00:37,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 16:00:37,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 16:00:37,200 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_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 16:00:37,204 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 16:00:37,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 16:00:37,220 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 16:00:37,222 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 16:00:37,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 16:00:37,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 16:00:37,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 16:00:37,223 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 16:00:37,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 16:00:37,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 16:00:37,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-12-07 16:00:37,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 16:00:37,223 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 16:00:37,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:37,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 16:00:37,287 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:37,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:37,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 16:00:37,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:37,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:37,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:37,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 16:00:37,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 16:00:37,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:37,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:37,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:37,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:37,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:37,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:37,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:37,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:37,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:37,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 16:00:37,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:37,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:37,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:37,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 16:00:37,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 16:00:37,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 16:00:37,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 16:00:37,318 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_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,320 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 16:00:37,320 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 16:00:37,320 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 16:00:37,320 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2019-12-07 16:00:37,322 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 16:00:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:37,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:00:37,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:37,341 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:00:37,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:37,347 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 16:00:37,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-12-07 16:00:37,356 INFO L76 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. [2019-12-07 16:00:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 16:00:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 16:00:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-12-07 16:00:37,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2019-12-07 16:00:37,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:37,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2019-12-07 16:00:37,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:37,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2019-12-07 16:00:37,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:37,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2019-12-07 16:00:37,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:37,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2019-12-07 16:00:37,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:37,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 16:00:37,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-12-07 16:00:37,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:37,360 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-12-07 16:00:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-12-07 16:00:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 16:00:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:00:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-12-07 16:00:37,361 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-12-07 16:00:37,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:00:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:00:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:00:37,364 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2019-12-07 16:00:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:00:37,378 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-12-07 16:00:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:00:37,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-12-07 16:00:37,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:37,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-12-07 16:00:37,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:37,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 16:00:37,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-12-07 16:00:37,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:37,380 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-12-07 16:00:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-12-07 16:00:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 16:00:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:00:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-12-07 16:00:37,382 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-12-07 16:00:37,382 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-12-07 16:00:37,382 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 16:00:37,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-12-07 16:00:37,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:37,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:37,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:37,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:37,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:37,383 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 232#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; 233#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 235#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; 236#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; 241#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 242#L532-3 assume !(main_~k~0 < main_~array_size~0); 247#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; 248#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 238#L516-3 [2019-12-07 16:00:37,383 INFO L796 eck$LassoCheckResult]: Loop: 238#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); 243#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); 237#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 238#L516-3 [2019-12-07 16:00:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-12-07 16:00:37,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191594214] [2019-12-07 16:00:37,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-12-07 16:00:37,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260961948] [2019-12-07 16:00:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2019-12-07 16:00:37,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504512705] [2019-12-07 16:00:37,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:37,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504512705] [2019-12-07 16:00:37,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416832214] [2019-12-07 16:00:37,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:00:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:37,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:00:37,493 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:37,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:00:37,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-12-07 16:00:37,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8843175] [2019-12-07 16:00:37,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:00:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:00:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:00:37,582 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 11 states. [2019-12-07 16:00:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:00:37,672 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-12-07 16:00:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:00:37,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-12-07 16:00:37,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:37,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 26 transitions. [2019-12-07 16:00:37,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:37,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 16:00:37,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-12-07 16:00:37,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:37,674 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-12-07 16:00:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-12-07 16:00:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-12-07 16:00:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 16:00:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-12-07 16:00:37,676 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-12-07 16:00:37,676 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-12-07 16:00:37,677 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 16:00:37,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-12-07 16:00:37,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:37,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:37,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:37,678 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:37,678 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:37,678 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 336#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; 337#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 339#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; 340#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; 341#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 342#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; 351#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 354#L532-3 assume !(main_~k~0 < main_~array_size~0); 352#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; 353#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 344#L516-3 [2019-12-07 16:00:37,678 INFO L796 eck$LassoCheckResult]: Loop: 344#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); 347#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); 343#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 344#L516-3 [2019-12-07 16:00:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2019-12-07 16:00:37,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762252753] [2019-12-07 16:00:37,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,703 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-12-07 16:00:37,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049441070] [2019-12-07 16:00:37,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2019-12-07 16:00:37,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:37,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404599373] [2019-12-07 16:00:37,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:37,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:37,944 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-12-07 16:00:37,997 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 16:00:37,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 16:00:37,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 16:00:37,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 16:00:37,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 16:00:37,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:37,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 16:00:37,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 16:00:37,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2019-12-07 16:00:37,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 16:00:37,998 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 16:00:38,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:38,360 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 16:00:38,360 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:38,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:38,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:38,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 16:00:38,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:38,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:38,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:38,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 16:00:38,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 16:00:38,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:38,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:38,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:38,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:38,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:38,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:38,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:38,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:38,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:38,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:38,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:38,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 16:00:38,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:38,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:38,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:38,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 16:00:38,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 16:00:38,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:38,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 16:00:38,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 16:00:38,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 16:00:38,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 16:00:38,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 16:00:38,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 16:00:38,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 16:00:38,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 16:00:38,443 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-12-07 16:00:38,443 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_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:38,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 16:00:38,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 16:00:38,448 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 16:00:38,448 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 2*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 Supporting invariants [] [2019-12-07 16:00:38,457 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 16:00:38,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 16:00:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:38,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:00:38,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:38,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:00:38,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:38,510 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-12-07 16:00:38,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-12-07 16:00:38,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 34 states and 47 transitions. Complement of second has 9 states. [2019-12-07 16:00:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 16:00:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-12-07 16:00:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-12-07 16:00:38,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-12-07 16:00:38,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:38,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 16:00:38,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:38,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-12-07 16:00:38,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 16:00:38,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-12-07 16:00:38,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:38,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2019-12-07 16:00:38,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:38,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 16:00:38,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-12-07 16:00:38,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:38,553 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-12-07 16:00:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-12-07 16:00:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-12-07 16:00:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 16:00:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-12-07 16:00:38,554 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-12-07 16:00:38,554 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-12-07 16:00:38,554 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 16:00:38,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-12-07 16:00:38,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:38,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:38,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:38,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:38,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:38,556 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 482#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; 483#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 485#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; 486#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; 491#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);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 497#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 500#L532-3 assume !(main_~k~0 < main_~array_size~0); 499#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; 498#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 490#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 494#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 496#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 488#L516-3 [2019-12-07 16:00:38,556 INFO L796 eck$LassoCheckResult]: Loop: 488#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); 493#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); 487#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 488#L516-3 [2019-12-07 16:00:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2019-12-07 16:00:38,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:38,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113655775] [2019-12-07 16:00:38,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:38,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113655775] [2019-12-07 16:00:38,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625697915] [2019-12-07 16:00:38,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:00:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:38,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:00:38,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:38,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:00:38,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-12-07 16:00:38,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817617602] [2019-12-07 16:00:38,653 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 16:00:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-12-07 16:00:38,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:38,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882496992] [2019-12-07 16:00:38,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:38,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:38,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:00:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:00:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:00:38,710 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-12-07 16:00:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:00:38,765 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-12-07 16:00:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:00:38,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-12-07 16:00:38,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:38,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-12-07 16:00:38,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:38,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 16:00:38,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-12-07 16:00:38,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:38,766 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-12-07 16:00:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-12-07 16:00:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-12-07 16:00:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 16:00:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-12-07 16:00:38,768 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-12-07 16:00:38,768 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-12-07 16:00:38,768 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 16:00:38,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-12-07 16:00:38,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:38,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:38,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:38,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:38,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:38,769 INFO L794 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 587#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; 588#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 590#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; 591#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; 603#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 604#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; 596#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 597#L532-3 assume !(main_~k~0 < main_~array_size~0); 606#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; 605#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 601#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); 602#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 594#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 595#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 598#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 599#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 593#L516-3 [2019-12-07 16:00:38,769 INFO L796 eck$LassoCheckResult]: Loop: 593#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); 600#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); 592#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 593#L516-3 [2019-12-07 16:00:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-12-07 16:00:38,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:38,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273728362] [2019-12-07 16:00:38,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:38,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-12-07 16:00:38,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:38,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485947733] [2019-12-07 16:00:38,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:38,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2019-12-07 16:00:38,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:38,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884735147] [2019-12-07 16:00:38,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:00:38,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884735147] [2019-12-07 16:00:38,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734514568] [2019-12-07 16:00:38,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/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 [2019-12-07 16:00:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:38,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:00:38,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:00:38,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:00:38,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-12-07 16:00:38,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838574693] [2019-12-07 16:00:38,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:00:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:00:38,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:00:38,975 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-12-07 16:00:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:00:39,066 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-12-07 16:00:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:00:39,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-12-07 16:00:39,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:39,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2019-12-07 16:00:39,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:39,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 16:00:39,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-12-07 16:00:39,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:39,067 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-12-07 16:00:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-12-07 16:00:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-12-07 16:00:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 16:00:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-12-07 16:00:39,069 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-12-07 16:00:39,069 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-12-07 16:00:39,069 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 16:00:39,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-12-07 16:00:39,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:39,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:39,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:39,070 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:39,070 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:39,070 INFO L794 eck$LassoCheckResult]: Stem: 729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#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; 728#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 730#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; 731#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; 743#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 744#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; 736#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 737#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; 748#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 747#L532-3 assume !(main_~k~0 < main_~array_size~0); 746#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; 745#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 739#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); 740#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 734#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 735#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 741#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 742#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 733#L516-3 [2019-12-07 16:00:39,070 INFO L796 eck$LassoCheckResult]: Loop: 733#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); 738#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); 732#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 733#L516-3 [2019-12-07 16:00:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2019-12-07 16:00:39,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536376897] [2019-12-07 16:00:39,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:39,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536376897] [2019-12-07 16:00:39,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970616266] [2019-12-07 16:00:39,123 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:00:39,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:00:39,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:00:39,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:00:39,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:00:39,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:00:39,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-12-07 16:00:39,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361499774] [2019-12-07 16:00:39,190 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 16:00:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,190 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2019-12-07 16:00:39,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607336109] [2019-12-07 16:00:39,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:39,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:00:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:00:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:00:39,249 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 16 states. [2019-12-07 16:00:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:00:39,374 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-12-07 16:00:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:00:39,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-12-07 16:00:39,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:39,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2019-12-07 16:00:39,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 16:00:39,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 16:00:39,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-12-07 16:00:39,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:39,376 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-12-07 16:00:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-12-07 16:00:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-12-07 16:00:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 16:00:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-12-07 16:00:39,377 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-12-07 16:00:39,377 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-12-07 16:00:39,377 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 16:00:39,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-12-07 16:00:39,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:39,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:39,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:39,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:39,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:39,378 INFO L794 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 865#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; 866#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 868#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; 869#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; 870#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 871#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; 876#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 888#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; 887#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 886#L532-3 assume !(main_~k~0 < main_~array_size~0); 881#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; 882#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 883#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); 889#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 874#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 875#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); 878#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 885#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 884#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 879#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 880#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 873#L516-3 [2019-12-07 16:00:39,379 INFO L796 eck$LassoCheckResult]: Loop: 873#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); 877#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); 872#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 873#L516-3 [2019-12-07 16:00:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2019-12-07 16:00:39,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414476707] [2019-12-07 16:00:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2019-12-07 16:00:39,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394480590] [2019-12-07 16:00:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2019-12-07 16:00:39,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019541219] [2019-12-07 16:00:39,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:00:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:00:39,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019541219] [2019-12-07 16:00:39,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719548331] [2019-12-07 16:00:39,569 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b0d545-da41-4c97-a477-86b20392b496/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:00:39,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:00:39,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:00:39,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:00:39,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:00:39,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:00:39,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-12-07 16:00:39,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:00:39,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:00:39,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:00:39,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-12-07 16:00:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:00:39,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:00:39,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-12-07 16:00:39,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708002246] [2019-12-07 16:00:39,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:00:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:00:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:00:39,717 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-12-07 16:00:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:00:39,839 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-12-07 16:00:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:00:39,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-12-07 16:00:39,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 16:00:39,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2019-12-07 16:00:39,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-12-07 16:00:39,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 16:00:39,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2019-12-07 16:00:39,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 16:00:39,841 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2019-12-07 16:00:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2019-12-07 16:00:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-12-07 16:00:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 16:00:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-12-07 16:00:39,844 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-12-07 16:00:39,844 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-12-07 16:00:39,844 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 16:00:39,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2019-12-07 16:00:39,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 16:00:39,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 16:00:39,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 16:00:39,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:00:39,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 16:00:39,846 INFO L794 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1039#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; 1040#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1042#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; 1043#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; 1048#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1049#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; 1054#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1064#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; 1063#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1062#L532-3 assume !(main_~k~0 < main_~array_size~0); 1058#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; 1055#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 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); 1060#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1061#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1074#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); 1070#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); 1046#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1047#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1050#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1051#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1045#L516-3 [2019-12-07 16:00:39,846 INFO L796 eck$LassoCheckResult]: Loop: 1045#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); 1052#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); 1044#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1045#L516-3 [2019-12-07 16:00:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2019-12-07 16:00:39,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936335954] [2019-12-07 16:00:39,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2019-12-07 16:00:39,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738621109] [2019-12-07 16:00:39,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:00:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2019-12-07 16:00:39,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:00:39,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406782695] [2019-12-07 16:00:39,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:00:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:00:39,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:00:40,456 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 139 [2019-12-07 16:00:40,558 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 16:00:40,558 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 16:00:40,558 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 16:00:40,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 16:00:40,558 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 16:00:40,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 16:00:40,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 16:00:40,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 16:00:40,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2019-12-07 16:00:40,559 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 16:00:40,559 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 16:00:40,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 16:00:40,638 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:00:40,640 INFO L168 Benchmark]: Toolchain (without parser) took 5119.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 932.6 MB in the beginning and 951.6 MB in the end (delta: -18.9 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:00:40,641 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:00:40,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:00:40,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:00:40,641 INFO L168 Benchmark]: Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:00:40,642 INFO L168 Benchmark]: RCFGBuilder took 206.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:00:40,642 INFO L168 Benchmark]: BuchiAutomizer took 4543.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 105.0 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:00:40,644 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4543.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 105.0 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...