./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/scopes2_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_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a06ac35b6270d716926f4cab09091bb160bdd736 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:41:29,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:41:29,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:41:29,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:41:29,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:41:29,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:41:29,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:41:29,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:41:29,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:41:29,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:41:29,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:41:29,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:41:29,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:41:29,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:41:29,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:41:29,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:41:29,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:41:29,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:41:29,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:41:29,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:41:29,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:41:29,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:41:29,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:41:29,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:41:29,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:41:29,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:41:29,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:41:29,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:41:29,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:41:29,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:41:29,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:41:29,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:41:29,265 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:41:29,265 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:41:29,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:41:29,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:41:29,267 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 14:41:29,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:41:29,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:41:29,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:41:29,278 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:41:29,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:41:29,278 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:41:29,278 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:41:29,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:41:29,278 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:41:29,279 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:41:29,280 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:41:29,280 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:41:29,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:41:29,280 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:41:29,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:41:29,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:41:29,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:41:29,280 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 14:41:29,281 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:41:29,281 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_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak 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 -> Kojak 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 -> a06ac35b6270d716926f4cab09091bb160bdd736 [2018-11-23 14:41:29,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:41:29,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:41:29,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:41:29,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:41:29,313 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:41:29,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/../../sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c [2018-11-23 14:41:29,351 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/data/1462e9d18/fcf9418bdfb949d8903c214fa08b737e/FLAG33834760d [2018-11-23 14:41:29,654 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:41:29,654 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c [2018-11-23 14:41:29,658 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/data/1462e9d18/fcf9418bdfb949d8903c214fa08b737e/FLAG33834760d [2018-11-23 14:41:29,669 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/data/1462e9d18/fcf9418bdfb949d8903c214fa08b737e [2018-11-23 14:41:29,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:41:29,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:41:29,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:41:29,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:41:29,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:41:29,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4fa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29, skipping insertion in model container [2018-11-23 14:41:29,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:41:29,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:41:29,801 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:41:29,807 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:41:29,816 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:41:29,826 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:41:29,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29 WrapperNode [2018-11-23 14:41:29,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:41:29,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:41:29,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:41:29,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:41:29,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:41:29,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:41:29,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:41:29,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:41:29,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... [2018-11-23 14:41:29,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:41:29,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:41:29,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:41:29,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:41:29,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 14:41:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:41:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:41:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:41:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:41:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 14:41:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:41:30,176 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:41:30,176 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 14:41:30,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:30 BoogieIcfgContainer [2018-11-23 14:41:30,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:41:30,177 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:41:30,177 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:41:30,186 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:41:30,187 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:30" (1/1) ... [2018-11-23 14:41:30,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:41:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 10 states and 9 transitions. [2018-11-23 14:41:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2018-11-23 14:41:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 14:41:30,219 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:30,356 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string4.base, #t~string4.offset, 1);call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1);main_old_#valid := #valid;havoc main_#res;havoc main_#t~nondet0, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0.base, main_~myPointerA~0.offset, main_~myPointerB~0.base, main_~myPointerB~0.offset, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, main_~sumOfMyNumbers~0;main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0;main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_#t~nondet0;havoc main_#t~nondet0;call main_~#myNumberA~0.base, main_~#myNumberA~0.offset := #Ultimate.alloc(4);call write~init~int(7, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, 4);main_~myPointerA~0.base, main_~myPointerA~0.offset := main_~#myNumberA~0.base, main_~#myNumberA~0.offset;call ULTIMATE.dealloc(main_~#myNumberA~0.base, main_~#myNumberA~0.offset);havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset;ParallelCodeBlock1: assume !(0 != main_#t~nondet0);havoc main_#t~nondet0;}EndParallelCompositioncall main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4);call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4);main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [ULTIMATE.start_main_~myPointerA~0.base=0, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=7, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=5, |#t~string4.offset|=0, |ULTIMATE.start_main_~#myNumberA~0.base|=13, |ULTIMATE.start_main_~#myNumberA~0.offset|=12, |ULTIMATE.start_main_~#myNumberB~0.base|=7, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] assume !(1 == #valid[main_~myPointerA~0.base]); VAL [ULTIMATE.start_main_~myPointerA~0.base=0, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=7, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=5, |#t~string4.offset|=0, |ULTIMATE.start_main_~#myNumberA~0.base|=13, |ULTIMATE.start_main_~#myNumberA~0.offset|=12, |ULTIMATE.start_main_~#myNumberB~0.base|=7, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0.base, main_~myPointerA~0.offset, main_~myPointerB~0.base, main_~myPointerB~0.offset, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L6] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] assume !(0 != main_#t~nondet0); [L8] havoc main_#t~nondet0; [L15] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L16] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] [L18] call main_#t~mem1 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0.base, main_~myPointerA~0.offset, main_~myPointerB~0.base, main_~myPointerB~0.offset, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L6] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] assume !(0 != main_#t~nondet0); [L8] havoc main_#t~nondet0; [L15] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L16] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] [L18] call main_#t~mem1 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0 := { base: 0, offset: 0 }; [L6] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != main_#t~nondet0) [L8] havoc main_#t~nondet0; [L15] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L16] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] [L18] FCALL call main_#t~mem1 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0 := { base: 0, offset: 0 }; [L6] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != main_#t~nondet0) [L8] havoc main_#t~nondet0; [L15] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L16] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] [L18] FCALL call main_#t~mem1 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != #t~nondet0) [L8] havoc #t~nondet0; [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != #t~nondet0) [L8] havoc #t~nondet0; [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] [L5] int *myPointerA = ((void*) 0); [L6] int *myPointerB = ((void*) 0); [L8] COND FALSE !(__VERIFIER_nondet_int()) [L15] int myNumberB = 3; [L16] myPointerB = &myNumberB [L18] \read(*myPointerA) ----- [2018-11-23 14:41:30,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:41:30 ImpRootNode [2018-11-23 14:41:30,381 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:41:30,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:41:30,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:41:30,382 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:41:30,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:30" (3/4) ... [2018-11-23 14:41:30,384 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string4.base, #t~string4.offset, 1);call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1);main_old_#valid := #valid;havoc main_#res;havoc main_#t~nondet0, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0.base, main_~myPointerA~0.offset, main_~myPointerB~0.base, main_~myPointerB~0.offset, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, main_~sumOfMyNumbers~0;main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0;main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_#t~nondet0;havoc main_#t~nondet0;call main_~#myNumberA~0.base, main_~#myNumberA~0.offset := #Ultimate.alloc(4);call write~init~int(7, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, 4);main_~myPointerA~0.base, main_~myPointerA~0.offset := main_~#myNumberA~0.base, main_~#myNumberA~0.offset;call ULTIMATE.dealloc(main_~#myNumberA~0.base, main_~#myNumberA~0.offset);havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset;ParallelCodeBlock1: assume !(0 != main_#t~nondet0);havoc main_#t~nondet0;}EndParallelCompositioncall main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4);call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4);main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [ULTIMATE.start_main_~myPointerA~0.base=0, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=7, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=5, |#t~string4.offset|=0, |ULTIMATE.start_main_~#myNumberA~0.base|=13, |ULTIMATE.start_main_~#myNumberA~0.offset|=12, |ULTIMATE.start_main_~#myNumberB~0.base|=7, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] assume !(1 == #valid[main_~myPointerA~0.base]); VAL [ULTIMATE.start_main_~myPointerA~0.base=0, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=7, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=5, |#t~string4.offset|=0, |ULTIMATE.start_main_~#myNumberA~0.base|=13, |ULTIMATE.start_main_~#myNumberA~0.offset|=12, |ULTIMATE.start_main_~#myNumberB~0.base|=7, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0.base, main_~myPointerA~0.offset, main_~myPointerB~0.base, main_~myPointerB~0.offset, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L6] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] assume !(0 != main_#t~nondet0); [L8] havoc main_#t~nondet0; [L15] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L16] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] [L18] call main_#t~mem1 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0.base, main_~myPointerA~0.offset, main_~myPointerB~0.base, main_~myPointerB~0.offset, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L6] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] assume !(0 != main_#t~nondet0); [L8] havoc main_#t~nondet0; [L15] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L16] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] [L18] call main_#t~mem1 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=5, #t~string4.offset=0, main_~#myNumberA~0.base=13, main_~#myNumberA~0.offset=12, main_~#myNumberB~0.base=7, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=7, main_~myPointerB~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0 := { base: 0, offset: 0 }; [L6] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != main_#t~nondet0) [L8] havoc main_#t~nondet0; [L15] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L16] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] [L18] FCALL call main_#t~mem1 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~#myNumberA~0, main_#t~mem1, main_#t~mem2, main_#t~nondet3, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L5] main_~myPointerA~0 := { base: 0, offset: 0 }; [L6] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != main_#t~nondet0) [L8] havoc main_#t~nondet0; [L15] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L16] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] [L18] FCALL call main_#t~mem1 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0, main_~#myNumberA~0!base=13, main_~#myNumberA~0!offset=12, main_~#myNumberB~0!base=7, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=0, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=7, main_~myPointerB~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != #t~nondet0) [L8] havoc #t~nondet0; [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L8-L13] COND FALSE !(0 != #t~nondet0) [L8] havoc #t~nondet0; [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=5, #t~string4!offset=0] [L5] int *myPointerA = ((void*) 0); [L6] int *myPointerB = ((void*) 0); [L8] COND FALSE !(__VERIFIER_nondet_int()) [L15] int myNumberB = 3; [L16] myPointerB = &myNumberB [L18] \read(*myPointerA) ----- [2018-11-23 14:41:30,413 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1ade8fed-6217-4e65-abe0-362279c72776/bin-2019/ukojak/witness.graphml [2018-11-23 14:41:30,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:41:30,414 INFO L168 Benchmark]: Toolchain (without parser) took 742.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:30,415 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:41:30,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.75 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:30,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.78 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:30,416 INFO L168 Benchmark]: Boogie Preprocessor took 11.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:41:30,417 INFO L168 Benchmark]: RCFGBuilder took 313.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:30,417 INFO L168 Benchmark]: CodeCheck took 204.21 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.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:30,418 INFO L168 Benchmark]: Witness Printer took 32.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:30,421 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 15 locations, 5 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 2 NumberOfCodeBlocks, 2 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L5] int *myPointerA = ((void*) 0); [L6] int *myPointerB = ((void*) 0); [L8] COND FALSE !(__VERIFIER_nondet_int()) [L15] int myNumberB = 3; [L16] myPointerB = &myNumberB [L18] \read(*myPointerA) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.75 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.78 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 313.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * CodeCheck took 204.21 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.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Witness Printer took 32.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...