./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree1_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_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d452f938d74713dbff7e0330f8ef393409d67ffe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:36:34,734 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:36:34,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:36:34,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:36:34,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:36:34,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:36:34,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:36:34,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:36:34,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:36:34,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:36:34,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:36:34,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:36:34,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:36:34,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:36:34,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:36:34,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:36:34,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:36:34,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:36:34,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:36:34,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:36:34,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:36:34,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:36:34,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:36:34,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:36:34,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:36:34,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:36:34,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:36:34,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:36:34,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:36:34,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:36:34,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:36:34,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:36:34,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:36:34,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:36:34,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:36:34,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:36:34,760 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 14:36:34,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:36:34,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:36:34,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:36:34,771 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:36:34,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:36:34,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:36:34,771 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:36:34,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:36:34,772 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:36:34,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:36:34,772 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:36:34,772 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:36:34,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:36:34,772 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:36:34,772 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:36:34,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:36:34,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:36:34,773 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:36:34,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:36:34,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:36:34,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:36:34,773 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:36:34,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:36:34,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:36:34,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:36:34,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:36:34,775 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:36:34,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:36:34,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:36:34,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan 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 -> Taipan 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 -> d452f938d74713dbff7e0330f8ef393409d67ffe [2018-11-23 14:36:34,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:36:34,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:36:34,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:36:34,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:36:34,807 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:36:34,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c [2018-11-23 14:36:34,843 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/data/648a4ddae/34cc6c48f19a45f785bc3239e2497abc/FLAG79ebaa23e [2018-11-23 14:36:35,145 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:36:35,146 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c [2018-11-23 14:36:35,149 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/data/648a4ddae/34cc6c48f19a45f785bc3239e2497abc/FLAG79ebaa23e [2018-11-23 14:36:35,158 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/data/648a4ddae/34cc6c48f19a45f785bc3239e2497abc [2018-11-23 14:36:35,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:36:35,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:36:35,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:36:35,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:36:35,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:36:35,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e96cc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35, skipping insertion in model container [2018-11-23 14:36:35,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:36:35,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:36:35,287 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:36:35,294 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:36:35,302 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:36:35,312 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:36:35,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35 WrapperNode [2018-11-23 14:36:35,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:36:35,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:36:35,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:36:35,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:36:35,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:36:35,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:36:35,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:36:35,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:36:35,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... [2018-11-23 14:36:35,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:36:35,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:36:35,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:36:35,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:36:35,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/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 14:36:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:36:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure freePointer [2018-11-23 14:36:35,415 INFO L138 BoogieDeclarations]: Found implementation of procedure freePointer [2018-11-23 14:36:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:36:35,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:36:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:36:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:36:35,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:36:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:36:35,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:36:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:36:35,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:36:35,518 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 14:36:35,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:35 BoogieIcfgContainer [2018-11-23 14:36:35,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:36:35,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:36:35,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:36:35,522 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:36:35,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:36:35" (1/3) ... [2018-11-23 14:36:35,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c507862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:35, skipping insertion in model container [2018-11-23 14:36:35,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:35" (2/3) ... [2018-11-23 14:36:35,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c507862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:35, skipping insertion in model container [2018-11-23 14:36:35,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:35" (3/3) ... [2018-11-23 14:36:35,525 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree1_false-valid-deref.c [2018-11-23 14:36:35,532 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:36:35,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 14:36:35,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 14:36:35,572 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:36:35,572 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 14:36:35,572 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:36:35,572 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:36:35,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:36:35,572 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:36:35,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:36:35,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:36:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 14:36:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:36:35,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:36:35,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:36:35,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 14:36:35,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:36:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash -96564575, now seen corresponding path program 1 times [2018-11-23 14:36:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:36:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:36:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:35,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:36:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:36:35,732 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 14:36:35,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:36:35,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:36:35,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:36:35,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:36:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:36:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:36:35,746 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 14:36:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:36:35,786 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2018-11-23 14:36:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:36:35,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-23 14:36:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:36:35,792 INFO L225 Difference]: With dead ends: 22 [2018-11-23 14:36:35,792 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 14:36:35,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:36:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 14:36:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 14:36:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 14:36:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2018-11-23 14:36:35,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 9 [2018-11-23 14:36:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:36:35,814 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2018-11-23 14:36:35,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:36:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2018-11-23 14:36:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:36:35,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:36:35,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:36:35,816 INFO L423 AbstractCegarLoop]: === Iteration 2 === [freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 14:36:35,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:36:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1301465505, now seen corresponding path program 1 times [2018-11-23 14:36:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:36:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:36:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:35,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:36:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:36:35,862 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 14:36:35,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:36:35,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:36:35,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:36:35,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:36:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:36:35,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:36:35,864 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 5 states. [2018-11-23 14:36:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:36:35,917 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-23 14:36:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:36:35,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 14:36:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:36:35,918 INFO L225 Difference]: With dead ends: 18 [2018-11-23 14:36:35,918 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 14:36:35,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:36:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 14:36:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 14:36:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 14:36:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-23 14:36:35,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 10 [2018-11-23 14:36:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:36:35,922 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-23 14:36:35,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:36:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 14:36:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:36:35,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:36:35,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:36:35,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 14:36:35,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:36:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1289113817, now seen corresponding path program 1 times [2018-11-23 14:36:35,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:36:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:35,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:36:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:35,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:36:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:36:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:36:35,955 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] RET #20#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret3 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.base || 1 == #valid[~p.base];call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume true; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] RET #24#return; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L12] CALL freePointer(p) VAL [p={42:0}] [L6] free(p) VAL [p={42:0}, p={42:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] p[0] = 1 ----- [2018-11-23 14:36:35,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:36:35 BoogieIcfgContainer [2018-11-23 14:36:35,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:36:35,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:36:35,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:36:35,978 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:36:35,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:35" (3/4) ... [2018-11-23 14:36:35,980 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] RET #20#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret3 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.base || 1 == #valid[~p.base];call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume true; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] RET #24#return; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L12] CALL freePointer(p) VAL [p={42:0}] [L6] free(p) VAL [p={42:0}, p={42:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] p[0] = 1 ----- [2018-11-23 14:36:36,015 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_983ffad3-329f-4ef9-aefe-21ace38e4b27/bin-2019/utaipan/witness.graphml [2018-11-23 14:36:36,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:36:36,015 INFO L168 Benchmark]: Toolchain (without parser) took 855.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -117.3 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:36:36,016 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:36:36,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:36:36,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.82 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:36:36,017 INFO L168 Benchmark]: Boogie Preprocessor took 11.93 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:36:36,018 INFO L168 Benchmark]: RCFGBuilder took 177.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:36:36,018 INFO L168 Benchmark]: TraceAbstraction took 458.18 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: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:36:36,018 INFO L168 Benchmark]: Witness Printer took 37.03 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:36:36,020 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 15.82 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.93 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 177.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 458.18 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: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Witness Printer took 37.03 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L12] CALL freePointer(p) VAL [p={42:0}] [L6] free(p) VAL [p={42:0}, p={42:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] p[0] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 5 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 19 SDslu, 58 SDs, 0 SdLazy, 36 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 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...