./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/scopes4_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_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes4_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25981771a012eec333f97d8302486eae22970d9e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:49:16,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:49:16,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:49:16,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:49:16,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:49:16,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:49:16,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:49:16,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:49:16,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:49:16,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:49:16,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:49:16,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:49:16,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:49:16,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:49:16,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:49:16,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:49:16,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:49:16,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:49:16,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:49:16,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:49:16,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:49:16,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:49:17,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:49:17,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:49:17,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:49:17,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:49:17,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:49:17,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:49:17,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:49:17,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:49:17,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:49:17,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:49:17,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:49:17,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:49:17,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:49:17,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:49:17,006 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 03:49:17,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:49:17,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:49:17,015 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:49:17,015 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:49:17,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:49:17,016 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:49:17,016 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:49:17,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:49:17,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:49:17,016 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:49:17,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:49:17,018 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:49:17,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:49:17,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:49:17,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:49:17,018 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:49:17,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:49:17,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:49:17,019 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:49:17,019 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:49:17,019 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:49:17,019 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_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25981771a012eec333f97d8302486eae22970d9e [2018-11-23 03:49:17,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:49:17,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:49:17,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:49:17,052 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:49:17,052 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:49:17,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/scopes4_false-valid-deref.c [2018-11-23 03:49:17,088 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/data/0ef75e794/8cda54f05b2346e7bb4b5b45ba5a783e/FLAGb957a41cb [2018-11-23 03:49:17,425 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:49:17,425 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/sv-benchmarks/c/memsafety-ext3/scopes4_false-valid-deref.c [2018-11-23 03:49:17,429 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/data/0ef75e794/8cda54f05b2346e7bb4b5b45ba5a783e/FLAGb957a41cb [2018-11-23 03:49:17,860 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/data/0ef75e794/8cda54f05b2346e7bb4b5b45ba5a783e [2018-11-23 03:49:17,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:49:17,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 03:49:17,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:49:17,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:49:17,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:49:17,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:17" (1/1) ... [2018-11-23 03:49:17,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12858536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:17, skipping insertion in model container [2018-11-23 03:49:17,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:17" (1/1) ... [2018-11-23 03:49:17,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:49:17,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:49:17,995 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:49:18,002 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:49:18,012 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:49:18,022 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:49:18,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18 WrapperNode [2018-11-23 03:49:18,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:49:18,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:49:18,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:49:18,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:49:18,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... [2018-11-23 03:49:18,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:49:18,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:49:18,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:49:18,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:49:18,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure foo2 [2018-11-23 03:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 03:49:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure foo2 [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:49:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:49:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 03:49:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:49:18,233 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:49:18,234 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:49:18,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:18 BoogieIcfgContainer [2018-11-23 03:49:18,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:49:18,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:49:18,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:49:18,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:49:18,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:49:17" (1/3) ... [2018-11-23 03:49:18,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c419cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:18, skipping insertion in model container [2018-11-23 03:49:18,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:18" (2/3) ... [2018-11-23 03:49:18,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c419cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:18, skipping insertion in model container [2018-11-23 03:49:18,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:18" (3/3) ... [2018-11-23 03:49:18,240 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes4_false-valid-deref.c [2018-11-23 03:49:18,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:49:18,250 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 03:49:18,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 03:49:18,278 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:49:18,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:49:18,279 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 03:49:18,279 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:49:18,279 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:49:18,279 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:49:18,279 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:49:18,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:49:18,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:49:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 03:49:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:49:18,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:49:18,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:49:18,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, foo2Err1REQUIRES_VIOLATION, foo2Err0REQUIRES_VIOLATION]=== [2018-11-23 03:49:18,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1728099290, now seen corresponding path program 1 times [2018-11-23 03:49:18,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:18,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:18,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:49:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:49:18,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:49:18,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:49:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:49:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:49:18,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:49:18,424 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-23 03:49:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:49:18,466 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 03:49:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:49:18,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 03:49:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:49:18,473 INFO L225 Difference]: With dead ends: 27 [2018-11-23 03:49:18,473 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 03:49:18,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:49:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 03:49:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 03:49:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:49:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-11-23 03:49:18,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 10 [2018-11-23 03:49:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:49:18,496 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-11-23 03:49:18,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:49:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-11-23 03:49:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:49:18,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:49:18,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:49:18,497 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, foo2Err1REQUIRES_VIOLATION, foo2Err0REQUIRES_VIOLATION]=== [2018-11-23 03:49:18,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1728099291, now seen corresponding path program 1 times [2018-11-23 03:49:18,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:18,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:49:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:49:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:49:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:49:18,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:49:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:49:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:49:18,550 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 3 states. [2018-11-23 03:49:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:49:18,561 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-11-23 03:49:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:49:18,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 03:49:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:49:18,562 INFO L225 Difference]: With dead ends: 23 [2018-11-23 03:49:18,562 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 03:49:18,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:49:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 03:49:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 03:49:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 03:49:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2018-11-23 03:49:18,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 10 [2018-11-23 03:49:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:49:18,566 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2018-11-23 03:49:18,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:49:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2018-11-23 03:49:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 03:49:18,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:49:18,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:49:18,567 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, foo2Err1REQUIRES_VIOLATION, foo2Err0REQUIRES_VIOLATION]=== [2018-11-23 03:49:18,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 688977249, now seen corresponding path program 1 times [2018-11-23 03:49:18,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:18,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:18,617 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4101, |#NULL.offset|=4098, |#t~string3.base|=4100, |#t~string3.offset|=4097, |old(#NULL.base)|=4101, |old(#NULL.offset)|=4098, |old(#t~string3.base)|=4100, |old(#t~string3.offset)|=4097] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string3.base, #t~string3.offset := #Ultimate.alloc(4);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(10, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 3 + #t~string3.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |old(#NULL.base)|=4101, |old(#NULL.offset)|=4098, |old(#t~string3.base)|=4100, |old(#t~string3.offset)|=4097] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |old(#NULL.base)|=4101, |old(#NULL.offset)|=4098, |old(#t~string3.base)|=4100, |old(#t~string3.offset)|=4097] [?] RET #26#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := foo(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] havoc ~arr~1; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call #t~ret0.base, #t~ret0.offset := foo2(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] call ~#arr~0.base, ~#arr~0.offset := #Ultimate.alloc(4096); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_~#arr~0.base|=4099, |foo2_~#arr~0.offset|=0] [?] SUMMARY for call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); srcloc: L6 VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_~#arr~0.base|=4099, |foo2_~#arr~0.offset|=0] [?] #res.base, #res.offset := ~#arr~0.base, 4 + ~#arr~0.offset;call ULTIMATE.dealloc(~#arr~0.base, ~#arr~0.offset);havoc ~#arr~0.base, ~#arr~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_#res.base|=4099, |foo2_#res.offset|=4] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_#res.base|=4099, |foo2_#res.offset|=4] [?] RET #24#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo_#t~ret0.base|=4099, |foo_#t~ret0.offset|=4] [?] #res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo_#res.base|=4099, |foo_#res.offset|=4] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo_#res.base|=4099, |foo_#res.offset|=4] [?] RET #30#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |main_#t~ret1.base|=4099, |main_#t~ret1.offset|=4] [?] ~a~0.base, ~a~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;havoc #t~nondet2; VAL [main_~a~0.base=4099, main_~a~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] assume !(1 == #valid[~a~0.base]); VAL [main_~a~0.base=4099, main_~a~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4101, #NULL.offset=4098, #t~string3.base=4100, #t~string3.offset=4097, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] call #t~string3.base, #t~string3.offset := #Ultimate.alloc(4); [L18] call write~init~int(37, #t~string3.base, #t~string3.offset, 1); [L18] call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1); [L18] call write~init~int(10, #t~string3.base, 2 + #t~string3.offset, 1); [L18] call write~init~int(0, #t~string3.base, 3 + #t~string3.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L17] CALL call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L12] havoc ~arr~1; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L13] CALL call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L5] call ~#arr~0.base, ~#arr~0.offset := #Ultimate.alloc(4096); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L6] call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L7] #res.base, #res.offset := ~#arr~0.base, 4 + ~#arr~0.offset; [L5] call ULTIMATE.dealloc(~#arr~0.base, ~#arr~0.offset); [L7] havoc ~#arr~0.base, ~#arr~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L3-L8] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] RET call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret0.base=4099, #t~ret0.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; [L13] havoc #t~ret0.base, #t~ret0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L10-L14] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] RET call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=4099, #t~ret1.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] ~a~0.base, ~a~0.offset := #t~ret1.base, #t~ret1.offset; [L17] havoc #t~ret1.base, #t~ret1.offset; [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] [L18] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4101, #NULL.offset=4098, #t~string3.base=4100, #t~string3.offset=4097, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] call #t~string3.base, #t~string3.offset := #Ultimate.alloc(4); [L18] call write~init~int(37, #t~string3.base, #t~string3.offset, 1); [L18] call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1); [L18] call write~init~int(10, #t~string3.base, 2 + #t~string3.offset, 1); [L18] call write~init~int(0, #t~string3.base, 3 + #t~string3.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L17] CALL call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L12] havoc ~arr~1; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L13] CALL call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L5] call ~#arr~0.base, ~#arr~0.offset := #Ultimate.alloc(4096); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L6] call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L7] #res.base, #res.offset := ~#arr~0.base, 4 + ~#arr~0.offset; [L5] call ULTIMATE.dealloc(~#arr~0.base, ~#arr~0.offset); [L7] havoc ~#arr~0.base, ~#arr~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L3-L8] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] RET call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret0.base=4099, #t~ret0.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; [L13] havoc #t~ret0.base, #t~ret0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L10-L14] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] RET call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=4099, #t~ret1.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] ~a~0.base, ~a~0.offset := #t~ret1.base, #t~ret1.offset; [L17] havoc #t~ret1.base, #t~ret1.offset; [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] [L18] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4101, #NULL!offset=4098, #t~string3!base=4100, #t~string3!offset=4097, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] FCALL call #t~string3 := #Ultimate.alloc(4); [L18] FCALL call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1); [L18] FCALL call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(10, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(0, { base: #t~string3!base, offset: 3 + #t~string3!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L17] CALL call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L12] havoc ~arr~1; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L13] CALL call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L5] FCALL call ~#arr~0 := #Ultimate.alloc(4096); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L6] FCALL call write~int(13, { base: ~#arr~0!base, offset: 776 + ~#arr~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L7] #res := { base: ~#arr~0!base, offset: 4 + ~#arr~0!offset }; [L5] FCALL call ULTIMATE.dealloc(~#arr~0); [L7] havoc ~#arr~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] RET call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret0!base=4099, #t~ret0!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] #res := #t~ret0; [L13] havoc #t~ret0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] RET call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=4099, #t~ret1!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] ~a~0 := #t~ret1; [L17] havoc #t~ret1; [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] [L18] FCALL call #t~mem4 := read~int(~a~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4101, #NULL!offset=4098, #t~string3!base=4100, #t~string3!offset=4097, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] FCALL call #t~string3 := #Ultimate.alloc(4); [L18] FCALL call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1); [L18] FCALL call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(10, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(0, { base: #t~string3!base, offset: 3 + #t~string3!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L17] CALL call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L12] havoc ~arr~1; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L13] CALL call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L5] FCALL call ~#arr~0 := #Ultimate.alloc(4096); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L6] FCALL call write~int(13, { base: ~#arr~0!base, offset: 776 + ~#arr~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L7] #res := { base: ~#arr~0!base, offset: 4 + ~#arr~0!offset }; [L5] FCALL call ULTIMATE.dealloc(~#arr~0); [L7] havoc ~#arr~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] RET call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret0!base=4099, #t~ret0!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] #res := #t~ret0; [L13] havoc #t~ret0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] RET call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=4099, #t~ret1!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] ~a~0 := #t~ret1; [L17] havoc #t~ret1; [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] [L18] FCALL call #t~mem4 := read~int(~a~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] [L17] CALL, EXPR foo() [L12] int arr[123]; [L13] CALL, EXPR foo2() [L5] int arr[1024]; VAL [arr={4099:0}] [L6] arr[194] = 13 VAL [arr={4099:0}] [L7] return arr + 1; [L7] return arr + 1; VAL [\result={4099:4}] [L13] RET, EXPR foo2() VAL [foo2()={4099:4}] [L13] return foo2(); [L17] RET, EXPR foo() VAL [foo()={4099:4}] [L17] int *a = foo(); [L18] \read(*a) ----- [2018-11-23 03:49:18,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:49:18 BoogieIcfgContainer [2018-11-23 03:49:18,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:49:18,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:49:18,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:49:18,646 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:49:18,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:18" (3/4) ... [2018-11-23 03:49:18,648 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4101, |#NULL.offset|=4098, |#t~string3.base|=4100, |#t~string3.offset|=4097, |old(#NULL.base)|=4101, |old(#NULL.offset)|=4098, |old(#t~string3.base)|=4100, |old(#t~string3.offset)|=4097] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string3.base, #t~string3.offset := #Ultimate.alloc(4);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(10, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 3 + #t~string3.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |old(#NULL.base)|=4101, |old(#NULL.offset)|=4098, |old(#t~string3.base)|=4100, |old(#t~string3.offset)|=4097] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |old(#NULL.base)|=4101, |old(#NULL.offset)|=4098, |old(#t~string3.base)|=4100, |old(#t~string3.offset)|=4097] [?] RET #26#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := foo(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] havoc ~arr~1; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call #t~ret0.base, #t~ret0.offset := foo2(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] call ~#arr~0.base, ~#arr~0.offset := #Ultimate.alloc(4096); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_~#arr~0.base|=4099, |foo2_~#arr~0.offset|=0] [?] SUMMARY for call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); srcloc: L6 VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_~#arr~0.base|=4099, |foo2_~#arr~0.offset|=0] [?] #res.base, #res.offset := ~#arr~0.base, 4 + ~#arr~0.offset;call ULTIMATE.dealloc(~#arr~0.base, ~#arr~0.offset);havoc ~#arr~0.base, ~#arr~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_#res.base|=4099, |foo2_#res.offset|=4] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo2_#res.base|=4099, |foo2_#res.offset|=4] [?] RET #24#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo_#t~ret0.base|=4099, |foo_#t~ret0.offset|=4] [?] #res.base, #res.offset := #t~ret0.base, #t~ret0.offset;havoc #t~ret0.base, #t~ret0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo_#res.base|=4099, |foo_#res.offset|=4] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |foo_#res.base|=4099, |foo_#res.offset|=4] [?] RET #30#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0, |main_#t~ret1.base|=4099, |main_#t~ret1.offset|=4] [?] ~a~0.base, ~a~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;havoc #t~nondet2; VAL [main_~a~0.base=4099, main_~a~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] assume !(1 == #valid[~a~0.base]); VAL [main_~a~0.base=4099, main_~a~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |#t~string3.base|=4102, |#t~string3.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4101, #NULL.offset=4098, #t~string3.base=4100, #t~string3.offset=4097, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] call #t~string3.base, #t~string3.offset := #Ultimate.alloc(4); [L18] call write~init~int(37, #t~string3.base, #t~string3.offset, 1); [L18] call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1); [L18] call write~init~int(10, #t~string3.base, 2 + #t~string3.offset, 1); [L18] call write~init~int(0, #t~string3.base, 3 + #t~string3.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L17] CALL call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L12] havoc ~arr~1; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L13] CALL call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L5] call ~#arr~0.base, ~#arr~0.offset := #Ultimate.alloc(4096); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L6] call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L7] #res.base, #res.offset := ~#arr~0.base, 4 + ~#arr~0.offset; [L5] call ULTIMATE.dealloc(~#arr~0.base, ~#arr~0.offset); [L7] havoc ~#arr~0.base, ~#arr~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L3-L8] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] RET call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret0.base=4099, #t~ret0.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; [L13] havoc #t~ret0.base, #t~ret0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L10-L14] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] RET call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=4099, #t~ret1.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] ~a~0.base, ~a~0.offset := #t~ret1.base, #t~ret1.offset; [L17] havoc #t~ret1.base, #t~ret1.offset; [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] [L18] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4101, #NULL.offset=4098, #t~string3.base=4100, #t~string3.offset=4097, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] call #t~string3.base, #t~string3.offset := #Ultimate.alloc(4); [L18] call write~init~int(37, #t~string3.base, #t~string3.offset, 1); [L18] call write~init~int(100, #t~string3.base, 1 + #t~string3.offset, 1); [L18] call write~init~int(10, #t~string3.base, 2 + #t~string3.offset, 1); [L18] call write~init~int(0, #t~string3.base, 3 + #t~string3.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, old(#NULL.base)=4101, old(#NULL.offset)=4098, old(#t~string3.base)=4100, old(#t~string3.offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L17] CALL call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L12] havoc ~arr~1; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L13] CALL call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0] [L5] call ~#arr~0.base, ~#arr~0.offset := #Ultimate.alloc(4096); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L6] call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~#arr~0.base=4099, ~#arr~0.offset=0] [L7] #res.base, #res.offset := ~#arr~0.base, 4 + ~#arr~0.offset; [L5] call ULTIMATE.dealloc(~#arr~0.base, ~#arr~0.offset); [L7] havoc ~#arr~0.base, ~#arr~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L3-L8] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] RET call #t~ret0.base, #t~ret0.offset := foo2(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret0.base=4099, #t~ret0.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L13] #res.base, #res.offset := #t~ret0.base, #t~ret0.offset; [L13] havoc #t~ret0.base, #t~ret0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L10-L14] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=4099, #res.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] RET call #t~ret1.base, #t~ret1.offset := foo(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=4099, #t~ret1.offset=4, #t~string3.base=4102, #t~string3.offset=0] [L17] ~a~0.base, ~a~0.offset := #t~ret1.base, #t~ret1.offset; [L17] havoc #t~ret1.base, #t~ret1.offset; [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] [L18] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string3.base=4102, #t~string3.offset=0, ~a~0.base=4099, ~a~0.offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4101, #NULL!offset=4098, #t~string3!base=4100, #t~string3!offset=4097, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] FCALL call #t~string3 := #Ultimate.alloc(4); [L18] FCALL call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1); [L18] FCALL call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(10, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(0, { base: #t~string3!base, offset: 3 + #t~string3!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L17] CALL call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L12] havoc ~arr~1; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L13] CALL call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L5] FCALL call ~#arr~0 := #Ultimate.alloc(4096); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L6] FCALL call write~int(13, { base: ~#arr~0!base, offset: 776 + ~#arr~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L7] #res := { base: ~#arr~0!base, offset: 4 + ~#arr~0!offset }; [L5] FCALL call ULTIMATE.dealloc(~#arr~0); [L7] havoc ~#arr~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] RET call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret0!base=4099, #t~ret0!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] #res := #t~ret0; [L13] havoc #t~ret0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] RET call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=4099, #t~ret1!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] ~a~0 := #t~ret1; [L17] havoc #t~ret1; [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] [L18] FCALL call #t~mem4 := read~int(~a~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4101, #NULL!offset=4098, #t~string3!base=4100, #t~string3!offset=4097, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] FCALL call #t~string3 := #Ultimate.alloc(4); [L18] FCALL call write~init~int(37, { base: #t~string3!base, offset: #t~string3!offset }, 1); [L18] FCALL call write~init~int(100, { base: #t~string3!base, offset: 1 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(10, { base: #t~string3!base, offset: 2 + #t~string3!offset }, 1); [L18] FCALL call write~init~int(0, { base: #t~string3!base, offset: 3 + #t~string3!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, old(#NULL!base)=4101, old(#NULL!offset)=4098, old(#t~string3!base)=4100, old(#t~string3!offset)=4097] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L17] CALL call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L12] havoc ~arr~1; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L13] CALL call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0] [L5] FCALL call ~#arr~0 := #Ultimate.alloc(4096); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L6] FCALL call write~int(13, { base: ~#arr~0!base, offset: 776 + ~#arr~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~#arr~0!base=4099, ~#arr~0!offset=0] [L7] #res := { base: ~#arr~0!base, offset: 4 + ~#arr~0!offset }; [L5] FCALL call ULTIMATE.dealloc(~#arr~0); [L7] havoc ~#arr~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] RET call #t~ret0 := foo2(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret0!base=4099, #t~ret0!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L13] #res := #t~ret0; [L13] havoc #t~ret0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=4099, #res!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] RET call #t~ret1 := foo(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=4099, #t~ret1!offset=4, #t~string3!base=4102, #t~string3!offset=0] [L17] ~a~0 := #t~ret1; [L17] havoc #t~ret1; [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] [L18] FCALL call #t~mem4 := read~int(~a~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string3!base=4102, #t~string3!offset=0, ~a~0!base=4099, ~a~0!offset=4] [L17] CALL, EXPR foo() [L12] int arr[123]; [L13] CALL, EXPR foo2() [L5] int arr[1024]; VAL [arr={4099:0}] [L6] arr[194] = 13 VAL [arr={4099:0}] [L7] return arr + 1; [L7] return arr + 1; VAL [\result={4099:4}] [L13] RET, EXPR foo2() VAL [foo2()={4099:4}] [L13] return foo2(); [L17] RET, EXPR foo() VAL [foo()={4099:4}] [L17] int *a = foo(); [L18] \read(*a) ----- [2018-11-23 03:49:18,681 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_93dd535e-704a-453c-8a46-663932bf3269/bin-2019/uautomizer/witness.graphml [2018-11-23 03:49:18,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:49:18,682 INFO L168 Benchmark]: Toolchain (without parser) took 818.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:49:18,683 INFO L168 Benchmark]: CDTParser took 0.10 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 03:49:18,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:49:18,684 INFO L168 Benchmark]: Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:49:18,685 INFO L168 Benchmark]: RCFGBuilder took 191.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:49:18,685 INFO L168 Benchmark]: TraceAbstraction took 410.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:49:18,686 INFO L168 Benchmark]: Witness Printer took 35.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.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:49:18,688 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 191.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 410.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * Witness Printer took 35.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.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L17] CALL, EXPR foo() [L12] int arr[123]; [L13] CALL, EXPR foo2() [L5] int arr[1024]; VAL [arr={4099:0}] [L6] arr[194] = 13 VAL [arr={4099:0}] [L7] return arr + 1; [L7] return arr + 1; VAL [\result={4099:4}] [L13] RET, EXPR foo2() VAL [foo2()={4099:4}] [L13] return foo2(); [L17] RET, EXPR foo() VAL [foo()={4099:4}] [L17] int *a = foo(); [L18] \read(*a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 5 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 3 SDslu, 33 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...