./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/scopes1_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_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/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 95e3931fe811aa62c0e25f30e6d631683a52857f
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(valid-deref)
--- Real Ultimate output ---
This is Ultimate 0.1.23-aa41828
[2018-11-23 13:32:58,635 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 13:32:58,636 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 13:32:58,642 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 13:32:58,642 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 13:32:58,643 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 13:32:58,644 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 13:32:58,645 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 13:32:58,646 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 13:32:58,647 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 13:32:58,647 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 13:32:58,647 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 13:32:58,648 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 13:32:58,648 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 13:32:58,649 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 13:32:58,649 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 13:32:58,650 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 13:32:58,651 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 13:32:58,652 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 13:32:58,653 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 13:32:58,654 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 13:32:58,655 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 13:32:58,656 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 13:32:58,657 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 13:32:58,657 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 13:32:58,657 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 13:32:58,658 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 13:32:58,659 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 13:32:58,659 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 13:32:58,660 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 13:32:58,660 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 13:32:58,660 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 13:32:58,661 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 13:32:58,661 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 13:32:58,661 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 13:32:58,662 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 13:32:58,662 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2018-11-23 13:32:58,672 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 13:32:58,672 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 13:32:58,672 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 13:32:58,673 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 13:32:58,673 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 13:32:58,673 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 13:32:58,673 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 13:32:58,674 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * Bitprecise bitfields=true
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 13:32:58,674 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 13:32:58,675 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 13:32:58,675 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-23 13:32:58,675 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 13:32:58,675 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_231b0f44-40ef-4d60-9dac-5aa59862cbe3/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 -> 95e3931fe811aa62c0e25f30e6d631683a52857f
[2018-11-23 13:32:58,696 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 13:32:58,704 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 13:32:58,706 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 13:32:58,707 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 13:32:58,707 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 13:32:58,708 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/scopes1_false-valid-deref.c
[2018-11-23 13:32:58,743 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/data/d7cde538f/ca4b79a5276f4d7dac4431a9c3ee21d4/FLAG30df68480
[2018-11-23 13:32:59,166 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 13:32:59,166 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/sv-benchmarks/c/memsafety-ext3/scopes1_false-valid-deref.c
[2018-11-23 13:32:59,170 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/data/d7cde538f/ca4b79a5276f4d7dac4431a9c3ee21d4/FLAG30df68480
[2018-11-23 13:32:59,181 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/data/d7cde538f/ca4b79a5276f4d7dac4431a9c3ee21d4
[2018-11-23 13:32:59,184 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 13:32:59,185 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-11-23 13:32:59,185 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 13:32:59,186 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 13:32:59,188 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 13:32:59,188 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,190 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c93cfda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59, skipping insertion in model container
[2018-11-23 13:32:59,190 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,197 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 13:32:59,209 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 13:32:59,318 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 13:32:59,325 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 13:32:59,334 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 13:32:59,346 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 13:32:59,346 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59 WrapperNode
[2018-11-23 13:32:59,346 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 13:32:59,347 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 13:32:59,347 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 13:32:59,347 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 13:32:59,355 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,355 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,361 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,361 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,365 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,365 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,366 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
[2018-11-23 13:32:59,368 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 13:32:59,368 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 13:32:59,368 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 13:32:59,368 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 13:32:59,369 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 13:32:59,442 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 13:32:59,442 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 13:32:59,443 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure printf
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 13:32:59,443 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2018-11-23 13:32:59,560 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 13:32:59,560 INFO  L280             CfgBuilder]: Removed 0 assue(true) statements.
[2018-11-23 13:32:59,560 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:59 BoogieIcfgContainer
[2018-11-23 13:32:59,560 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 13:32:59,561 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 13:32:59,561 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 13:32:59,564 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 13:32:59,564 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:32:59" (1/3) ...
[2018-11-23 13:32:59,564 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396b3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:32:59, skipping insertion in model container
[2018-11-23 13:32:59,565 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:59" (2/3) ...
[2018-11-23 13:32:59,565 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396b3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:32:59, skipping insertion in model container
[2018-11-23 13:32:59,565 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:59" (3/3) ...
[2018-11-23 13:32:59,567 INFO  L112   eAbstractionObserver]: Analyzing ICFG scopes1_false-valid-deref.c
[2018-11-23 13:32:59,573 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 13:32:59,578 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2018-11-23 13:32:59,588 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2018-11-23 13:32:59,610 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 13:32:59,610 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 13:32:59,610 INFO  L383      AbstractCegarLoop]: Hoare is false
[2018-11-23 13:32:59,610 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 13:32:59,610 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 13:32:59,610 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 13:32:59,611 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 13:32:59,611 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 13:32:59,611 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 13:32:59,619 INFO  L276                IsEmpty]: Start isEmpty. Operand 18 states.
[2018-11-23 13:32:59,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-11-23 13:32:59,625 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 13:32:59,626 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-11-23 13:32:59,627 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]===
[2018-11-23 13:32:59,632 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 13:32:59,632 INFO  L82        PathProgramCache]: Analyzing trace with hash -2123086958, now seen corresponding path program 1 times
[2018-11-23 13:32:59,634 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 13:32:59,634 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 13:32:59,674 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:32:59,674 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 13:32:59,674 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 13:32:59,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 13:32:59,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 13:32:59,735 INFO  L469         BasicCegarLoop]: Counterexample might be feasible
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator
[?]  CALL  call ULTIMATE.init();
     VAL   [|#NULL.base|=106, |#NULL.offset|=102, |#t~string3.base|=105, |#t~string3.offset|=101, |old(#NULL.base)|=106, |old(#NULL.offset)|=102, |old(#t~string3.base)|=105, |old(#t~string3.offset)|=101]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string3.base, #t~string3.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string3.base, #t~string3.offset, 1);call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 2 + #t~string3.offset, 1);
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |old(#NULL.base)|=106, |old(#NULL.offset)|=102, |old(#t~string3.base)|=105, |old(#t~string3.offset)|=101]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |old(#NULL.base)|=106, |old(#NULL.offset)|=102, |old(#t~string3.base)|=105, |old(#t~string3.offset)|=101]
[?]  RET   #16#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0]
[?]  CALL  call #t~ret4 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0]
[?]        ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);havoc ~#myNumberA~0.base, ~#myNumberA~0.offset;call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset;
     VAL   [main_~myPointerA~0.base=104, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0]
[?]        assume !(1 == #valid[~myPointerA~0.base]);
     VAL   [main_~myPointerA~0.base=104, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0]


[?]    CALL  call ULTIMATE.init();
       VAL   [#NULL.base=106, #NULL.offset=102, #t~string3.base=105, #t~string3.offset=101, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          #NULL.base, #NULL.offset := 0, 0;
[?]          #valid := #valid[0 := 0];
[L17]        call #t~string3.base, #t~string3.offset := #Ultimate.alloc(3);
[L17]        call write~init~int(37, #t~string3.base, #t~string3.offset, 1);
[L17]        call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1);
[L17]        call write~init~int(0, #t~string3.base, 2 + #t~string3.offset, 1);
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          ensures true;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]    RET   call ULTIMATE.init();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[?]    CALL  call #t~ret4 := main();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[L4]         ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;
[L5]         ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;
[L8]         call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);
[L8]         call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);
[L9]         ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L8]         call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);
[L8]         havoc ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L13]        call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);
[L13]        call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);
[L14]        ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]
[L16]        call #t~mem0 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4);
[?]          requires 1 == #valid[#ptr.base];
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]    CALL  call ULTIMATE.init();
       VAL   [#NULL.base=106, #NULL.offset=102, #t~string3.base=105, #t~string3.offset=101, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          #NULL.base, #NULL.offset := 0, 0;
[?]          #valid := #valid[0 := 0];
[L17]        call #t~string3.base, #t~string3.offset := #Ultimate.alloc(3);
[L17]        call write~init~int(37, #t~string3.base, #t~string3.offset, 1);
[L17]        call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1);
[L17]        call write~init~int(0, #t~string3.base, 2 + #t~string3.offset, 1);
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          ensures true;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]    RET   call ULTIMATE.init();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[?]    CALL  call #t~ret4 := main();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[L4]         ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;
[L5]         ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;
[L8]         call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);
[L8]         call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);
[L9]         ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L8]         call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);
[L8]         havoc ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L13]        call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);
[L13]        call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);
[L14]        ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]
[L16]        call #t~mem0 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4);
[?]          requires 1 == #valid[#ptr.base];
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]


[?]    CALL   call ULTIMATE.init();
       VAL    [#NULL!base=106, #NULL!offset=102, #t~string3!base=105, #t~string3!offset=101, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]           #NULL := { base: 0, offset: 0 };
[?]           #valid[0] := 0;
[L17]  FCALL  call #t~string3 := #Ultimate.alloc(3);
[L17]  FCALL  call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(0, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1);
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]    RET    call ULTIMATE.init();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[?]    CALL   call #t~ret4 := main();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[L4]          ~myPointerA~0 := { base: 0, offset: 0 };
[L5]          ~myPointerB~0 := { base: 0, offset: 0 };
[L8]   FCALL  call ~#myNumberA~0 := #Ultimate.alloc(4);
[L8]   FCALL  call write~init~int(7, ~#myNumberA~0, 4);
[L9]          ~myPointerA~0 := ~#myNumberA~0;
[L8]   FCALL  call ULTIMATE.dealloc(~#myNumberA~0);
[L8]          havoc ~#myNumberA~0;
[L13]  FCALL  call ~#myNumberB~0 := #Ultimate.alloc(4);
[L13]  FCALL  call write~init~int(3, ~#myNumberB~0, 4);
[L14]         ~myPointerB~0 := ~#myNumberB~0;
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]
[L16]  FCALL  call #t~mem0 := read~int(~myPointerA~0, 4);
[?]           requires 1 == #valid[#ptr.base];
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]    CALL   call ULTIMATE.init();
       VAL    [#NULL!base=106, #NULL!offset=102, #t~string3!base=105, #t~string3!offset=101, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]           #NULL := { base: 0, offset: 0 };
[?]           #valid[0] := 0;
[L17]  FCALL  call #t~string3 := #Ultimate.alloc(3);
[L17]  FCALL  call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(0, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1);
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]    RET    call ULTIMATE.init();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[?]    CALL   call #t~ret4 := main();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[L4]          ~myPointerA~0 := { base: 0, offset: 0 };
[L5]          ~myPointerB~0 := { base: 0, offset: 0 };
[L8]   FCALL  call ~#myNumberA~0 := #Ultimate.alloc(4);
[L8]   FCALL  call write~init~int(7, ~#myNumberA~0, 4);
[L9]          ~myPointerA~0 := ~#myNumberA~0;
[L8]   FCALL  call ULTIMATE.dealloc(~#myNumberA~0);
[L8]          havoc ~#myNumberA~0;
[L13]  FCALL  call ~#myNumberB~0 := #Ultimate.alloc(4);
[L13]  FCALL  call write~init~int(3, ~#myNumberB~0, 4);
[L14]         ~myPointerB~0 := ~#myNumberB~0;
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]
[L16]  FCALL  call #t~mem0 := read~int(~myPointerA~0, 4);
[?]           requires 1 == #valid[#ptr.base];
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]


[L4]         int *myPointerA = ((void*) 0);
[L5]         int *myPointerB = ((void*) 0);
[L8]         int myNumberA = 7;
[L9]         myPointerA = &myNumberA
[L8]         int myNumberA = 7;
[L13]        int myNumberB = 3;
[L14]        myPointerB = &myNumberB
       VAL   [myNumberB={103:0}, myPointerA={104:0}, myPointerB={103:0}]
[L16]        \read(*myPointerA)

-----
[2018-11-23 13:32:59,757 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:32:59 BoogieIcfgContainer
[2018-11-23 13:32:59,757 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 13:32:59,758 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 13:32:59,758 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 13:32:59,758 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 13:32:59,759 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:59" (3/4) ...
[2018-11-23 13:32:59,761 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|=106, |#NULL.offset|=102, |#t~string3.base|=105, |#t~string3.offset|=101, |old(#NULL.base)|=106, |old(#NULL.offset)|=102, |old(#t~string3.base)|=105, |old(#t~string3.offset)|=101]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string3.base, #t~string3.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string3.base, #t~string3.offset, 1);call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 2 + #t~string3.offset, 1);
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |old(#NULL.base)|=106, |old(#NULL.offset)|=102, |old(#t~string3.base)|=105, |old(#t~string3.offset)|=101]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |old(#NULL.base)|=106, |old(#NULL.offset)|=102, |old(#t~string3.base)|=105, |old(#t~string3.offset)|=101]
[?]  RET   #16#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0]
[?]  CALL  call #t~ret4 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0]
[?]        ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);havoc ~#myNumberA~0.base, ~#myNumberA~0.offset;call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset;
     VAL   [main_~myPointerA~0.base=104, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0]
[?]        assume !(1 == #valid[~myPointerA~0.base]);
     VAL   [main_~myPointerA~0.base=104, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=107, |#t~string3.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0]


[?]    CALL  call ULTIMATE.init();
       VAL   [#NULL.base=106, #NULL.offset=102, #t~string3.base=105, #t~string3.offset=101, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          #NULL.base, #NULL.offset := 0, 0;
[?]          #valid := #valid[0 := 0];
[L17]        call #t~string3.base, #t~string3.offset := #Ultimate.alloc(3);
[L17]        call write~init~int(37, #t~string3.base, #t~string3.offset, 1);
[L17]        call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1);
[L17]        call write~init~int(0, #t~string3.base, 2 + #t~string3.offset, 1);
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          ensures true;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]    RET   call ULTIMATE.init();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[?]    CALL  call #t~ret4 := main();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[L4]         ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;
[L5]         ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;
[L8]         call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);
[L8]         call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);
[L9]         ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L8]         call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);
[L8]         havoc ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L13]        call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);
[L13]        call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);
[L14]        ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]
[L16]        call #t~mem0 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4);
[?]          requires 1 == #valid[#ptr.base];
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]    CALL  call ULTIMATE.init();
       VAL   [#NULL.base=106, #NULL.offset=102, #t~string3.base=105, #t~string3.offset=101, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          #NULL.base, #NULL.offset := 0, 0;
[?]          #valid := #valid[0 := 0];
[L17]        call #t~string3.base, #t~string3.offset := #Ultimate.alloc(3);
[L17]        call write~init~int(37, #t~string3.base, #t~string3.offset, 1);
[L17]        call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1);
[L17]        call write~init~int(0, #t~string3.base, 2 + #t~string3.offset, 1);
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]          ensures true;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, old(#NULL.base)=106, old(#NULL.offset)=102, old(#t~string3.base)=105, old(#t~string3.offset)=101]
[?]    RET   call ULTIMATE.init();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[?]    CALL  call #t~ret4 := main();
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0]
[L4]         ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;
[L5]         ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;
[L8]         call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);
[L8]         call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);
[L9]         ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L8]         call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);
[L8]         havoc ~#myNumberA~0.base, ~#myNumberA~0.offset;
[L13]        call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);
[L13]        call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);
[L14]        ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset;
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]
[L16]        call #t~mem0 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4);
[?]          requires 1 == #valid[#ptr.base];
       VAL   [#NULL.base=0, #NULL.offset=0, #t~string3.base=107, #t~string3.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=104, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0]


[?]    CALL   call ULTIMATE.init();
       VAL    [#NULL!base=106, #NULL!offset=102, #t~string3!base=105, #t~string3!offset=101, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]           #NULL := { base: 0, offset: 0 };
[?]           #valid[0] := 0;
[L17]  FCALL  call #t~string3 := #Ultimate.alloc(3);
[L17]  FCALL  call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(0, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1);
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]    RET    call ULTIMATE.init();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[?]    CALL   call #t~ret4 := main();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[L4]          ~myPointerA~0 := { base: 0, offset: 0 };
[L5]          ~myPointerB~0 := { base: 0, offset: 0 };
[L8]   FCALL  call ~#myNumberA~0 := #Ultimate.alloc(4);
[L8]   FCALL  call write~init~int(7, ~#myNumberA~0, 4);
[L9]          ~myPointerA~0 := ~#myNumberA~0;
[L8]   FCALL  call ULTIMATE.dealloc(~#myNumberA~0);
[L8]          havoc ~#myNumberA~0;
[L13]  FCALL  call ~#myNumberB~0 := #Ultimate.alloc(4);
[L13]  FCALL  call write~init~int(3, ~#myNumberB~0, 4);
[L14]         ~myPointerB~0 := ~#myNumberB~0;
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]
[L16]  FCALL  call #t~mem0 := read~int(~myPointerA~0, 4);
[?]           requires 1 == #valid[#ptr.base];
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]    CALL   call ULTIMATE.init();
       VAL    [#NULL!base=106, #NULL!offset=102, #t~string3!base=105, #t~string3!offset=101, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]           #NULL := { base: 0, offset: 0 };
[?]           #valid[0] := 0;
[L17]  FCALL  call #t~string3 := #Ultimate.alloc(3);
[L17]  FCALL  call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1);
[L17]  FCALL  call write~init~int(0, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1);
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, old(#NULL!base)=106, old(#NULL!offset)=102, old(#t~string3!base)=105, old(#t~string3!offset)=101]
[?]    RET    call ULTIMATE.init();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[?]    CALL   call #t~ret4 := main();
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0]
[L4]          ~myPointerA~0 := { base: 0, offset: 0 };
[L5]          ~myPointerB~0 := { base: 0, offset: 0 };
[L8]   FCALL  call ~#myNumberA~0 := #Ultimate.alloc(4);
[L8]   FCALL  call write~init~int(7, ~#myNumberA~0, 4);
[L9]          ~myPointerA~0 := ~#myNumberA~0;
[L8]   FCALL  call ULTIMATE.dealloc(~#myNumberA~0);
[L8]          havoc ~#myNumberA~0;
[L13]  FCALL  call ~#myNumberB~0 := #Ultimate.alloc(4);
[L13]  FCALL  call write~init~int(3, ~#myNumberB~0, 4);
[L14]         ~myPointerB~0 := ~#myNumberB~0;
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]
[L16]  FCALL  call #t~mem0 := read~int(~myPointerA~0, 4);
[?]           requires 1 == #valid[#ptr.base];
       VAL    [#NULL!base=0, #NULL!offset=0, #t~string3!base=107, #t~string3!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=104, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0]


[L4]         int *myPointerA = ((void*) 0);
[L5]         int *myPointerB = ((void*) 0);
[L8]         int myNumberA = 7;
[L9]         myPointerA = &myNumberA
[L8]         int myNumberA = 7;
[L13]        int myNumberB = 3;
[L14]        myPointerB = &myNumberB
       VAL   [myNumberB={103:0}, myPointerA={104:0}, myPointerB={103:0}]
[L16]        \read(*myPointerA)

-----
[2018-11-23 13:32:59,793 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_231b0f44-40ef-4d60-9dac-5aa59862cbe3/bin-2019/uautomizer/witness.graphml
[2018-11-23 13:32:59,793 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 13:32:59,794 INFO  L168              Benchmark]: Toolchain (without parser) took 609.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,795 INFO  L168              Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,795 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 161.08 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,796 INFO  L168              Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,796 INFO  L168              Benchmark]: RCFGBuilder took 192.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,797 INFO  L168              Benchmark]: TraceAbstraction took 196.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,797 INFO  L168              Benchmark]: Witness Printer took 35.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB.
[2018-11-23 13:32:59,800 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 161.08 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 192.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 196.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB.
 * Witness Printer took 35.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 16]: pointer dereference may fail
    pointer dereference may fail
We found a FailurePath: 
[L4]         int *myPointerA = ((void*) 0);
[L5]         int *myPointerB = ((void*) 0);
[L8]         int myNumberA = 7;
[L9]         myPointerA = &myNumberA
[L8]         int myNumberA = 7;
[L13]        int myNumberB = 3;
[L14]        myPointerB = &myNumberB
       VAL   [myNumberB={103:0}, myPointerA={104:0}, myPointerB={103:0}]
[L16]        \read(*myPointerA)

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 18 locations, 5 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...