./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_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_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 e872a0dffbf376eb2d8b1e3516401a8dafe115a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:47:17,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:47:17,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:47:17,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:47:17,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:47:17,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:47:17,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:47:17,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:47:17,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:47:17,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:47:17,218 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:47:17,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:47:17,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:47:17,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:47:17,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:47:17,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:47:17,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:47:17,223 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:47:17,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:47:17,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:47:17,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:47:17,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:47:17,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:47:17,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:47:17,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:47:17,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:47:17,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:47:17,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:47:17,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:47:17,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:47:17,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:47:17,233 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:47:17,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:47:17,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:47:17,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:47:17,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:47:17,235 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 02:47:17,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:47:17,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:47:17,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:47:17,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:47:17,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:47:17,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:47:17,246 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:47:17,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:47:17,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:47:17,248 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:47:17,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:47:17,248 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:47:17,248 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:47:17,248 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:47:17,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:47:17,248 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_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 -> e872a0dffbf376eb2d8b1e3516401a8dafe115a6 [2018-11-23 02:47:17,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:47:17,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:47:17,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:47:17,283 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:47:17,283 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:47:17,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-23 02:47:17,318 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/data/1eb29b43b/65bd24677c2c43d2b5391fe5f8e35105/FLAG615bbfd82 [2018-11-23 02:47:17,708 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:47:17,708 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/sv-benchmarks/c/memsafety-ext3/getNumbers2_false-valid-deref.c [2018-11-23 02:47:17,712 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/data/1eb29b43b/65bd24677c2c43d2b5391fe5f8e35105/FLAG615bbfd82 [2018-11-23 02:47:17,721 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/data/1eb29b43b/65bd24677c2c43d2b5391fe5f8e35105 [2018-11-23 02:47:17,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:47:17,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 02:47:17,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:47:17,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:47:17,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:47:17,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2e941e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17, skipping insertion in model container [2018-11-23 02:47:17,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:47:17,754 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:47:17,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:47:17,878 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:47:17,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:47:17,906 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:47:17,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17 WrapperNode [2018-11-23 02:47:17,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:47:17,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:47:17,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:47:17,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:47:17,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... [2018-11-23 02:47:17,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:47:17,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:47:17,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:47:17,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:47:17,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:47:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:47:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-23 02:47:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-23 02:47:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:47:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:47:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 02:47:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:47:18,152 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:47:18,152 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 02:47:18,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:18 BoogieIcfgContainer [2018-11-23 02:47:18,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:47:18,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:47:18,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:47:18,156 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:47:18,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:47:17" (1/3) ... [2018-11-23 02:47:18,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0c02f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:47:18, skipping insertion in model container [2018-11-23 02:47:18,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:17" (2/3) ... [2018-11-23 02:47:18,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0c02f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:47:18, skipping insertion in model container [2018-11-23 02:47:18,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:18" (3/3) ... [2018-11-23 02:47:18,159 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2_false-valid-deref.c [2018-11-23 02:47:18,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:47:18,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-23 02:47:18,178 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-23 02:47:18,193 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:47:18,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:47:18,194 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 02:47:18,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:47:18,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:47:18,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:47:18,194 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:47:18,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:47:18,194 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:47:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 02:47:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:47:18,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:18,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:18,210 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:18,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash -262167437, now seen corresponding path program 1 times [2018-11-23 02:47:18,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:18,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:18,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:18,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:18,432 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 02:47:18,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:47:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:47:18,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:47:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:47:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:47:18,452 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 5 states. [2018-11-23 02:47:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:18,550 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 02:47:18,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:47:18,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 02:47:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:18,558 INFO L225 Difference]: With dead ends: 43 [2018-11-23 02:47:18,558 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 02:47:18,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:47:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 02:47:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 02:47:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 02:47:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 02:47:18,585 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2018-11-23 02:47:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:18,585 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 02:47:18,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:47:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 02:47:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:47:18,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:18,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:18,586 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:18,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -262167438, now seen corresponding path program 1 times [2018-11-23 02:47:18,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:18,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:18,631 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 02:47:18,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:47:18,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:47:18,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:47:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:47:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:47:18,632 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2018-11-23 02:47:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:18,654 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 02:47:18,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:47:18,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 02:47:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:18,655 INFO L225 Difference]: With dead ends: 37 [2018-11-23 02:47:18,655 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 02:47:18,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:47:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 02:47:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 02:47:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 02:47:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 02:47:18,659 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 10 [2018-11-23 02:47:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:18,660 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 02:47:18,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:47:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 02:47:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:47:18,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:18,660 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:18,661 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:18,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1979581628, now seen corresponding path program 1 times [2018-11-23 02:47:18,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:18,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:18,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:18,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:18,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:18,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 02:47:18,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:18,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:47:18,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 02:47:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:18,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-23 02:47:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:47:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:47:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:47:18,963 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-23 02:47:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:19,102 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 02:47:19,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:47:19,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-23 02:47:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:19,103 INFO L225 Difference]: With dead ends: 41 [2018-11-23 02:47:19,103 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 02:47:19,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:47:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 02:47:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 02:47:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 02:47:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 02:47:19,106 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 13 [2018-11-23 02:47:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:19,106 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 02:47:19,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:47:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 02:47:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:47:19,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:19,107 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:19,108 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:19,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash 974975319, now seen corresponding path program 1 times [2018-11-23 02:47:19,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:19,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:19,153 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 02:47:19,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:19,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:19,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:19,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:19,188 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 02:47:19,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:19,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 02:47:19,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:47:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:47:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:47:19,203 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 7 states. [2018-11-23 02:47:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:19,221 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 02:47:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:47:19,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 02:47:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:19,222 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:47:19,222 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 02:47:19,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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 02:47:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 02:47:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 02:47:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 02:47:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 02:47:19,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 24 [2018-11-23 02:47:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:19,226 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 02:47:19,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:47:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 02:47:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:47:19,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:19,227 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:19,227 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:19,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1645381224, now seen corresponding path program 2 times [2018-11-23 02:47:19,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:19,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:19,282 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 02:47:19,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:19,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:47:19,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 02:47:19,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:19,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:19,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 02:47:19,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:19,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 02:47:19,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 02:47:19,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:47:19,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:47:19,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:9, output treesize:21 [2018-11-23 02:47:19,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:19,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:19,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 02:47:19,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:19,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:19,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:19,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:19,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 02:47:19,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 02:47:19,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:47:19,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:54 [2018-11-23 02:47:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 02:47:19,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:47:19,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-11-23 02:47:19,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:47:19,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:47:19,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:47:19,488 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 11 states. [2018-11-23 02:47:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:19,712 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 02:47:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:47:19,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 02:47:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:19,713 INFO L225 Difference]: With dead ends: 48 [2018-11-23 02:47:19,713 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:47:19,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:47:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:47:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 02:47:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:47:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 02:47:19,717 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-11-23 02:47:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:19,718 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 02:47:19,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:47:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 02:47:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:47:19,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:19,718 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:19,718 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:19,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2109770680, now seen corresponding path program 1 times [2018-11-23 02:47:19,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:19,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:19,773 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 02:47:19,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:19,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:19,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:19,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:19,837 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 02:47:19,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 02:47:19,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:47:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:47:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:47:19,854 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 9 states. [2018-11-23 02:47:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:19,886 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 02:47:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:47:19,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 02:47:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:19,888 INFO L225 Difference]: With dead ends: 51 [2018-11-23 02:47:19,888 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 02:47:19,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 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 02:47:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 02:47:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 02:47:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 02:47:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 02:47:19,894 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2018-11-23 02:47:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:19,894 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 02:47:19,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:47:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 02:47:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:47:19,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:19,895 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:19,897 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:19,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1648603127, now seen corresponding path program 2 times [2018-11-23 02:47:19,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:19,995 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 02:47:19,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:19,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:47:20,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 02:47:20,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:20,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:20,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 02:47:20,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 02:47:20,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 02:47:20,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 02:47:20,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:47:20,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:47:20,071 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:37 [2018-11-23 02:47:20,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-11-23 02:47:20,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-11-23 02:47:20,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-23 02:47:20,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:47:20,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-23 02:47:20,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 02:47:20,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:50 [2018-11-23 02:47:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 02:47:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:47:20,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2018-11-23 02:47:20,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:47:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:47:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:47:20,268 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 14 states. [2018-11-23 02:47:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:20,570 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 02:47:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:47:20,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 02:47:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:20,571 INFO L225 Difference]: With dead ends: 54 [2018-11-23 02:47:20,571 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 02:47:20,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:47:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 02:47:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 02:47:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 02:47:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-23 02:47:20,574 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 33 [2018-11-23 02:47:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:20,575 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-23 02:47:20,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:47:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 02:47:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:47:20,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:20,575 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:20,576 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:20,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:20,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1833114438, now seen corresponding path program 1 times [2018-11-23 02:47:20,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:20,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:20,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:20,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-23 02:47:20,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:47:20,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:47:20,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:47:20,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:47:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:47:20,601 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 3 states. [2018-11-23 02:47:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:20,614 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 02:47:20,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:47:20,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 02:47:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:20,615 INFO L225 Difference]: With dead ends: 51 [2018-11-23 02:47:20,615 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 02:47:20,616 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 02:47:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 02:47:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 02:47:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 02:47:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 02:47:20,618 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 37 [2018-11-23 02:47:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:20,619 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 02:47:20,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:47:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 02:47:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:47:20,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:20,619 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:20,620 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:20,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1833114437, now seen corresponding path program 1 times [2018-11-23 02:47:20,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:20,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:20,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:20,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:20,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:20,683 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 02:47:20,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:20,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:20,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:20,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:20,725 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 02:47:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:20,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 02:47:20,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:47:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:47:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:47:20,744 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 11 states. [2018-11-23 02:47:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:20,766 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 02:47:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:47:20,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 02:47:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:20,767 INFO L225 Difference]: With dead ends: 56 [2018-11-23 02:47:20,767 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 02:47:20,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 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 02:47:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 02:47:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 02:47:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 02:47:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 02:47:20,769 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 37 [2018-11-23 02:47:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:20,769 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 02:47:20,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:47:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 02:47:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:47:20,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:20,770 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:20,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:20,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash -688139446, now seen corresponding path program 2 times [2018-11-23 02:47:20,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:20,839 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 02:47:20,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:20,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:20,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:47:20,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 02:47:20,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:20,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:20,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 02:47:20,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:47:20,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 02:47:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 02:47:20,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:47:20,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2018-11-23 02:47:20,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:47:20,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:47:20,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:47:20,934 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 13 states. [2018-11-23 02:47:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:20,995 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 02:47:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:47:20,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 02:47:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:20,996 INFO L225 Difference]: With dead ends: 58 [2018-11-23 02:47:20,996 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 02:47:20,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:47:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 02:47:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 02:47:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 02:47:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 02:47:21,000 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 40 [2018-11-23 02:47:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:21,000 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 02:47:21,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:47:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 02:47:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 02:47:21,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:21,001 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:21,001 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:21,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 71279954, now seen corresponding path program 1 times [2018-11-23 02:47:21,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:21,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:47:21,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:21,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:21,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:21,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:47:21,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:21,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 02:47:21,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:47:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:47:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:47:21,179 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2018-11-23 02:47:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:21,231 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 02:47:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:47:21,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-23 02:47:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:21,233 INFO L225 Difference]: With dead ends: 59 [2018-11-23 02:47:21,233 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 02:47:21,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 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 02:47:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 02:47:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 02:47:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 02:47:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 02:47:21,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2018-11-23 02:47:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:21,239 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 02:47:21,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:47:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 02:47:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 02:47:21,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:21,240 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:21,240 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:21,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 844524961, now seen corresponding path program 2 times [2018-11-23 02:47:21,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:21,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:21,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/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 02:47:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:47:21,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:47:21,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:21,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:21,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 02:47:21,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:47:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:47:21,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:47:21,334 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2018-11-23 02:47:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:21,346 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-23 02:47:21,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:47:21,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-23 02:47:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:21,348 INFO L225 Difference]: With dead ends: 68 [2018-11-23 02:47:21,348 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 02:47:21,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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 02:47:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 02:47:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-11-23 02:47:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 02:47:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 02:47:21,351 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 54 [2018-11-23 02:47:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:21,351 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 02:47:21,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:47:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 02:47:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 02:47:21,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:21,352 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:21,352 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:21,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1486456989, now seen corresponding path program 3 times [2018-11-23 02:47:21,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:21,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:21,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:21,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:47:21,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:47:21,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:21,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:21,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 02:47:21,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:47:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:47:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:47:21,457 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 6 states. [2018-11-23 02:47:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:21,480 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 02:47:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:47:21,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-23 02:47:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:21,481 INFO L225 Difference]: With dead ends: 73 [2018-11-23 02:47:21,481 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 02:47:21,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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 02:47:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 02:47:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-23 02:47:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 02:47:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 02:47:21,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 59 [2018-11-23 02:47:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:21,487 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 02:47:21,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:47:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 02:47:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 02:47:21,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:21,487 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:21,488 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:21,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250463, now seen corresponding path program 4 times [2018-11-23 02:47:21,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:21,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:21,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:21,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:21,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:47:21,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:47:21,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:21,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:21,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 02:47:21,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:47:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:47:21,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:47:21,697 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 7 states. [2018-11-23 02:47:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:21,722 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-23 02:47:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:47:21,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-23 02:47:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:21,723 INFO L225 Difference]: With dead ends: 78 [2018-11-23 02:47:21,723 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 02:47:21,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 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 02:47:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 02:47:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-11-23 02:47:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 02:47:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-23 02:47:21,727 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 64 [2018-11-23 02:47:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:21,727 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-23 02:47:21,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:47:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-23 02:47:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 02:47:21,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:21,728 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:21,728 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:21,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash -368674019, now seen corresponding path program 5 times [2018-11-23 02:47:21,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:21,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:21,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:21,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:21,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:21,788 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:47:21,918 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 02:47:21,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:21,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:21,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:21,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 02:47:21,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:47:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:47:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:47:21,953 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 8 states. [2018-11-23 02:47:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:21,970 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-11-23 02:47:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:47:21,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-11-23 02:47:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:21,970 INFO L225 Difference]: With dead ends: 83 [2018-11-23 02:47:21,970 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 02:47:21,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 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 02:47:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 02:47:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-23 02:47:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 02:47:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-23 02:47:21,972 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-11-23 02:47:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:21,972 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-23 02:47:21,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:47:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-23 02:47:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 02:47:21,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:21,973 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:21,973 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:21,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -243103583, now seen corresponding path program 6 times [2018-11-23 02:47:21,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:21,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:22,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:22,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:47:22,142 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 02:47:22,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:22,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:22,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-23 02:47:22,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 02:47:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:47:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:47:22,247 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 17 states. [2018-11-23 02:47:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:22,307 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-23 02:47:22,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:47:22,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-11-23 02:47:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:22,308 INFO L225 Difference]: With dead ends: 88 [2018-11-23 02:47:22,308 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 02:47:22,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:47:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 02:47:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-11-23 02:47:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 02:47:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-23 02:47:22,311 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 74 [2018-11-23 02:47:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:22,311 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-23 02:47:22,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 02:47:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-23 02:47:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 02:47:22,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:22,312 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:22,312 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:22,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1204178333, now seen corresponding path program 7 times [2018-11-23 02:47:22,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:22,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:22,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:22,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:22,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:22,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:22,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 02:47:22,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:47:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:47:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:47:22,433 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 10 states. [2018-11-23 02:47:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:22,456 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-11-23 02:47:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:47:22,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-11-23 02:47:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:22,458 INFO L225 Difference]: With dead ends: 93 [2018-11-23 02:47:22,458 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 02:47:22,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 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 02:47:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 02:47:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-11-23 02:47:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 02:47:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-23 02:47:22,460 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2018-11-23 02:47:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:22,460 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-23 02:47:22,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:47:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-23 02:47:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 02:47:22,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:22,461 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:22,461 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:22,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2025699807, now seen corresponding path program 8 times [2018-11-23 02:47:22,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:22,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:47:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:22,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:22,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:47:22,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:47:22,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:22,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:22,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 02:47:22,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:47:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:47:22,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:47:22,633 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 11 states. [2018-11-23 02:47:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:22,697 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-23 02:47:22,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:47:22,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-11-23 02:47:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:22,698 INFO L225 Difference]: With dead ends: 98 [2018-11-23 02:47:22,698 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 02:47:22,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 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 02:47:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 02:47:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-11-23 02:47:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 02:47:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-23 02:47:22,701 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-11-23 02:47:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:22,701 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-23 02:47:22,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:47:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-23 02:47:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 02:47:22,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:22,702 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:22,702 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:22,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash -809435107, now seen corresponding path program 9 times [2018-11-23 02:47:22,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:22,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:22,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:47:22,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 02:47:22,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:22,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:22,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:22,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 02:47:22,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:47:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:47:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:47:22,918 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2018-11-23 02:47:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:22,949 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-11-23 02:47:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:47:22,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-11-23 02:47:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:22,950 INFO L225 Difference]: With dead ends: 103 [2018-11-23 02:47:22,950 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 02:47:22,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 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 02:47:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 02:47:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-23 02:47:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 02:47:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-23 02:47:22,952 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 89 [2018-11-23 02:47:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:22,952 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-23 02:47:22,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:47:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-23 02:47:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 02:47:22,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:22,952 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:22,953 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:22,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2070731871, now seen corresponding path program 10 times [2018-11-23 02:47:22,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:23,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:47:23,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:47:23,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:47:23,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:47:23,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:47:23,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:47:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:47:23,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:47:23,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 02:47:23,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:47:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:47:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:47:23,192 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 13 states. [2018-11-23 02:47:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:47:23,236 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-11-23 02:47:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:47:23,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-23 02:47:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:47:23,236 INFO L225 Difference]: With dead ends: 104 [2018-11-23 02:47:23,236 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 02:47:23,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 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 02:47:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 02:47:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 02:47:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 02:47:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-11-23 02:47:23,240 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 94 [2018-11-23 02:47:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:47:23,240 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-11-23 02:47:23,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:47:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-11-23 02:47:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 02:47:23,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:47:23,241 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:47:23,241 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 02:47:23,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:47:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1646357859, now seen corresponding path program 11 times [2018-11-23 02:47:23,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:47:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:47:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:23,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:47:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:47:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:47:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:47:23,369 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=44, |~#array~0.offset|=45] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #59#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~i~0 := 0; VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~0 < 10); VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #57#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~ret1.base|=42, |getNumbers2_#t~ret1.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40);~i~1 := 0; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~1 < 10); VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset;call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset);havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4.base|=46, |main_#t~ret4.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(1 == #valid[~numbers~1.base]); VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] ----- [2018-11-23 02:47:23,472 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-23 02:47:23,472 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 ----- [2018-11-23 02:47:23,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:47:23 BoogieIcfgContainer [2018-11-23 02:47:23,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:47:23,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:47:23,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:47:23,570 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:47:23,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:18" (3/4) ... [2018-11-23 02:47:23,576 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|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=44, |~#array~0.offset|=45] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41, |old(~#array~0.base)|=44, |old(~#array~0.offset)|=45, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #59#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~i~0 := 0; VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=6, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=7, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=8, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~0 < 10); VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); srcloc: L6 VAL [getNumbers_~i~0=9, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre0 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre0; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~0 < 10); VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers_~i~0=10, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers_#res.base|=42, |getNumbers_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #57#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~ret1.base|=42, |getNumbers2_#t~ret1.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40);~i~1 := 0; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=0, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=1, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=1, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=2, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=2, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=3, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=3, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=4, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=4, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=5, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=5, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=6, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=6, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=7, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=7, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=8, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=8, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !!(~i~1 < 10); VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); srcloc: L18 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] SUMMARY for call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); srcloc: L18-1 VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#t~mem3|=9, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] havoc #t~mem3; VAL [getNumbers2_~i~1=9, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #t~pre2 := 1 + ~i~1;~i~1 := 1 + ~i~1;havoc #t~pre2; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(~i~1 < 10); VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_~#numbers2~0.base|=46, |getNumbers2_~#numbers2~0.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset;call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset);havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume true; VAL [getNumbers2_~i~1=10, getNumbers2_~numbers~0.base=42, getNumbers2_~numbers~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getNumbers2_#res.base|=46, |getNumbers2_#res.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4.base|=46, |main_#t~ret4.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] assume !(1 == #valid[~numbers~1.base]); VAL [main_~numbers~1.base=46, main_~numbers~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#array~0.base|=42, |~#array~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=44, ~#array~0.offset=45] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40); [L1] call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 20 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 24 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 28 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 32 + ~#array~0.offset, 4); [L1] call write~init~int(0, ~#array~0.base, 36 + ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41, old(~#array~0.base)=44, old(~#array~0.offset)=45, ~#array~0.base=42, ~#array~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] CALL call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] CALL call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L5] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5-L7] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L6] call write~int(~i~0, ~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L5-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L9] #res.base, #res.offset := ~#array~0.base, ~#array~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L4-L10] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=42, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~0=10] [L13] RET call #t~ret1.base, #t~ret1.offset := getNumbers(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=42, #t~ret1.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L13] ~numbers~0.base, ~numbers~0.offset := #t~ret1.base, #t~ret1.offset; [L13] havoc #t~ret1.base, #t~ret1.offset; [L15] call ~#numbers2~0.base, ~#numbers2~0.offset := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=0, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=1, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=2, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=3, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=3, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=4, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=4, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=5, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=5, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=6, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=6, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=7, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=7, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=8, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=8, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !!(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call #t~mem3 := read~int(~numbers~0.base, ~numbers~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] call write~int(#t~mem3, ~#numbers2~0.base, ~#numbers2~0.offset + 4 * ~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=9, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L18] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=9, ~numbers~0.base=42, ~numbers~0.offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L17-L19] assume !(~i~1 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~#numbers2~0.base=46, ~#numbers2~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L21] #res.base, #res.offset := ~#numbers2~0.base, ~#numbers2~0.offset; [L15] call ULTIMATE.dealloc(~#numbers2~0.base, ~#numbers2~0.offset); [L21] havoc ~#numbers2~0.base, ~#numbers2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L12-L22] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=46, #res.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~i~1=10, ~numbers~0.base=42, ~numbers~0.offset=0] [L25] RET call #t~ret4.base, #t~ret4.offset := getNumbers2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4.base=46, #t~ret4.offset=0, ~#array~0.base=42, ~#array~0.offset=0] [L25] ~numbers~1.base, ~numbers~1.offset := #t~ret4.base, #t~ret4.offset; [L25] havoc #t~ret4.base, #t~ret4.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [L26] call write~int(100, ~numbers~1.base, ~numbers~1.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=42, ~#array~0.offset=0, ~numbers~1.base=46, ~numbers~1.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] ----- [2018-11-23 02:47:23,875 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# [2018-11-23 02:47:23,875 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=44, ~#array~0!offset=45] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] FCALL call ~#array~0 := #Ultimate.alloc(40); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 4 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 8 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 12 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 16 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 20 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 24 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 28 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 32 + ~#array~0!offset }, 4); [L1] FCALL call write~init~int(0, { base: ~#array~0!base, offset: 36 + ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41, old(~#array~0!base)=44, old(~#array~0!offset)=45, ~#array~0!base=42, ~#array~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] CALL call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] CALL call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=0] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=1] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=2] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=3] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=4] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=5] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=6] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=7] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=8] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5-L7] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L6] 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, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=9] [L5] #t~pre0 := 1 + ~i~0; [L5] ~i~0 := 1 + ~i~0; [L5] havoc #t~pre0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L5-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L9] #res := ~#array~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=42, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~0=10] [L13] RET call #t~ret1 := getNumbers(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=42, #t~ret1!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L13] ~numbers~0 := #t~ret1; [L13] havoc #t~ret1; [L15] FCALL call ~#numbers2~0 := #Ultimate.alloc(40); [L17] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=0, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=1, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=2, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=3, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=3, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=4, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=4, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=5, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=5, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=6, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=6, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=7, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=7, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=8, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=8, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND FALSE !(!(~i~1 < 10)) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call #t~mem3 := read~int({ base: ~numbers~0!base, offset: ~numbers~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] FCALL call write~int(#t~mem3, { base: ~#numbers2~0!base, offset: ~#numbers2~0!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=9, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L18] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=9, ~numbers~0!base=42, ~numbers~0!offset=0] [L17] #t~pre2 := 1 + ~i~1; [L17] ~i~1 := 1 + ~i~1; [L17] havoc #t~pre2; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L17-L19] COND TRUE !(~i~1 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~#numbers2~0!base=46, ~#numbers2~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L21] #res := ~#numbers2~0; [L15] FCALL call ULTIMATE.dealloc(~#numbers2~0); [L21] havoc ~#numbers2~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=46, #res!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~i~1=10, ~numbers~0!base=42, ~numbers~0!offset=0] [L25] RET call #t~ret4 := getNumbers2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4!base=46, #t~ret4!offset=0, ~#array~0!base=42, ~#array~0!offset=0] [L25] ~numbers~1 := #t~ret4; [L25] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L26] FCALL call write~int(100, { base: ~numbers~1!base, offset: ~numbers~1!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=42, ~#array~0!offset=0, ~numbers~1!base=46, ~numbers~1!offset=0] [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 ----- [2018-11-23 02:47:24,063 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4d42f98b-6f71-4b4e-a88c-def47ec70d68/bin-2019/uautomizer/witness.graphml [2018-11-23 02:47:24,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:47:24,063 INFO L168 Benchmark]: Toolchain (without parser) took 6340.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 959.8 MB in the beginning and 1.3 GB in the end (delta: -362.2 MB). Peak memory consumption was 401.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:47:24,064 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:47:24,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.26 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:47:24,065 INFO L168 Benchmark]: Boogie Preprocessor took 65.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 947.7 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:47:24,066 INFO L168 Benchmark]: RCFGBuilder took 179.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:47:24,067 INFO L168 Benchmark]: TraceAbstraction took 5416.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 847.6 MB in the end (delta: 297.6 MB). Peak memory consumption was 409.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:47:24,067 INFO L168 Benchmark]: Witness Printer took 492.89 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 45.6 MB). Free memory was 847.6 MB in the beginning and 1.3 GB in the end (delta: -474.4 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:47:24,069 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.26 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 947.7 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5416.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 847.6 MB in the end (delta: 297.6 MB). Peak memory consumption was 409.8 MB. Max. memory is 11.5 GB. * Witness Printer took 492.89 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 45.6 MB). Free memory was 847.6 MB in the beginning and 1.3 GB in the end (delta: -474.4 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 45 could not be translated for associated CType ARRAY#_10_~INT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 44 could not be translated for associated CType ARRAY#_10_~INT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [\old(array)=null, \old(array)=null, array={42:0}] [L25] CALL, EXPR getNumbers2() VAL [array={42:0}] [L13] CALL, EXPR getNumbers() VAL [array={42:0}] [L5] int i = 0; VAL [array={42:0}, i=0] [L5] COND TRUE i < 10 VAL [array={42:0}, i=0] [L6] array[i] = i VAL [array={42:0}, i=0] [L5] ++i VAL [array={42:0}, i=1] [L5] COND TRUE i < 10 VAL [array={42:0}, i=1] [L6] array[i] = i VAL [array={42:0}, i=1] [L5] ++i VAL [array={42:0}, i=2] [L5] COND TRUE i < 10 VAL [array={42:0}, i=2] [L6] array[i] = i VAL [array={42:0}, i=2] [L5] ++i VAL [array={42:0}, i=3] [L5] COND TRUE i < 10 VAL [array={42:0}, i=3] [L6] array[i] = i VAL [array={42:0}, i=3] [L5] ++i VAL [array={42:0}, i=4] [L5] COND TRUE i < 10 VAL [array={42:0}, i=4] [L6] array[i] = i VAL [array={42:0}, i=4] [L5] ++i VAL [array={42:0}, i=5] [L5] COND TRUE i < 10 VAL [array={42:0}, i=5] [L6] array[i] = i VAL [array={42:0}, i=5] [L5] ++i VAL [array={42:0}, i=6] [L5] COND TRUE i < 10 VAL [array={42:0}, i=6] [L6] array[i] = i VAL [array={42:0}, i=6] [L5] ++i VAL [array={42:0}, i=7] [L5] COND TRUE i < 10 VAL [array={42:0}, i=7] [L6] array[i] = i VAL [array={42:0}, i=7] [L5] ++i VAL [array={42:0}, i=8] [L5] COND TRUE i < 10 VAL [array={42:0}, i=8] [L6] array[i] = i VAL [array={42:0}, i=8] [L5] ++i VAL [array={42:0}, i=9] [L5] COND TRUE i < 10 VAL [array={42:0}, i=9] [L6] array[i] = i VAL [array={42:0}, i=9] [L5] ++i VAL [array={42:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={42:0}, i=10] [L9] return array; VAL [\result={42:0}, array={42:0}, i=10] [L13] RET, EXPR getNumbers() VAL [array={42:0}, getNumbers()={42:0}] [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=0, numbers={42:0}, numbers2={46:0}, numbers[i]=0] [L17] ++i VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=1, numbers={42:0}, numbers2={46:0}, numbers[i]=1] [L17] ++i VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=2, numbers={42:0}, numbers2={46:0}, numbers[i]=2] [L17] ++i VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=3, numbers={42:0}, numbers2={46:0}, numbers[i]=3] [L17] ++i VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=4, numbers={42:0}, numbers2={46:0}, numbers[i]=4] [L17] ++i VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=5, numbers={42:0}, numbers2={46:0}, numbers[i]=5] [L17] ++i VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=6, numbers={42:0}, numbers2={46:0}, numbers[i]=6] [L17] ++i VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=7, numbers={42:0}, numbers2={46:0}, numbers[i]=7] [L17] ++i VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=8, numbers={42:0}, numbers2={46:0}, numbers[i]=8] [L17] ++i VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L17] COND TRUE i < 10 VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}] [L18] EXPR numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={42:0}, i=9, numbers={42:0}, numbers2={46:0}, numbers[i]=9] [L17] ++i VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L17] COND FALSE !(i < 10) VAL [array={42:0}, i=10, numbers={42:0}, numbers2={46:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={46:0}, array={42:0}, i=10, numbers={42:0}] [L25] RET, EXPR getNumbers2() VAL [array={42:0}, getNumbers2()={46:0}] [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 9 error locations. UNSAFE Result, 5.3s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 531 SDtfs, 537 SDslu, 2219 SDs, 0 SdLazy, 986 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 908 SyntacticMatches, 3 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=20, 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, 20 MinimizatonAttempts, 46 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1998 NumberOfCodeBlocks, 1914 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1862 ConstructedInterpolants, 4 QuantifiedInterpolants, 277817 SizeOfPredicates, 27 NumberOfNonLiveVariables, 3359 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 2848/4774 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...