./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c --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_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/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 1b1751fe95f9cf655681429038c1cde9e9c074e8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-23 03:17:44,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:17:44,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:17:44,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:17:44,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:17:44,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:17:44,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:17:44,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:17:44,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:17:44,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:17:44,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:17:44,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:17:44,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:17:44,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:17:44,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:17:44,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:17:44,827 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:17:44,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:17:44,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:17:44,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:17:44,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:17:44,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:17:44,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:17:44,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:17:44,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:17:44,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:17:44,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:17:44,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:17:44,836 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:17:44,837 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:17:44,837 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:17:44,838 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:17:44,838 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:17:44,838 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:17:44,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:17:44,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:17:44,840 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 03:17:44,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:17:44,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:17:44,851 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:17:44,852 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:17:44,852 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 03:17:44,852 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 03:17:44,852 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 03:17:44,852 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 03:17:44,852 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 03:17:44,852 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 03:17:44,853 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 03:17:44,853 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 03:17:44,853 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 03:17:44,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:17:44,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:17:44,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:17:44,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:17:44,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:17:44,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:17:44,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:17:44,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:17:44,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 03:17:44,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 03:17:44,855 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 03:17:44,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:17:44,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:17:44,855 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:17:44,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:17:44,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:17:44,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:17:44,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:17:44,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:17:44,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:17:44,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:17:44,856 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 03:17:44,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:17:44,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:17:44,857 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_99cdf030-dcbb-4e0c-9479-756b3b63379f/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 -> 1b1751fe95f9cf655681429038c1cde9e9c074e8 [2018-11-23 03:17:44,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:17:44,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:17:44,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:17:44,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:17:44,897 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:17:44,898 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c [2018-11-23 03:17:44,948 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/data/0098f67fa/298c78e3abdc4923aac2a793278e2c30/FLAGf78100ba6 [2018-11-23 03:17:45,316 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:17:45,316 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c [2018-11-23 03:17:45,323 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/data/0098f67fa/298c78e3abdc4923aac2a793278e2c30/FLAGf78100ba6 [2018-11-23 03:17:45,737 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/data/0098f67fa/298c78e3abdc4923aac2a793278e2c30 [2018-11-23 03:17:45,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:17:45,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:17:45,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:17:45,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:17:45,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:17:45,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45, skipping insertion in model container [2018-11-23 03:17:45,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:17:45,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:17:45,884 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:17:45,891 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:17:45,902 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:17:45,913 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:17:45,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45 WrapperNode [2018-11-23 03:17:45,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:17:45,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:17:45,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:17:45,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:17:45,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:17:45,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:17:45,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:17:45,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:17:45,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... [2018-11-23 03:17:45,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:17:45,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:17:45,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:17:45,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:17:45,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/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-23 03:17:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:17:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:17:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:17:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:17:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:17:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:17:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:17:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:17:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:17:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 03:17:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-23 03:17:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-23 03:17:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:17:46,158 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:17:46,158 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 03:17:46,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:17:46 BoogieIcfgContainer [2018-11-23 03:17:46,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:17:46,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:17:46,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:17:46,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:17:46,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:17:45" (1/3) ... [2018-11-23 03:17:46,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a20b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:17:46, skipping insertion in model container [2018-11-23 03:17:46,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:17:45" (2/3) ... [2018-11-23 03:17:46,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a20b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:17:46, skipping insertion in model container [2018-11-23 03:17:46,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:17:46" (3/3) ... [2018-11-23 03:17:46,163 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers1_false-valid-deref.c [2018-11-23 03:17:46,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:17:46,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 03:17:46,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 03:17:46,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:17:46,211 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 03:17:46,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:17:46,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:17:46,212 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:17:46,212 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:17:46,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:17:46,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:17:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 03:17:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 03:17:46,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:46,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:46,229 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:46,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2018-11-23 03:17:46,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:46,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:46,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:17:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:17:46,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 03:17:46,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:17:46,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:17:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:17:46,375 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-23 03:17:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:46,420 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 03:17:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:17:46,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 03:17:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:46,427 INFO L225 Difference]: With dead ends: 27 [2018-11-23 03:17:46,427 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 03:17:46,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:17:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 03:17:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 03:17:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:17:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 03:17:46,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2018-11-23 03:17:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:46,452 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 03:17:46,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:17:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 03:17:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 03:17:46,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:46,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:46,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:46,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2018-11-23 03:17:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:17:46,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:17:46,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 03:17:46,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:17:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:17:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:17:46,524 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-23 03:17:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:46,542 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 03:17:46,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:17:46,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 03:17:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:46,544 INFO L225 Difference]: With dead ends: 27 [2018-11-23 03:17:46,544 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 03:17:46,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:17:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 03:17:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 03:17:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 03:17:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 03:17:46,548 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2018-11-23 03:17:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:46,549 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 03:17:46,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:17:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 03:17:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:17:46,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:46,550 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:46,550 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:46,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2089391026, now seen corresponding path program 1 times [2018-11-23 03:17:46,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:46,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:17:46,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:17:46,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 03:17:46,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:17:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:17:46,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:17:46,691 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2018-11-23 03:17:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:46,734 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 03:17:46,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:17:46,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 03:17:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:46,735 INFO L225 Difference]: With dead ends: 26 [2018-11-23 03:17:46,735 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 03:17:46,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:17:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 03:17:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 03:17:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:17:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 03:17:46,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2018-11-23 03:17:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:46,738 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 03:17:46,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:17:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 03:17:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 03:17:46,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:46,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:46,739 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:46,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1673858648, now seen corresponding path program 1 times [2018-11-23 03:17:46,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:46,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:46,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:46,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:46,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:46,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:46,782 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-23 03:17:46,783 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [14], [16], [27], [33], [35], [36], [40], [44], [45], [46], [47], [48], [50], [51] [2018-11-23 03:17:46,813 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 03:17:46,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 03:17:46,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 03:17:46,974 INFO L272 AbstractInterpreter]: Visited 17 different actions 36 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 216 root evaluator evaluations with a maximum evaluation depth of 4. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 22 variables. [2018-11-23 03:17:46,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:46,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 03:17:46,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:46,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:46,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:46,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 03:17:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:47,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:47,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 03:17:47,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:47,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:17:47,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:17:47,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:17:47,100 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-11-23 03:17:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:47,139 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 03:17:47,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:17:47,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 03:17:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:47,140 INFO L225 Difference]: With dead ends: 29 [2018-11-23 03:17:47,140 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 03:17:47,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:17:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 03:17:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 03:17:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 03:17:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 03:17:47,144 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2018-11-23 03:17:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:47,144 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 03:17:47,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:17:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 03:17:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:17:47,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:47,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:47,145 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:47,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2027302431, now seen corresponding path program 2 times [2018-11-23 03:17:47,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:47,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:47,184 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:47,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:47,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:47,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:17:47,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 03:17:47,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 03:17:47,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:17:47,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:47,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 03:17:47,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:47,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:17:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:17:47,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:17:47,326 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 6 states. [2018-11-23 03:17:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:47,373 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 03:17:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:17:47,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 03:17:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:47,376 INFO L225 Difference]: With dead ends: 32 [2018-11-23 03:17:47,376 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 03:17:47,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:17:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 03:17:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 03:17:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 03:17:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 03:17:47,379 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-11-23 03:17:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:47,380 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 03:17:47,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:17:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 03:17:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:17:47,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:47,381 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:47,381 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:47,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:47,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383288, now seen corresponding path program 3 times [2018-11-23 03:17:47,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:47,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:17:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:47,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:47,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:47,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:47,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:17:47,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 03:17:47,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:17:47,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:17:47,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 03:17:47,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:47,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:17:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:17:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:17:47,602 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2018-11-23 03:17:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:47,625 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 03:17:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:17:47,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 03:17:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:47,628 INFO L225 Difference]: With dead ends: 35 [2018-11-23 03:17:47,628 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 03:17:47,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:17:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 03:17:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 03:17:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 03:17:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 03:17:47,632 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2018-11-23 03:17:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:47,633 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 03:17:47,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:17:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 03:17:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:17:47,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:47,634 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:47,634 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:47,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash -149204609, now seen corresponding path program 4 times [2018-11-23 03:17:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:17:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:47,701 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:47,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:47,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:47,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:47,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 03:17:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:47,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:47,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 03:17:47,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:47,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:17:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:17:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:47,817 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2018-11-23 03:17:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:47,845 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 03:17:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:17:47,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 03:17:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:47,847 INFO L225 Difference]: With dead ends: 38 [2018-11-23 03:17:47,847 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 03:17:47,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 03:17:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 03:17:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 03:17:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 03:17:47,851 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2018-11-23 03:17:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:47,851 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 03:17:47,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:17:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 03:17:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 03:17:47,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:47,854 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:47,854 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:47,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash -578344216, now seen corresponding path program 5 times [2018-11-23 03:17:47,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:47,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:47,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:47,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:47,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:47,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:17:47,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 03:17:47,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 03:17:47,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:17:47,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:47,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 03:17:48,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:48,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 03:17:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:17:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,046 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 9 states. [2018-11-23 03:17:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:48,069 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 03:17:48,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:17:48,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 03:17:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:48,070 INFO L225 Difference]: With dead ends: 41 [2018-11-23 03:17:48,070 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 03:17:48,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 03:17:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 03:17:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 03:17:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 03:17:48,074 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2018-11-23 03:17:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:48,074 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 03:17:48,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 03:17:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 03:17:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 03:17:48,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:48,075 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:48,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:48,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1041263839, now seen corresponding path program 6 times [2018-11-23 03:17:48,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:48,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:17:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:48,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:48,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:48,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:48,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:17:48,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 03:17:48,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:17:48,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:17:48,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-23 03:17:48,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:48,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 03:17:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:17:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,316 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 10 states. [2018-11-23 03:17:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:48,359 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 03:17:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:17:48,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 03:17:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:48,360 INFO L225 Difference]: With dead ends: 44 [2018-11-23 03:17:48,360 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 03:17:48,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 03:17:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 03:17:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 03:17:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 03:17:48,363 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2018-11-23 03:17:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:48,364 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 03:17:48,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 03:17:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 03:17:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 03:17:48,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:48,365 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:48,365 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:48,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1122227080, now seen corresponding path program 7 times [2018-11-23 03:17:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:48,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:17:48,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:48,442 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:48,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:48,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:48,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:48,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 03:17:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:48,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:48,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-23 03:17:48,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:48,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:17:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:17:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,582 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 11 states. [2018-11-23 03:17:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:48,618 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 03:17:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:17:48,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 03:17:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:48,619 INFO L225 Difference]: With dead ends: 47 [2018-11-23 03:17:48,620 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 03:17:48,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 03:17:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 03:17:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 03:17:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 03:17:48,623 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 35 [2018-11-23 03:17:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:48,623 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 03:17:48,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:17:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 03:17:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 03:17:48,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:48,624 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:48,624 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:48,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash -673480641, now seen corresponding path program 8 times [2018-11-23 03:17:48,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:17:48,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:48,693 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:48,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:48,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:48,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:17:48,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 03:17:48,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 03:17:48,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:17:48,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:48,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-23 03:17:48,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:48,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 03:17:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:17:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,852 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 12 states. [2018-11-23 03:17:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:48,896 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 03:17:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:17:48,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-23 03:17:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:48,899 INFO L225 Difference]: With dead ends: 50 [2018-11-23 03:17:48,899 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 03:17:48,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 03:17:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 03:17:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 03:17:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 03:17:48,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 38 [2018-11-23 03:17:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:48,903 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 03:17:48,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 03:17:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 03:17:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 03:17:48,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:48,904 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:48,904 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:48,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:48,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1510442024, now seen corresponding path program 9 times [2018-11-23 03:17:48,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:48,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:17:48,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:48,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:17:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:48,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 03:17:48,987 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 03:17:48,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 03:17:48,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:17:48,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:17:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:17:49,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 03:17:49,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:17:49,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:17:49,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:17:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:49,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 03:17:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:17:49,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 03:17:49,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 03:17:49,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 03:17:49,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 03:17:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 03:17:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:49,145 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 13 states. [2018-11-23 03:17:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:17:49,174 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 03:17:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 03:17:49,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-23 03:17:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:17:49,175 INFO L225 Difference]: With dead ends: 51 [2018-11-23 03:17:49,175 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 03:17:49,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:17:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 03:17:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 03:17:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 03:17:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 03:17:49,177 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 41 [2018-11-23 03:17:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:17:49,177 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 03:17:49,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 03:17:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 03:17:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 03:17:49,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:17:49,178 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:17:49,178 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 03:17:49,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:17:49,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1709012065, now seen corresponding path program 10 times [2018-11-23 03:17:49,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:17:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:49,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:17:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:17:49,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:17:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:17:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:17:49,232 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=105, |#NULL.offset|=101, |#t~string5.base|=104, |#t~string5.offset|=102, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string5.base)|=104, |old(#t~string5.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string5.base, #t~string5.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string5.base)|=104, |old(#t~string5.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string5.base)|=104, |old(#t~string5.offset)|=102] [?] RET #47#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] CALL call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#res.base|=103, |getNumbers_#res.offset|=0] [?] assume true; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#res.base|=103, |getNumbers_#res.offset|=0] [?] RET #51#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |main_#t~ret2.base|=103, |main_#t~ret2.offset|=0] [?] ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; VAL [main_~i~1=0, main_~numbers~0.base=103, main_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] assume !!(~i~1 < 10);havoc #t~nondet4; VAL [main_~i~1=0, main_~numbers~0.base=103, main_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] assume !(1 == #valid[~numbers~0.base]); VAL [main_~i~1=0, main_~numbers~0.base=103, main_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string5.base=104, #t~string5.offset=102, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L22] call #t~string5.base, #t~string5.offset := #Ultimate.alloc(4); [L22] call write~init~int(37, #t~string5.base, #t~string5.offset, 1); [L22] call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1); [L22] call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1); [L22] call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] CALL call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L8] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(40); [L8] ~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset; [L10] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L14] #res.base, #res.offset := ~array~0.base, ~array~0.offset; [L8] call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset); [L14] havoc #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L6-L15] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L19] RET call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret2.base=103, #t~ret2.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset; [L19] havoc #t~ret2.base, #t~ret2.offset; [L21] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L21-L23] assume !!(~i~1 < 10); [L22] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L22] call #t~mem6 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string5.base=104, #t~string5.offset=102, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L22] call #t~string5.base, #t~string5.offset := #Ultimate.alloc(4); [L22] call write~init~int(37, #t~string5.base, #t~string5.offset, 1); [L22] call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1); [L22] call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1); [L22] call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] CALL call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L8] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(40); [L8] ~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset; [L10] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L14] #res.base, #res.offset := ~array~0.base, ~array~0.offset; [L8] call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset); [L14] havoc #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L6-L15] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L19] RET call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret2.base=103, #t~ret2.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset; [L19] havoc #t~ret2.base, #t~ret2.offset; [L21] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L21-L23] assume !!(~i~1 < 10); [L22] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L22] call #t~mem6 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=10] [L10] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=10] [L14] return array; [L19] RET, EXPR getNumbers() VAL [getNumbers()={103:0}] [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={103:0}] [L21] COND TRUE i < 10 [L22] numbers + i ----- [2018-11-23 03:17:49,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:17:49 BoogieIcfgContainer [2018-11-23 03:17:49,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:17:49,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:17:49,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:17:49,311 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:17:49,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:17:46" (3/4) ... [2018-11-23 03:17:49,314 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|=105, |#NULL.offset|=101, |#t~string5.base|=104, |#t~string5.offset|=102, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string5.base)|=104, |old(#t~string5.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string5.base, #t~string5.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string5.base, #t~string5.offset, 1);call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string5.base)|=104, |old(#t~string5.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string5.base)|=104, |old(#t~string5.offset)|=102] [?] RET #47#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] CALL call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(40);~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset;~i~0 := 0; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); srcloc: L11 VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #t~pre1 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre1; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] assume !(~i~0 < 10); VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#t~malloc0.base|=103, |getNumbers_#t~malloc0.offset|=0] [?] #res.base, #res.offset := ~array~0.base, ~array~0.offset;call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset);havoc #t~malloc0.base, #t~malloc0.offset; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#res.base|=103, |getNumbers_#res.offset|=0] [?] assume true; VAL [getNumbers_~array~0.base=103, getNumbers_~array~0.offset=0, getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |getNumbers_#res.base|=103, |getNumbers_#res.offset|=0] [?] RET #51#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0, |main_#t~ret2.base|=103, |main_#t~ret2.offset|=0] [?] ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;~i~1 := 0; VAL [main_~i~1=0, main_~numbers~0.base=103, main_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] assume !!(~i~1 < 10);havoc #t~nondet4; VAL [main_~i~1=0, main_~numbers~0.base=103, main_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] assume !(1 == #valid[~numbers~0.base]); VAL [main_~i~1=0, main_~numbers~0.base=103, main_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string5.base|=106, |#t~string5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string5.base=104, #t~string5.offset=102, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L22] call #t~string5.base, #t~string5.offset := #Ultimate.alloc(4); [L22] call write~init~int(37, #t~string5.base, #t~string5.offset, 1); [L22] call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1); [L22] call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1); [L22] call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] CALL call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L8] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(40); [L8] ~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset; [L10] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L14] #res.base, #res.offset := ~array~0.base, ~array~0.offset; [L8] call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset); [L14] havoc #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L6-L15] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L19] RET call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret2.base=103, #t~ret2.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset; [L19] havoc #t~ret2.base, #t~ret2.offset; [L21] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L21-L23] assume !!(~i~1 < 10); [L22] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L22] call #t~mem6 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string5.base=104, #t~string5.offset=102, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L22] call #t~string5.base, #t~string5.offset := #Ultimate.alloc(4); [L22] call write~init~int(37, #t~string5.base, #t~string5.offset, 1); [L22] call write~init~int(100, #t~string5.base, 1 + #t~string5.offset, 1); [L22] call write~init~int(10, #t~string5.base, 2 + #t~string5.offset, 1); [L22] call write~init~int(0, #t~string5.base, 3 + #t~string5.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string5.base)=104, old(#t~string5.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] CALL call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0] [L8] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(40); [L8] ~array~0.base, ~array~0.offset := #t~malloc0.base, #t~malloc0.offset; [L10] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10-L12] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L11] call write~int(~i~0, ~array~0.base, ~array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=103, #t~malloc0.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L14] #res.base, #res.offset := ~array~0.base, ~array~0.offset; [L8] call ULTIMATE.dealloc(#t~malloc0.base, #t~malloc0.offset); [L14] havoc #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L6-L15] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=103, #res.offset=0, #t~string5.base=106, #t~string5.offset=0, ~array~0.base=103, ~array~0.offset=0, ~i~0=10] [L19] RET call #t~ret2.base, #t~ret2.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret2.base=103, #t~ret2.offset=0, #t~string5.base=106, #t~string5.offset=0] [L19] ~numbers~0.base, ~numbers~0.offset := #t~ret2.base, #t~ret2.offset; [L19] havoc #t~ret2.base, #t~ret2.offset; [L21] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L21-L23] assume !!(~i~1 < 10); [L22] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [L22] call #t~mem6 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string5.base=106, #t~string5.offset=0, ~i~1=0, ~numbers~0.base=103, ~numbers~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string5!base=104, #t~string5!offset=102, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L22] FCALL call #t~string5 := #Ultimate.alloc(4); [L22] FCALL call write~init~int(37, { base: #t~string5!base, offset: #t~string5!offset }, 1); [L22] FCALL call write~init~int(100, { base: #t~string5!base, offset: 1 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(10, { base: #t~string5!base, offset: 2 + #t~string5!offset }, 1); [L22] FCALL call write~init~int(0, { base: #t~string5!base, offset: 3 + #t~string5!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string5!base)=104, old(#t~string5!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] CALL call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0] [L8] FCALL call #t~malloc0 := #Ultimate.alloc(40); [L8] ~array~0 := #t~malloc0; [L10] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=0] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=1] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=2] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=3] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=4] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=5] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=6] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=7] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=8] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10-L12] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L11] FCALL call write~int(~i~0, { base: ~array~0!base, offset: ~array~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=9] [L10] #t~pre1 := 1 + ~i~0; [L10] ~i~0 := 1 + ~i~0; [L10] havoc #t~pre1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=103, #t~malloc0!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L14] #res := ~array~0; [L8] FCALL call ULTIMATE.dealloc(#t~malloc0); [L14] havoc #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=103, #res!offset=0, #t~string5!base=106, #t~string5!offset=0, ~array~0!base=103, ~array~0!offset=0, ~i~0=10] [L19] RET call #t~ret2 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret2!base=103, #t~ret2!offset=0, #t~string5!base=106, #t~string5!offset=0] [L19] ~numbers~0 := #t~ret2; [L19] havoc #t~ret2; [L21] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L21-L23] COND FALSE !(!(~i~1 < 10)) [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L22] FCALL call #t~mem6 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string5!base=106, #t~string5!offset=0, ~i~1=0, ~numbers~0!base=103, ~numbers~0!offset=0] [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=10] [L10] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=10] [L14] return array; [L19] RET, EXPR getNumbers() VAL [getNumbers()={103:0}] [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={103:0}] [L21] COND TRUE i < 10 [L22] numbers + i ----- [2018-11-23 03:17:49,588 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_99cdf030-dcbb-4e0c-9479-756b3b63379f/bin-2019/utaipan/witness.graphml [2018-11-23 03:17:49,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:17:49,589 INFO L168 Benchmark]: Toolchain (without parser) took 3849.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 958.2 MB in the beginning and 915.9 MB in the end (delta: 42.3 MB). Peak memory consumption was 178.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:17:49,590 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:17:49,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.87 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:17:49,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.47 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:17:49,591 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:17:49,591 INFO L168 Benchmark]: RCFGBuilder took 206.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:17:49,591 INFO L168 Benchmark]: TraceAbstraction took 3151.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 926.0 MB in the end (delta: 193.3 MB). Peak memory consumption was 193.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:17:49,592 INFO L168 Benchmark]: Witness Printer took 277.48 ms. Allocated memory is still 1.2 GB. Free memory was 926.0 MB in the beginning and 915.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:17:49,594 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.87 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.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 16.47 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.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 21.38 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 206.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3151.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 926.0 MB in the end (delta: 193.3 MB). Peak memory consumption was 193.3 MB. Max. memory is 11.5 GB. * Witness Printer took 277.48 ms. Allocated memory is still 1.2 GB. Free memory was 926.0 MB in the beginning and 915.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=0] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=1] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=2] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=3] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=4] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=5] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=6] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=7] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=8] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=9] [L10] ++i VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=10] [L10] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(int))={103:0}, array={103:0}, i=10] [L14] return array; [L19] RET, EXPR getNumbers() VAL [getNumbers()={103:0}] [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={103:0}] [L21] COND TRUE i < 10 [L22] numbers + i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 5 error locations. UNSAFE Result, 3.1s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 124 SDslu, 799 SDs, 0 SdLazy, 279 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 471 SyntacticMatches, 31 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 783 ConstructedInterpolants, 0 QuantifiedInterpolants, 51413 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1170 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 2/1217 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...