./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_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer --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 Automizer --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 13:01:26,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:01:26,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:01:26,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:01:26,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:01:26,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:01:26,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:01:26,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:01:26,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:01:26,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:01:26,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:01:26,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:01:26,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:01:26,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:01:26,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:01:26,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:01:26,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:01:26,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:01:26,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:01:26,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:01:26,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:01:26,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:01:26,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:01:26,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:01:26,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:01:26,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:01:26,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:01:26,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:01:26,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:01:26,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:01:26,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:01:26,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:01:26,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:01:26,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:01:26,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:01:26,860 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:01:26,860 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 13:01:26,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:01:26,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:01:26,870 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:01:26,870 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:01:26,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:01:26,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:01:26,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:01:26,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:01:26,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:26,873 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:01:26,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b1751fe95f9cf655681429038c1cde9e9c074e8 [2018-11-23 13:01:26,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:01:26,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:01:26,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:01:26,907 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:01:26,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:01:26,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c [2018-11-23 13:01:26,943 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/data/12812b072/442f510d6e814a44be47d8dfea711d34/FLAGc828733e7 [2018-11-23 13:01:27,342 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:01:27,342 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/sv-benchmarks/c/memsafety-ext3/getNumbers1_false-valid-deref.c [2018-11-23 13:01:27,346 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/data/12812b072/442f510d6e814a44be47d8dfea711d34/FLAGc828733e7 [2018-11-23 13:01:27,356 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/data/12812b072/442f510d6e814a44be47d8dfea711d34 [2018-11-23 13:01:27,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:01:27,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 13:01:27,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:27,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:01:27,362 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:01:27,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27, skipping insertion in model container [2018-11-23 13:01:27,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:01:27,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:01:27,494 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:27,501 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:01:27,510 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:27,520 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:01:27,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27 WrapperNode [2018-11-23 13:01:27,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:27,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:01:27,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:01:27,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:01:27,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... [2018-11-23 13:01:27,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:01:27,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:01:27,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:01:27,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:01:27,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:01:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:01:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-23 13:01:27,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:01:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-23 13:01:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 13:01:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:01:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:01:27,741 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:01:27,741 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:01:27,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:27 BoogieIcfgContainer [2018-11-23 13:01:27,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:01:27,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:01:27,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:01:27,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:01:27,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:01:27" (1/3) ... [2018-11-23 13:01:27,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fffff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:27, skipping insertion in model container [2018-11-23 13:01:27,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:27" (2/3) ... [2018-11-23 13:01:27,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fffff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:27, skipping insertion in model container [2018-11-23 13:01:27,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:27" (3/3) ... [2018-11-23 13:01:27,747 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers1_false-valid-deref.c [2018-11-23 13:01:27,753 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:01:27,758 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 13:01:27,769 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 13:01:27,790 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:01:27,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:01:27,790 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 13:01:27,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:01:27,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:01:27,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:01:27,791 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:01:27,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:01:27,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:01:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 13:01:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:01:27,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:27,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:27,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:27,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:27,816 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2018-11-23 13:01:27,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:27,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:27,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:27,932 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 13:01:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:27,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:01:27,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:01:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:01:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:01:27,948 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-23 13:01:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:27,993 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 13:01:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:01:27,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 13:01:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,000 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:01:28,000 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:01:28,001 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 13:01:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:01:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:01:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:01:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 13:01:28,023 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2018-11-23 13:01:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,023 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 13:01:28,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:01:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 13:01:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:01:28,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:28,025 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2018-11-23 13:01:28,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,084 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 13:01:28,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:28,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:01:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:01:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:01:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:01:28,086 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-23 13:01:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:28,110 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 13:01:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:01:28,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 13:01:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,111 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:01:28,112 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:01:28,112 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 13:01:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:01:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 13:01:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:01:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 13:01:28,116 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2018-11-23 13:01:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,116 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 13:01:28,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:01:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 13:01:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:01:28,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,117 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:28,117 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2089391026, now seen corresponding path program 1 times [2018-11-23 13:01:28,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:28,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,257 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 13:01:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:01:28,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:01:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:01:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:01:28,258 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2018-11-23 13:01:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:28,312 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 13:01:28,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:01:28,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:01:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,314 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:01:28,314 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:01:28,314 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 13:01:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:01:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 13:01:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:01:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 13:01:28,318 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2018-11-23 13:01:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,318 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 13:01:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:01:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 13:01:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:01:28,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,319 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 13:01:28,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1673858648, now seen corresponding path program 1 times [2018-11-23 13:01:28,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,348 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 13:01:28,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:28,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:28,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:28,401 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 13:01:28,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:28,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:01:28,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:01:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:01:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:01:28,416 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-11-23 13:01:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:28,438 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:01:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:01:28,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:01:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,439 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:01:28,439 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:01:28,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:01:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:01:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 13:01:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:01:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 13:01:28,442 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2018-11-23 13:01:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,442 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 13:01:28,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:01:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 13:01:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:01:28,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,443 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 13:01:28,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2027302431, now seen corresponding path program 2 times [2018-11-23 13:01:28,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,513 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 13:01:28,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:28,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:01:28,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:01:28,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:28,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:28,558 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 13:01:28,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:28,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:01:28,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:01:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:01:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:01:28,575 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 6 states. [2018-11-23 13:01:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:28,598 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 13:01:28,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:01:28,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:01:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,599 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:01:28,599 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:01:28,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:01:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:01:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 13:01:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:01:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 13:01:28,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-11-23 13:01:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,601 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 13:01:28,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:01:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 13:01:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:01:28,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,602 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 13:01:28,602 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383288, now seen corresponding path program 3 times [2018-11-23 13:01:28,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:28,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,663 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 13:01:28,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:28,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:01:28,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:01:28,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:28,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:28,706 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 13:01:28,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:28,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:01:28,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:01:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:01:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:01:28,723 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2018-11-23 13:01:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:28,757 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 13:01:28,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:01:28,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-23 13:01:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,759 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:01:28,759 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:01:28,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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 13:01:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:01:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:01:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:01:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 13:01:28,764 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2018-11-23 13:01:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,764 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 13:01:28,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:01:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 13:01:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:01:28,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,765 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 13:01:28,765 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash -149204609, now seen corresponding path program 4 times [2018-11-23 13:01:28,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,814 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 13:01:28,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:28,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:28,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:01:28,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:01:28,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:28,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:28,876 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 13:01:28,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:28,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:01:28,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:01:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:01:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:28,894 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2018-11-23 13:01:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:28,925 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 13:01:28,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:01:28,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 13:01:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:28,926 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:01:28,926 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:01:28,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:01:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 13:01:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:01:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 13:01:28,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2018-11-23 13:01:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:28,930 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 13:01:28,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:01:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 13:01:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:01:28,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:28,931 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 13:01:28,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:28,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:28,931 INFO L82 PathProgramCache]: Analyzing trace with hash -578344216, now seen corresponding path program 5 times [2018-11-23 13:01:28,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:28,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:28,987 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 13:01:28,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:28,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:28,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:01:29,024 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:01:29,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:29,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:29,039 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 13:01:29,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:29,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:01:29,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:01:29,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:01:29,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:01:29,064 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 9 states. [2018-11-23 13:01:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:29,113 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 13:01:29,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:01:29,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 13:01:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:29,115 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:01:29,115 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:01:29,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 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 13:01:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:01:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 13:01:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:01:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 13:01:29,119 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2018-11-23 13:01:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:29,119 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 13:01:29,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:01:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 13:01:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:01:29,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:29,120 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 13:01:29,120 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:29,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1041263839, now seen corresponding path program 6 times [2018-11-23 13:01:29,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:29,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:29,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:29,231 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 13:01:29,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:29,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:29,241 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:01:29,272 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:01:29,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:29,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:29,282 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 13:01:29,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:29,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:01:29,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:01:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:01:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:01:29,307 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 10 states. [2018-11-23 13:01:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:29,338 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 13:01:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:01:29,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 13:01:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:29,346 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:01:29,346 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:01:29,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:01:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:01:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 13:01:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:01:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 13:01:29,349 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2018-11-23 13:01:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:29,349 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 13:01:29,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:01:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 13:01:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:01:29,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:29,350 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 13:01:29,351 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:29,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1122227080, now seen corresponding path program 7 times [2018-11-23 13:01:29,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:29,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:29,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 13:01:29,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:29,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:29,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:29,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:29,481 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 13:01:29,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:01:29,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:01:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:01:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:01:29,497 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 11 states. [2018-11-23 13:01:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:29,528 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 13:01:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:01:29,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 13:01:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:29,530 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:01:29,530 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 13:01:29,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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 13:01:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 13:01:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 13:01:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:01:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 13:01:29,533 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 35 [2018-11-23 13:01:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:29,534 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 13:01:29,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:01:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 13:01:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:01:29,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:29,535 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 13:01:29,535 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:29,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash -673480641, now seen corresponding path program 8 times [2018-11-23 13:01:29,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:29,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:29,635 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 13:01:29,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:29,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:29,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:01:29,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:01:29,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:29,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:29,674 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 13:01:29,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:01:29,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:01:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:01:29,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:01:29,691 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 12 states. [2018-11-23 13:01:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:29,730 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 13:01:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:01:29,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-23 13:01:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:29,731 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:01:29,731 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:01:29,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:01:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:01:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 13:01:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:01:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 13:01:29,734 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 38 [2018-11-23 13:01:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:29,734 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 13:01:29,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:01:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 13:01:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:01:29,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:29,735 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 13:01:29,735 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:29,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1510442024, now seen corresponding path program 9 times [2018-11-23 13:01:29,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:29,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:29,832 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 13:01:29,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:29,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/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 13:01:29,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:01:29,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:01:29,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:29,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:29,896 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 13:01:29,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:29,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:01:29,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:01:29,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:01:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:01:29,912 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 13 states. [2018-11-23 13:01:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:29,939 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 13:01:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:01:29,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-23 13:01:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:29,940 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:01:29,940 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:01:29,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 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 13:01:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:01:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 13:01:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:01:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 13:01:29,943 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 41 [2018-11-23 13:01:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:29,943 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 13:01:29,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:01:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 13:01:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:01:29,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:29,944 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 13:01:29,944 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION]=== [2018-11-23 13:01:29,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1709012065, now seen corresponding path program 10 times [2018-11-23 13:01:29,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:29,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:29,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:29,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:01:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:01:29,989 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.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 13:01:30,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:01:30 BoogieIcfgContainer [2018-11-23 13:01:30,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:01:30,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:01:30,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:01:30,042 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:01:30,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:27" (3/4) ... [2018-11-23 13:01:30,044 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.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 13:01:30,174 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9391a0ba-c4d2-412f-b85f-45ef5f56e70a/bin-2019/uautomizer/witness.graphml [2018-11-23 13:01:30,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:01:30,175 INFO L168 Benchmark]: Toolchain (without parser) took 2816.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -214.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:01:30,176 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:01:30,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:01:30,176 INFO L168 Benchmark]: Boogie Preprocessor took 56.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -241.8 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:01:30,176 INFO L168 Benchmark]: RCFGBuilder took 163.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:01:30,177 INFO L168 Benchmark]: TraceAbstraction took 2299.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 50.9 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -18.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:01:30,177 INFO L168 Benchmark]: Witness Printer took 132.33 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:01:30,179 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -241.8 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2299.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 50.9 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -18.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 132.33 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.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, 2.2s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 124 SDslu, 932 SDs, 0 SdLazy, 286 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s 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.0s AbstIntTime, 0 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, 0.9s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 34673 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1170 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 2/812 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...