./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_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_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/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 44834c55142a76240cb3980fc2bb6f5aeaa27c83 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 15:09:44,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:09:44,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:09:44,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:09:44,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:09:44,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:09:44,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:09:44,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:09:44,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:09:44,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:09:44,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:09:44,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:09:44,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:09:44,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:09:44,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:09:44,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:09:44,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:09:44,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:09:44,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:09:44,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:09:44,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:09:44,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:09:44,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:09:44,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:09:44,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:09:44,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:09:44,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:09:44,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:09:44,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:09:44,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:09:44,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:09:44,103 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:09:44,103 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:09:44,104 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:09:44,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:09:44,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:09:44,106 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 15:09:44,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:09:44,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:09:44,116 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:09:44,116 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:09:44,116 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:09:44,116 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:09:44,116 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:09:44,117 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:09:44,117 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:09:44,117 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:09:44,117 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:09:44,117 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:09:44,118 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:09:44,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:09:44,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:09:44,120 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:09:44,120 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:09:44,120 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:09:44,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:09:44,121 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:09:44,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:09:44,121 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 15:09:44,121 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 15:09:44,121 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 15:09:44,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:09:44,122 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:09:44,122 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:09:44,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:09:44,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:09:44,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:09:44,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:09:44,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:09:44,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:09:44,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:09:44,123 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:09:44,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:09:44,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:09:44,124 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_a1dc3482-87ac-4cf9-9145-d76dac694fcb/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 -> 44834c55142a76240cb3980fc2bb6f5aeaa27c83 [2018-11-23 15:09:44,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:09:44,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:09:44,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:09:44,159 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:09:44,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:09:44,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-11-23 15:09:44,201 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/data/13f4a201c/5fccb59c5a2d4965886ed361bb7e9807/FLAG56a728139 [2018-11-23 15:09:44,548 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:09:44,548 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-11-23 15:09:44,553 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/data/13f4a201c/5fccb59c5a2d4965886ed361bb7e9807/FLAG56a728139 [2018-11-23 15:09:44,963 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/data/13f4a201c/5fccb59c5a2d4965886ed361bb7e9807 [2018-11-23 15:09:44,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:09:44,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:09:44,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:09:44,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:09:44,972 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:09:44,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:09:44" (1/1) ... [2018-11-23 15:09:44,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44db1cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:44, skipping insertion in model container [2018-11-23 15:09:44,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:09:44" (1/1) ... [2018-11-23 15:09:44,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:09:44,995 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:09:45,109 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:09:45,115 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:09:45,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:09:45,137 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:09:45,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45 WrapperNode [2018-11-23 15:09:45,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:09:45,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:09:45,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:09:45,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:09:45,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:09:45,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:09:45,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:09:45,157 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:09:45,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... [2018-11-23 15:09:45,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:09:45,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:09:45,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:09:45,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:09:45,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/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 15:09:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:09:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:09:45,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:09:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:09:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:09:45,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:09:45,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:09:45,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:09:45,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:09:45,415 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:09:45,415 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:09:45,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:09:45 BoogieIcfgContainer [2018-11-23 15:09:45,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:09:45,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:09:45,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:09:45,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:09:45,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:09:44" (1/3) ... [2018-11-23 15:09:45,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97bc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:09:45, skipping insertion in model container [2018-11-23 15:09:45,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:45" (2/3) ... [2018-11-23 15:09:45,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97bc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:09:45, skipping insertion in model container [2018-11-23 15:09:45,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:09:45" (3/3) ... [2018-11-23 15:09:45,425 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree2_false-valid-deref.c [2018-11-23 15:09:45,436 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:09:45,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 15:09:45,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 15:09:45,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:09:45,489 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 15:09:45,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:09:45,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:09:45,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:09:45,489 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:09:45,489 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:09:45,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:09:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 15:09:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 15:09:45,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:45,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:45,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:45,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552165, now seen corresponding path program 1 times [2018-11-23 15:09:45,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:45,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:45,685 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 15:09:45,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:09:45,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:09:45,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:09:45,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:09:45,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:09:45,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:09:45,702 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-11-23 15:09:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:45,764 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 15:09:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:09:45,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 15:09:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:45,775 INFO L225 Difference]: With dead ends: 27 [2018-11-23 15:09:45,775 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 15:09:45,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 15:09:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 15:09:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-23 15:09:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:09:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 15:09:45,804 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2018-11-23 15:09:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:45,804 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 15:09:45,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:09:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 15:09:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 15:09:45,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:45,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:45,806 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:45,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552164, now seen corresponding path program 1 times [2018-11-23 15:09:45,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:45,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:45,840 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 15:09:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:09:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:09:45,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:09:45,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:09:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:09:45,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:09:45,842 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 15:09:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:45,859 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 15:09:45,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:09:45,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 15:09:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:45,860 INFO L225 Difference]: With dead ends: 28 [2018-11-23 15:09:45,860 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 15:09:45,861 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 15:09:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 15:09:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-23 15:09:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:09:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 15:09:45,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2018-11-23 15:09:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:45,864 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 15:09:45,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:09:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 15:09:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 15:09:45,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:45,864 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:45,865 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:45,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash -387375000, now seen corresponding path program 1 times [2018-11-23 15:09:45,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:45,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:45,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:45,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:09:46,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:09:46,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:09:46,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:09:46,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:09:46,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:09:46,022 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-23 15:09:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:46,049 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 15:09:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:09:46,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 15:09:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:46,050 INFO L225 Difference]: With dead ends: 23 [2018-11-23 15:09:46,050 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 15:09:46,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:09:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 15:09:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 15:09:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:09:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 15:09:46,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 12 [2018-11-23 15:09:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:46,054 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 15:09:46,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:09:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 15:09:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:09:46,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:46,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:46,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:46,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash 876275464, now seen corresponding path program 1 times [2018-11-23 15:09:46,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:09:46,105 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-23 15:09:46,106 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [14], [25], [27], [31], [33], [34], [35], [36] [2018-11-23 15:09:46,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:09:46,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:09:46,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:09:46,284 INFO L272 AbstractInterpreter]: Visited 13 different actions 35 times. Merged at 7 different actions 19 times. Widened at 1 different actions 1 times. Performed 178 root evaluator evaluations with a maximum evaluation depth of 4. Performed 178 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-23 15:09:46,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:46,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:09:46,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:46,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:09:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:09:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:09:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 15:09:46,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:09:46,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:09:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:09:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:09:46,380 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 15:09:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:46,408 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 15:09:46,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:09:46,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 15:09:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:46,410 INFO L225 Difference]: With dead ends: 27 [2018-11-23 15:09:46,410 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 15:09:46,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:09:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 15:09:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 15:09:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 15:09:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 15:09:46,414 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-11-23 15:09:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:46,415 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 15:09:46,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:09:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 15:09:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 15:09:46,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:46,416 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:46,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:46,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1958351323, now seen corresponding path program 2 times [2018-11-23 15:09:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:46,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:09:46,474 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:09:46,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:09:46,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:46,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:09:46,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:09:46,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 15:09:46,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:09:46,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:09:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:09:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 15:09:46,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:09:46,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:09:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:09:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:09:46,570 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-23 15:09:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:46,594 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 15:09:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:09:46,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 15:09:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:46,596 INFO L225 Difference]: With dead ends: 31 [2018-11-23 15:09:46,596 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 15:09:46,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:09:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 15:09:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 15:09:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:09:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 15:09:46,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2018-11-23 15:09:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:46,599 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 15:09:46,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:09:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 15:09:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:09:46,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:46,600 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:46,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:46,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash -921821502, now seen corresponding path program 3 times [2018-11-23 15:09:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:09:46,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:09:46,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:09:46,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:46,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:09:46,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:09:46,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:09:46,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:09:46,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:09:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:09:46,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 15:09:46,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:09:46,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:09:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:09:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:09:46,830 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-23 15:09:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:46,862 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 15:09:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:09:46,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 15:09:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:46,863 INFO L225 Difference]: With dead ends: 35 [2018-11-23 15:09:46,863 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 15:09:46,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:09:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 15:09:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 15:09:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:09:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 15:09:46,867 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 21 [2018-11-23 15:09:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:46,868 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 15:09:46,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:09:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 15:09:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:09:46,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:46,869 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:46,869 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:46,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1880966945, now seen corresponding path program 4 times [2018-11-23 15:09:46,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:46,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:46,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:09:46,915 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:09:46,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:09:46,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:46,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:46,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:46,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:09:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:46,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:46,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:09:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:47,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:09:47,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 15:09:47,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:09:47,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:09:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:09:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:09:47,038 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-11-23 15:09:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:47,076 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 15:09:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:09:47,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 15:09:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:47,078 INFO L225 Difference]: With dead ends: 39 [2018-11-23 15:09:47,078 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:09:47,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:09:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:09:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 15:09:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 15:09:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 15:09:47,082 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 25 [2018-11-23 15:09:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:47,082 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 15:09:47,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:09:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 15:09:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 15:09:47,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:47,084 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:47,084 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:47,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1215495292, now seen corresponding path program 5 times [2018-11-23 15:09:47,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:47,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:47,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:47,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:47,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:09:47,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:09:47,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:09:47,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:47,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:09:47,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:09:47,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 15:09:47,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:09:47,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:47,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:09:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:47,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:09:47,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-11-23 15:09:47,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:09:47,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 15:09:47,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 15:09:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:09:47,348 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2018-11-23 15:09:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:47,664 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 15:09:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 15:09:47,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 15:09:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:09:47,667 INFO L225 Difference]: With dead ends: 53 [2018-11-23 15:09:47,667 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 15:09:47,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=418, Unknown=0, NotChecked=0, Total=650 [2018-11-23 15:09:47,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 15:09:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 15:09:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 15:09:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-23 15:09:47,674 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 29 [2018-11-23 15:09:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:09:47,674 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-23 15:09:47,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 15:09:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 15:09:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 15:09:47,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:09:47,675 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:47,675 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:09:47,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:47,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1030409178, now seen corresponding path program 1 times [2018-11-23 15:09:47,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:09:47,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:47,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:47,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:47,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:09:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:47,722 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 #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := 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;~i~0 := 0; VAL [main_~i~0=0, 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 !!(~i~0 < 10); VAL [main_~i~0=0, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=0, 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 !(5 == ~i~0); VAL [main_~i~0=0, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=1, 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 !!(~i~0 < 10); VAL [main_~i~0=1, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=1, 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 !(5 == ~i~0); VAL [main_~i~0=1, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=2, 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 !!(~i~0 < 10); VAL [main_~i~0=2, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=2, 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 !(5 == ~i~0); VAL [main_~i~0=2, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=3, 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 !!(~i~0 < 10); VAL [main_~i~0=3, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=3, 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 !(5 == ~i~0); VAL [main_~i~0=3, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=4, 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 !!(~i~0 < 10); VAL [main_~i~0=4, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=4, 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 !(5 == ~i~0); VAL [main_~i~0=4, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=5, 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 !!(~i~0 < 10); VAL [main_~i~0=5, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=5, 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 5 == ~i~0; VAL [main_~i~0=5, 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 0 == ~p~0.offset; VAL [main_~i~0=5, 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 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); VAL [main_~i~0=5, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, 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 !!(~i~0 < 10); VAL [main_~i~0=6, 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_~i~0=6, 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~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L6] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L6] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L8] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume 5 == ~i~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L11] call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L6] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L6] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L8] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume 5 == ~i~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L11] call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 ----- [2018-11-23 15:09:47,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:09:47 BoogieIcfgContainer [2018-11-23 15:09:47,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:09:47,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:09:47,772 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:09:47,772 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:09:47,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:09:45" (3/4) ... [2018-11-23 15:09:47,774 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 #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := 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;~i~0 := 0; VAL [main_~i~0=0, 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 !!(~i~0 < 10); VAL [main_~i~0=0, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=0, 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 !(5 == ~i~0); VAL [main_~i~0=0, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=1, 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 !!(~i~0 < 10); VAL [main_~i~0=1, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=1, 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 !(5 == ~i~0); VAL [main_~i~0=1, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=2, 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 !!(~i~0 < 10); VAL [main_~i~0=2, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=2, 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 !(5 == ~i~0); VAL [main_~i~0=2, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=3, 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 !!(~i~0 < 10); VAL [main_~i~0=3, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=3, 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 !(5 == ~i~0); VAL [main_~i~0=3, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=4, 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 !!(~i~0 < 10); VAL [main_~i~0=4, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=4, 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 !(5 == ~i~0); VAL [main_~i~0=4, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=5, 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 !!(~i~0 < 10); VAL [main_~i~0=5, 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] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 VAL [main_~i~0=5, 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 5 == ~i~0; VAL [main_~i~0=5, 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 0 == ~p~0.offset; VAL [main_~i~0=5, 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 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); VAL [main_~i~0=5, 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, 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 !!(~i~0 < 10); VAL [main_~i~0=6, 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_~i~0=6, 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~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L6] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L6] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L8] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume 5 == ~i~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L11] call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L6] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L6] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L8] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(5 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume 5 == ~i~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L11] call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L8-L13] assume !!(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L9] call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~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~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 ----- [2018-11-23 15:09:47,875 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a1dc3482-87ac-4cf9-9145-d76dac694fcb/bin-2019/utaipan/witness.graphml [2018-11-23 15:09:47,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:09:47,876 INFO L168 Benchmark]: Toolchain (without parser) took 2909.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:47,877 INFO L168 Benchmark]: CDTParser took 0.14 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 15:09:47,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.71 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 15:09:47,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.57 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 15:09:47,878 INFO L168 Benchmark]: Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:09:47,878 INFO L168 Benchmark]: RCFGBuilder took 239.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:47,878 INFO L168 Benchmark]: TraceAbstraction took 2354.65 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:47,879 INFO L168 Benchmark]: Witness Printer took 103.46 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:47,881 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.14 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 169.71 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 Procedure Inliner took 18.57 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. * Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 239.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2354.65 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Witness Printer took 103.46 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 5 error locations. UNSAFE Result, 2.2s OverallTime, 9 OverallIterations, 7 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 224 SDslu, 205 SDs, 0 SdLazy, 209 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 17854 SizeOfPredicates, 5 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 15/287 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...