./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/bubblesort_unsafe_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d947ac2f4314b6371797f06202127d0425ea9bb5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:58:11,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:58:11,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:58:11,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:58:11,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:58:11,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:58:11,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:58:11,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:58:11,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:58:11,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:58:11,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:58:11,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:58:11,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:58:11,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:58:11,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:58:11,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:58:11,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:58:11,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:58:11,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:58:11,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:58:11,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:58:11,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:58:11,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:58:11,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:58:11,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:58:11,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:58:11,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:58:11,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:58:11,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:58:11,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:58:11,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:58:11,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:58:11,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:58:11,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:58:11,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:58:11,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:58:11,909 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-22 23:58:11,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:58:11,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:58:11,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:58:11,920 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:58:11,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:58:11,921 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:58:11,922 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:58:11,922 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:58:11,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:58:11,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:58:11,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:58:11,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:58:11,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:58:11,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:58:11,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:58:11,925 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d947ac2f4314b6371797f06202127d0425ea9bb5 [2018-11-22 23:58:11,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:58:11,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:58:11,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:58:11,958 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:58:11,958 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:58:11,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/bubblesort_unsafe_false-valid-deref.i [2018-11-22 23:58:11,996 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/data/1ee66b901/be75e942eae845c0a4619f92fba02f4e/FLAG69f26f0f0 [2018-11-22 23:58:12,336 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:58:12,336 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/sv-benchmarks/c/array-memsafety/bubblesort_unsafe_false-valid-deref.i [2018-11-22 23:58:12,342 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/data/1ee66b901/be75e942eae845c0a4619f92fba02f4e/FLAG69f26f0f0 [2018-11-22 23:58:12,765 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/data/1ee66b901/be75e942eae845c0a4619f92fba02f4e [2018-11-22 23:58:12,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:58:12,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:58:12,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:58:12,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:58:12,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:58:12,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eac3ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12, skipping insertion in model container [2018-11-22 23:58:12,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:58:12,793 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:58:12,901 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:58:12,908 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:58:12,918 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:58:12,929 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:58:12,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12 WrapperNode [2018-11-22 23:58:12,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:58:12,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:58:12,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:58:12,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:58:12,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:58:12,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:58:12,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:58:12,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:58:12,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... [2018-11-22 23:58:12,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:58:12,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:58:12,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:58:12,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:58:12,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:58:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:58:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure bubbleSort [2018-11-22 23:58:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure bubbleSort [2018-11-22 23:58:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:58:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:58:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:58:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:58:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:58:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:58:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:58:13,164 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:58:13,164 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 23:58:13,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:58:13 BoogieIcfgContainer [2018-11-22 23:58:13,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:58:13,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:58:13,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:58:13,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:58:13,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:58:12" (1/3) ... [2018-11-22 23:58:13,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563dcd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:58:13, skipping insertion in model container [2018-11-22 23:58:13,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:58:12" (2/3) ... [2018-11-22 23:58:13,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563dcd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:58:13, skipping insertion in model container [2018-11-22 23:58:13,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:58:13" (3/3) ... [2018-11-22 23:58:13,171 INFO L112 eAbstractionObserver]: Analyzing ICFG bubblesort_unsafe_false-valid-deref.i [2018-11-22 23:58:13,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:58:13,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-22 23:58:13,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-22 23:58:13,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:58:13,219 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-22 23:58:13,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:58:13,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:58:13,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:58:13,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:58:13,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:58:13,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:58:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-22 23:58:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-22 23:58:13,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:58:13,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:58:13,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [bubbleSortErr7REQUIRES_VIOLATION, bubbleSortErr1REQUIRES_VIOLATION, bubbleSortErr8REQUIRES_VIOLATION, bubbleSortErr6REQUIRES_VIOLATION, bubbleSortErr0REQUIRES_VIOLATION, bubbleSortErr9REQUIRES_VIOLATION, bubbleSortErr5REQUIRES_VIOLATION, bubbleSortErr10REQUIRES_VIOLATION, bubbleSortErr4REQUIRES_VIOLATION, bubbleSortErr11REQUIRES_VIOLATION, bubbleSortErr3REQUIRES_VIOLATION, bubbleSortErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-22 23:58:13,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:58:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1760941198, now seen corresponding path program 1 times [2018-11-22 23:58:13,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:58:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:58:13,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:58:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:58:13,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:58:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:58:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:58:13,326 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=2, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~numbers~0.base, ~numbers~0.offset;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~array_size~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~array_size~0=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call bubbleSort(~numbers~0.base, ~numbers~0.offset, ~array_size~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] ~numbers.base, ~numbers.offset := #in~numbers.base, #in~numbers.offset;~array_size := #in~array_size;havoc ~i~0;havoc ~j~0;havoc ~temp~0;~i~0 := ~array_size - 1; VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] assume !!(~i~0 >= 0);~j~0 := 1; VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~j~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] assume !!(~j~0 <= ~i~0); VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~j~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] assume !(1 == #valid[~numbers.base]); VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~j~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L16] havoc ~numbers~0.base, ~numbers~0.offset; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0.base, ~numbers~0.offset, ~array_size~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0] [L2-L14] ~numbers.base, ~numbers.offset := #in~numbers.base, #in~numbers.offset; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~numbers.base=4, ~numbers.offset=3] [L5-L13] assume !!(~i~0 >= 0); [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L6-L12] assume !!(~j~0 <= ~i~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L7] call #t~mem2 := read~int(~numbers.base, ~numbers.offset + 4 * (~j~0 - 1), 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L16] havoc ~numbers~0.base, ~numbers~0.offset; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0.base, ~numbers~0.offset, ~array_size~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0] [L2-L14] ~numbers.base, ~numbers.offset := #in~numbers.base, #in~numbers.offset; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~numbers.base=4, ~numbers.offset=3] [L5-L13] assume !!(~i~0 >= 0); [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L6-L12] assume !!(~j~0 <= ~i~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L7] call #t~mem2 := read~int(~numbers.base, ~numbers.offset + 4 * (~j~0 - 1), 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L16] int* numbers; [L17] int array_size = __VERIFIER_nondet_int(); [L18] CALL bubbleSort(numbers, array_size) VAL [\old(array_size)=2, numbers={4:3}] [L4] int i, j, temp; [L5] i = (array_size - 1) VAL [\old(array_size)=2, array_size=2, i=1, numbers={4:3}, numbers={4:3}] [L5] COND TRUE i >= 0 [L6] j = 1 VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={4:3}, numbers={4:3}] [L6] COND TRUE j <= i VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={4:3}, numbers={4:3}] [L7] numbers[j-1] ----- [2018-11-22 23:58:13,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:58:13 BoogieIcfgContainer [2018-11-22 23:58:13,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:58:13,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:58:13,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:58:13,353 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:58:13,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:58:13" (3/4) ... [2018-11-22 23:58:13,354 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=2, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~numbers~0.base, ~numbers~0.offset;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~array_size~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~array_size~0=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call bubbleSort(~numbers~0.base, ~numbers~0.offset, ~array_size~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] ~numbers.base, ~numbers.offset := #in~numbers.base, #in~numbers.offset;~array_size := #in~array_size;havoc ~i~0;havoc ~j~0;havoc ~temp~0;~i~0 := ~array_size - 1; VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] assume !!(~i~0 >= 0);~j~0 := 1; VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~j~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] assume !!(~j~0 <= ~i~0); VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~j~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] assume !(1 == #valid[~numbers.base]); VAL [bubbleSort_~array_size=2, bubbleSort_~i~0=1, bubbleSort_~j~0=1, bubbleSort_~numbers.base=4, bubbleSort_~numbers.offset=3, |#NULL.base|=0, |#NULL.offset|=0, |bubbleSort_#in~array_size|=2, |bubbleSort_#in~numbers.base|=4, |bubbleSort_#in~numbers.offset|=3] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L16] havoc ~numbers~0.base, ~numbers~0.offset; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0.base, ~numbers~0.offset, ~array_size~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0] [L2-L14] ~numbers.base, ~numbers.offset := #in~numbers.base, #in~numbers.offset; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~numbers.base=4, ~numbers.offset=3] [L5-L13] assume !!(~i~0 >= 0); [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L6-L12] assume !!(~j~0 <= ~i~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L7] call #t~mem2 := read~int(~numbers.base, ~numbers.offset + 4 * (~j~0 - 1), 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L16] havoc ~numbers~0.base, ~numbers~0.offset; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0.base, ~numbers~0.offset, ~array_size~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0] [L2-L14] ~numbers.base, ~numbers.offset := #in~numbers.base, #in~numbers.offset; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~numbers.base=4, ~numbers.offset=3] [L5-L13] assume !!(~i~0 >= 0); [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L6-L12] assume !!(~j~0 <= ~i~0); VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [L7] call #t~mem2 := read~int(~numbers.base, ~numbers.offset + 4 * (~j~0 - 1), 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers.base=4, #in~numbers.offset=3, #NULL.base=0, #NULL.offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers.base=4, ~numbers.offset=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L16] havoc ~numbers~0; [L17] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L17] ~array_size~0 := #t~nondet6; [L17] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L18] CALL call bubbleSort(~numbers~0, ~array_size~0); VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0] [L2-L14] ~numbers := #in~numbers; [L2-L14] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~j~0; [L4] havoc ~temp~0; [L5] ~i~0 := ~array_size - 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~numbers!base=4, ~numbers!offset=3] [L5-L13] COND FALSE !(!(~i~0 >= 0)) [L6] ~j~0 := 1; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L6-L12] COND FALSE !(!(~j~0 <= ~i~0)) VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L7] FCALL call #t~mem2 := read~int({ base: ~numbers!base, offset: ~numbers!offset + 4 * (~j~0 - 1) }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~array_size=2, #in~numbers!base=4, #in~numbers!offset=3, #NULL!base=0, #NULL!offset=0, ~array_size=2, ~i~0=1, ~j~0=1, ~numbers!base=4, ~numbers!offset=3] [L16] int* numbers; [L17] int array_size = __VERIFIER_nondet_int(); [L18] CALL bubbleSort(numbers, array_size) VAL [\old(array_size)=2, numbers={4:3}] [L4] int i, j, temp; [L5] i = (array_size - 1) VAL [\old(array_size)=2, array_size=2, i=1, numbers={4:3}, numbers={4:3}] [L5] COND TRUE i >= 0 [L6] j = 1 VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={4:3}, numbers={4:3}] [L6] COND TRUE j <= i VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={4:3}, numbers={4:3}] [L7] numbers[j-1] ----- [2018-11-22 23:58:13,386 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2fcac0d8-cf22-467e-acf4-7a774bb87129/bin-2019/utaipan/witness.graphml [2018-11-22 23:58:13,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:58:13,387 INFO L168 Benchmark]: Toolchain (without parser) took 619.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:58:13,388 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:58:13,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.97 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:58:13,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.80 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:58:13,389 INFO L168 Benchmark]: Boogie Preprocessor took 14.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:58:13,390 INFO L168 Benchmark]: RCFGBuilder took 205.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:58:13,390 INFO L168 Benchmark]: TraceAbstraction took 187.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:58:13,390 INFO L168 Benchmark]: Witness Printer took 34.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:58:13,392 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.97 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.80 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 187.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Witness Printer took 34.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L16] int* numbers; [L17] int array_size = __VERIFIER_nondet_int(); [L18] CALL bubbleSort(numbers, array_size) VAL [\old(array_size)=2, numbers={4:3}] [L4] int i, j, temp; [L5] i = (array_size - 1) VAL [\old(array_size)=2, array_size=2, i=1, numbers={4:3}, numbers={4:3}] [L5] COND TRUE i >= 0 [L6] j = 1 VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={4:3}, numbers={4:3}] [L6] COND TRUE j <= i VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={4:3}, numbers={4:3}] [L7] numbers[j-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 13 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...