./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_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/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 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 05:19:52,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:19:52,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:19:52,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:19:52,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:19:52,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:19:52,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:19:52,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:19:52,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:19:52,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:19:52,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:19:52,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:19:52,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:19:52,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:19:52,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:19:52,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:19:52,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:19:52,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:19:52,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:19:52,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:19:52,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:19:52,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:19:52,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:19:52,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:19:52,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:19:52,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:19:52,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:19:52,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:19:52,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:19:52,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:19:52,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:19:52,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:19:52,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:19:52,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:19:52,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:19:52,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:19:52,097 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 05:19:52,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:19:52,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:19:52,110 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:19:52,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:19:52,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:19:52,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:19:52,111 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:19:52,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:19:52,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:19:52,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:19:52,112 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 05:19:52,112 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 05:19:52,112 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 05:19:52,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:19:52,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:19:52,113 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:19:52,113 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:19:52,113 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:19:52,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:19:52,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:19:52,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:19:52,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:19:52,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:19:52,114 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 05:19:52,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:19:52,114 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_ef19eb7e-1842-4e43-b567-046cee6d10df/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 -> 95e3931fe811aa62c0e25f30e6d631683a52857f [2018-11-23 05:19:52,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:19:52,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:19:52,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:19:52,153 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:19:52,153 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:19:52,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/../../sv-benchmarks/c/memsafety-ext3/scopes1_false-valid-deref.c [2018-11-23 05:19:52,197 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/data/2039ebc3d/6da75529130343b99e6e19f8b85ac34e/FLAG50443f428 [2018-11-23 05:19:52,529 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:19:52,529 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/sv-benchmarks/c/memsafety-ext3/scopes1_false-valid-deref.c [2018-11-23 05:19:52,534 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/data/2039ebc3d/6da75529130343b99e6e19f8b85ac34e/FLAG50443f428 [2018-11-23 05:19:52,960 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/data/2039ebc3d/6da75529130343b99e6e19f8b85ac34e [2018-11-23 05:19:52,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:19:52,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:19:52,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:19:52,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:19:52,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:19:52,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:19:52" (1/1) ... [2018-11-23 05:19:52,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef06843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:52, skipping insertion in model container [2018-11-23 05:19:52,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:19:52" (1/1) ... [2018-11-23 05:19:52,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:19:52,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:19:53,089 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:19:53,096 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:19:53,106 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:19:53,115 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:19:53,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53 WrapperNode [2018-11-23 05:19:53,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:19:53,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:19:53,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:19:53,116 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:19:53,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:19:53,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:19:53,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:19:53,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:19:53,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:19:53,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:19:53,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:19:53,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:19:53,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:19:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/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 05:19:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:19:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:19:53,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:19:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:19:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 05:19:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:19:53,377 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:19:53,377 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 05:19:53,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:19:53 BoogieIcfgContainer [2018-11-23 05:19:53,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:19:53,378 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:19:53,378 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:19:53,388 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:19:53,388 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:19:53" (1/1) ... [2018-11-23 05:19:53,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:19:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:19:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 10 states and 9 transitions. [2018-11-23 05:19:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2018-11-23 05:19:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 05:19:53,432 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:19:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:53,579 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~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);main_old_#valid := #valid;havoc main_#res;havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem0, main_#t~mem1, main_#t~nondet2, 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;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;call 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=5, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=6, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=8, |#t~string3.offset|=0, |ULTIMATE.start_main_~#myNumberB~0.base|=6, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] assume !(1 == #valid[main_~myPointerA~0.base]); VAL [ULTIMATE.start_main_~myPointerA~0.base=5, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=6, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=8, |#t~string3.offset|=0, |ULTIMATE.start_main_~#myNumberB~0.base|=6, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem0, main_#t~mem1, main_#t~nondet2, 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; [L4] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L5] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] call main_~#myNumberA~0.base, main_~#myNumberA~0.offset := #Ultimate.alloc(4); [L8] call write~init~int(7, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, 4); [L9] main_~myPointerA~0.base, main_~myPointerA~0.offset := main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L8] call ULTIMATE.dealloc(main_~#myNumberA~0.base, main_~#myNumberA~0.offset); [L8] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L13] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L13] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L14] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] [L16] call main_#t~mem0 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem0, main_#t~mem1, main_#t~nondet2, 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; [L4] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L5] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] call main_~#myNumberA~0.base, main_~#myNumberA~0.offset := #Ultimate.alloc(4); [L8] call write~init~int(7, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, 4); [L9] main_~myPointerA~0.base, main_~myPointerA~0.offset := main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L8] call ULTIMATE.dealloc(main_~#myNumberA~0.base, main_~#myNumberA~0.offset); [L8] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L13] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L13] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L14] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] [L16] call main_#t~mem0 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0, main_#t~mem0, main_#t~mem1, main_#t~nondet2, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L4] main_~myPointerA~0 := { base: 0, offset: 0 }; [L5] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] FCALL call main_~#myNumberA~0 := #Ultimate.alloc(4); [L8] FCALL call write~init~int(7, main_~#myNumberA~0, 4); [L9] main_~myPointerA~0 := main_~#myNumberA~0; [L8] FCALL call ULTIMATE.dealloc(main_~#myNumberA~0); [L8] havoc main_~#myNumberA~0; [L13] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L13] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L14] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] [L16] FCALL call main_#t~mem0 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0, main_#t~mem0, main_#t~mem1, main_#t~nondet2, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L4] main_~myPointerA~0 := { base: 0, offset: 0 }; [L5] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] FCALL call main_~#myNumberA~0 := #Ultimate.alloc(4); [L8] FCALL call write~init~int(7, main_~#myNumberA~0, 4); [L9] main_~myPointerA~0 := main_~#myNumberA~0; [L8] FCALL call ULTIMATE.dealloc(main_~#myNumberA~0); [L8] havoc main_~#myNumberA~0; [L13] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L13] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L14] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] [L16] FCALL call main_#t~mem0 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] [?] #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); [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=8, #t~string3!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=8, #t~string3!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #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); [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=8, #t~string3!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=8, #t~string3!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 [L16] \read(*myPointerA) ----- [2018-11-23 05:19:53,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 05:19:53 ImpRootNode [2018-11-23 05:19:53,602 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 05:19:53,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:19:53,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:19:53,603 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:19:53,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:19:53" (3/4) ... [2018-11-23 05:19:53,605 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~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);main_old_#valid := #valid;havoc main_#res;havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem0, main_#t~mem1, main_#t~nondet2, 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;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;call 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=5, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=6, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=8, |#t~string3.offset|=0, |ULTIMATE.start_main_~#myNumberB~0.base|=6, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] assume !(1 == #valid[main_~myPointerA~0.base]); VAL [ULTIMATE.start_main_~myPointerA~0.base=5, ULTIMATE.start_main_~myPointerA~0.offset=0, ULTIMATE.start_main_~myPointerB~0.base=6, ULTIMATE.start_main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=8, |#t~string3.offset|=0, |ULTIMATE.start_main_~#myNumberB~0.base|=6, |ULTIMATE.start_main_~#myNumberB~0.offset|=0] [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem0, main_#t~mem1, main_#t~nondet2, 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; [L4] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L5] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] call main_~#myNumberA~0.base, main_~#myNumberA~0.offset := #Ultimate.alloc(4); [L8] call write~init~int(7, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, 4); [L9] main_~myPointerA~0.base, main_~myPointerA~0.offset := main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L8] call ULTIMATE.dealloc(main_~#myNumberA~0.base, main_~#myNumberA~0.offset); [L8] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L13] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L13] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L14] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] [L16] call main_#t~mem0 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset, main_#t~mem0, main_#t~mem1, main_#t~nondet2, 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; [L4] main_~myPointerA~0.base, main_~myPointerA~0.offset := 0, 0; [L5] main_~myPointerB~0.base, main_~myPointerB~0.offset := 0, 0; [L8] call main_~#myNumberA~0.base, main_~#myNumberA~0.offset := #Ultimate.alloc(4); [L8] call write~init~int(7, main_~#myNumberA~0.base, main_~#myNumberA~0.offset, 4); [L9] main_~myPointerA~0.base, main_~myPointerA~0.offset := main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L8] call ULTIMATE.dealloc(main_~#myNumberA~0.base, main_~#myNumberA~0.offset); [L8] havoc main_~#myNumberA~0.base, main_~#myNumberA~0.offset; [L13] call main_~#myNumberB~0.base, main_~#myNumberB~0.offset := #Ultimate.alloc(4); [L13] call write~init~int(3, main_~#myNumberB~0.base, main_~#myNumberB~0.offset, 4); [L14] main_~myPointerB~0.base, main_~myPointerB~0.offset := main_~#myNumberB~0.base, main_~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] [L16] call main_#t~mem0 := read~int(main_~myPointerA~0.base, main_~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=8, #t~string3.offset=0, main_~#myNumberB~0.base=6, main_~#myNumberB~0.offset=0, main_~myPointerA~0.base=5, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=6, main_~myPointerB~0.offset=0] [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0, main_#t~mem0, main_#t~mem1, main_#t~nondet2, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L4] main_~myPointerA~0 := { base: 0, offset: 0 }; [L5] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] FCALL call main_~#myNumberA~0 := #Ultimate.alloc(4); [L8] FCALL call write~init~int(7, main_~#myNumberA~0, 4); [L9] main_~myPointerA~0 := main_~#myNumberA~0; [L8] FCALL call ULTIMATE.dealloc(main_~#myNumberA~0); [L8] havoc main_~#myNumberA~0; [L13] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L13] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L14] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] [L16] FCALL call main_#t~mem0 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #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); [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_~#myNumberA~0, main_#t~mem0, main_#t~mem1, main_#t~nondet2, main_~myPointerA~0, main_~myPointerB~0, main_~#myNumberB~0, main_~sumOfMyNumbers~0; [L4] main_~myPointerA~0 := { base: 0, offset: 0 }; [L5] main_~myPointerB~0 := { base: 0, offset: 0 }; [L8] FCALL call main_~#myNumberA~0 := #Ultimate.alloc(4); [L8] FCALL call write~init~int(7, main_~#myNumberA~0, 4); [L9] main_~myPointerA~0 := main_~#myNumberA~0; [L8] FCALL call ULTIMATE.dealloc(main_~#myNumberA~0); [L8] havoc main_~#myNumberA~0; [L13] FCALL call main_~#myNumberB~0 := #Ultimate.alloc(4); [L13] FCALL call write~init~int(3, main_~#myNumberB~0, 4); [L14] main_~myPointerB~0 := main_~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] [L16] FCALL call main_#t~mem0 := read~int(main_~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=8, #t~string3!offset=0, main_~#myNumberB~0!base=6, main_~#myNumberB~0!offset=0, main_~myPointerA~0!base=5, main_~myPointerA~0!offset=0, main_~myPointerB~0!base=6, main_~myPointerB~0!offset=0] [?] #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); [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=8, #t~string3!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=8, #t~string3!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #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); [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=8, #t~string3!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=8, #t~string3!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 [L16] \read(*myPointerA) ----- [2018-11-23 05:19:53,634 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ef19eb7e-1842-4e43-b567-046cee6d10df/bin-2019/ukojak/witness.graphml [2018-11-23 05:19:53,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:19:53,634 INFO L168 Benchmark]: Toolchain (without parser) took 671.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -73.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:19:53,635 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:19:53,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.70 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:53,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.66 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:53,636 INFO L168 Benchmark]: Boogie Preprocessor took 49.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:53,637 INFO L168 Benchmark]: RCFGBuilder took 188.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:53,637 INFO L168 Benchmark]: CodeCheck took 224.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:53,638 INFO L168 Benchmark]: Witness Printer took 31.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:19:53,640 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, 13 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: 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 [L16] \read(*myPointerA) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.70 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.66 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 188.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * CodeCheck took 224.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Witness Printer took 31.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 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...