./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/realloc1_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_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:19:41,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:19:41,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:19:41,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:19:41,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:19:41,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:19:41,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:19:41,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:19:41,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:19:41,195 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:19:41,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:19:41,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:19:41,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:19:41,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:19:41,198 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:19:41,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:19:41,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:19:41,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:19:41,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:19:41,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:19:41,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:19:41,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:19:41,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:19:41,206 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:19:41,206 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:19:41,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:19:41,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:19:41,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:19:41,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:19:41,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:19:41,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:19:41,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:19:41,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:19:41,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:19:41,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:19:41,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:19:41,211 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 06:19:41,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:19:41,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:19:41,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:19:41,223 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:19:41,223 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:19:41,223 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:19:41,223 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:19:41,223 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:19:41,223 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:19:41,223 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:19:41,224 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:19:41,224 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:19:41,224 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:19:41,224 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:19:41,224 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:19:41,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 06:19:41,225 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 06:19:41,226 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 06:19:41,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:19:41,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:19:41,226 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:19:41,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:19:41,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:19:41,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:19:41,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:19:41,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:19:41,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:19:41,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:19:41,227 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:19:41,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:19:41,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:19:41,227 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_94ff908b-1b05-4990-af66-dbcd68ffab80/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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2018-11-23 06:19:41,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:19:41,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:19:41,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:19:41,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:19:41,265 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:19:41,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-23 06:19:41,311 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/data/9ca00eefc/6b7373f1e2d94c089099e4c882a5f160/FLAG838979105 [2018-11-23 06:19:41,634 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:19:41,634 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-23 06:19:41,638 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/data/9ca00eefc/6b7373f1e2d94c089099e4c882a5f160/FLAG838979105 [2018-11-23 06:19:41,647 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/data/9ca00eefc/6b7373f1e2d94c089099e4c882a5f160 [2018-11-23 06:19:41,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:19:41,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:19:41,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:19:41,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:19:41,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:19:41,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b01dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41, skipping insertion in model container [2018-11-23 06:19:41,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:19:41,681 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:19:41,814 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:19:41,820 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:19:41,830 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:19:41,840 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:19:41,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41 WrapperNode [2018-11-23 06:19:41,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:19:41,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:19:41,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:19:41,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:19:41,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:19:41,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:19:41,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:19:41,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:19:41,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... [2018-11-23 06:19:41,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:19:41,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:19:41,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:19:41,873 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:19:41,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 06:19:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:19:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:19:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:19:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 06:19:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:19:42,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:19:42,077 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 06:19:42,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:19:42 BoogieIcfgContainer [2018-11-23 06:19:42,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:19:42,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:19:42,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:19:42,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:19:42,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:19:41" (1/3) ... [2018-11-23 06:19:42,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f3c9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:19:42, skipping insertion in model container [2018-11-23 06:19:42,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:19:41" (2/3) ... [2018-11-23 06:19:42,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f3c9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:19:42, skipping insertion in model container [2018-11-23 06:19:42,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:19:42" (3/3) ... [2018-11-23 06:19:42,082 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1_false-valid-deref.c [2018-11-23 06:19:42,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:19:42,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-23 06:19:42,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-23 06:19:42,121 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:19:42,122 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 06:19:42,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:19:42,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:19:42,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:19:42,122 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:19:42,122 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:19:42,122 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:19:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 06:19:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:19:42,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,145 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1804436063, now seen corresponding path program 1 times [2018-11-23 06:19:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,223 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 06:19:42,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:19:42,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:19:42,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:19:42,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 06:19:42,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:19:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:19:42,239 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 06:19:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,248 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 06:19:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:19:42,250 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-23 06:19:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,257 INFO L225 Difference]: With dead ends: 26 [2018-11-23 06:19:42,257 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 06:19:42,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:19:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 06:19:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 06:19:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:19:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 06:19:42,284 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 8 [2018-11-23 06:19:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,284 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 06:19:42,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 06:19:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 06:19:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:19:42,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,285 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1804435753, now seen corresponding path program 1 times [2018-11-23 06:19:42,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,319 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 06:19:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:19:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:19:42,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:19:42,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:19:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:19:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:19:42,322 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-11-23 06:19:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,349 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 06:19:42,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:19:42,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 06:19:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,350 INFO L225 Difference]: With dead ends: 29 [2018-11-23 06:19:42,350 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 06:19:42,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:19:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 06:19:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 06:19:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 06:19:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 06:19:42,353 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2018-11-23 06:19:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,354 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 06:19:42,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:19:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 06:19:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:19:42,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1804435808, now seen corresponding path program 1 times [2018-11-23 06:19:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,424 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 06:19:42,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:19:42,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:19:42,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:19:42,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:19:42,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:19:42,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:19:42,425 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-11-23 06:19:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,456 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 06:19:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:19:42,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 06:19:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,457 INFO L225 Difference]: With dead ends: 28 [2018-11-23 06:19:42,457 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 06:19:42,457 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 06:19:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 06:19:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 06:19:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 06:19:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 06:19:42,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 8 [2018-11-23 06:19:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,462 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 06:19:42,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:19:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 06:19:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:19:42,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1804435807, now seen corresponding path program 1 times [2018-11-23 06:19:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,482 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 06:19:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:19:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:19:42,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:19:42,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:19:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:19:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:19:42,483 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2018-11-23 06:19:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,503 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 06:19:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:19:42,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 06:19:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,504 INFO L225 Difference]: With dead ends: 26 [2018-11-23 06:19:42,504 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 06:19:42,504 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 06:19:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 06:19:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 06:19:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:19:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 06:19:42,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 8 [2018-11-23 06:19:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,506 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 06:19:42,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:19:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 06:19:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:19:42,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,507 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -65428116, now seen corresponding path program 1 times [2018-11-23 06:19:42,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:19:42,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:19:42,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:19:42,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:19:42,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:19:42,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:19:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:19:42,550 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2018-11-23 06:19:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,557 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 06:19:42,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:19:42,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 06:19:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,558 INFO L225 Difference]: With dead ends: 25 [2018-11-23 06:19:42,558 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 06:19:42,558 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 06:19:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 06:19:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-23 06:19:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 06:19:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 06:19:42,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2018-11-23 06:19:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,560 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 06:19:42,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:19:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 06:19:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:19:42,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,561 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,561 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash -65428061, now seen corresponding path program 1 times [2018-11-23 06:19:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,640 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 06:19:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:19:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:19:42,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:19:42,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:19:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:19:42,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:19:42,641 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2018-11-23 06:19:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,666 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 06:19:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:19:42,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 06:19:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,668 INFO L225 Difference]: With dead ends: 25 [2018-11-23 06:19:42,668 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 06:19:42,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:19:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 06:19:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-11-23 06:19:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 06:19:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 06:19:42,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2018-11-23 06:19:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,671 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 06:19:42,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:19:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 06:19:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 06:19:42,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,672 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:42,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1548091759, now seen corresponding path program 1 times [2018-11-23 06:19:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:42,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,704 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 06:19:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:42,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:42,705 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-23 06:19:42,706 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [14], [17], [19], [24], [26], [28], [39], [40], [41] [2018-11-23 06:19:42,730 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:19:42,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:19:42,859 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:19:42,860 INFO L272 AbstractInterpreter]: Visited 14 different actions 29 times. Merged at 4 different actions 12 times. Never widened. Performed 155 root evaluator evaluations with a maximum evaluation depth of 3. Performed 155 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-23 06:19:42,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:42,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:19:42,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:42,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 06:19:42,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:42,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:19:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:42,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:42,924 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 06:19:42,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:42,954 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 06:19:42,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:42,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 06:19:42,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:42,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:19:42,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:19:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:19:42,980 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-23 06:19:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:42,995 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 06:19:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:19:42,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 06:19:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:42,995 INFO L225 Difference]: With dead ends: 26 [2018-11-23 06:19:42,996 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 06:19:42,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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 06:19:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 06:19:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 06:19:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:19:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 06:19:42,998 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2018-11-23 06:19:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:42,998 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 06:19:42,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:19:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 06:19:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:19:42,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:42,999 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:42,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:43,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1939298446, now seen corresponding path program 2 times [2018-11-23 06:19:43,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:43,030 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 06:19:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:43,030 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:43,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:43,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 06:19:43,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:19:43,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:19:43,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:19:43,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:19:43,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:43,056 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 06:19:43,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:43,095 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 06:19:43,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:43,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 06:19:43,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:43,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:19:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:19:43,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:19:43,112 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-23 06:19:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:43,131 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 06:19:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:19:43,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 06:19:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:43,132 INFO L225 Difference]: With dead ends: 30 [2018-11-23 06:19:43,132 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 06:19:43,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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 06:19:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 06:19:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-23 06:19:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 06:19:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 06:19:43,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-11-23 06:19:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:43,135 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 06:19:43,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:19:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 06:19:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:19:43,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:43,136 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:43,136 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:43,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash -17656843, now seen corresponding path program 3 times [2018-11-23 06:19:43,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:43,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:19:43,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:43,180 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 06:19:43,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:43,181 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:43,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:43,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 06:19:43,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:19:43,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:19:43,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:19:43,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:19:43,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:43,251 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 06:19:43,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:43,302 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 06:19:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 06:19:43,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:19:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:19:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:19:43,327 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-11-23 06:19:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:43,369 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 06:19:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:19:43,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 06:19:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:43,370 INFO L225 Difference]: With dead ends: 34 [2018-11-23 06:19:43,370 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 06:19:43,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 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 06:19:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 06:19:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 06:19:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 06:19:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 06:19:43,372 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2018-11-23 06:19:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:43,373 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 06:19:43,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:19:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 06:19:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 06:19:43,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:43,373 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:43,373 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash 165447416, now seen corresponding path program 4 times [2018-11-23 06:19:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:19:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:43,410 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 06:19:43,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:43,410 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:43,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:43,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 06:19:43,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:43,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:19:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:43,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:43,442 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 06:19:43,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:43,502 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 06:19:43,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 06:19:43,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:19:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:19:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:43,518 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states. [2018-11-23 06:19:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:43,541 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 06:19:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:19:43,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 06:19:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:43,542 INFO L225 Difference]: With dead ends: 38 [2018-11-23 06:19:43,542 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 06:19:43,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 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 06:19:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 06:19:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 06:19:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 06:19:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 06:19:43,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 26 [2018-11-23 06:19:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:43,545 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 06:19:43,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:19:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 06:19:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 06:19:43,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:43,546 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:43,546 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:43,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:43,547 INFO L82 PathProgramCache]: Analyzing trace with hash -658554757, now seen corresponding path program 5 times [2018-11-23 06:19:43,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:43,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:43,599 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 06:19:43,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:43,600 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:43,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:43,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/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 06:19:43,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:19:43,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:19:43,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 06:19:43,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:19:43,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:43,638 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 06:19:43,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:43,701 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 06:19:43,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:43,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 06:19:43,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:43,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 06:19:43,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 06:19:43,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:43,717 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2018-11-23 06:19:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:43,737 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 06:19:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:19:43,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 06:19:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:43,739 INFO L225 Difference]: With dead ends: 42 [2018-11-23 06:19:43,739 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 06:19:43,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 06:19:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 06:19:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:19:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 06:19:43,742 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2018-11-23 06:19:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:43,742 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 06:19:43,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 06:19:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 06:19:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 06:19:43,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:43,743 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:43,743 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1663860610, now seen corresponding path program 6 times [2018-11-23 06:19:43,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:19:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:43,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:43,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:43,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:43,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:43,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:19:43,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:19:43,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:19:43,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:19:43,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:19:43,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:43,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:43,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:43,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-23 06:19:43,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:43,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 06:19:43,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:19:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:43,926 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 10 states. [2018-11-23 06:19:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:43,955 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 06:19:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:19:43,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 06:19:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:43,956 INFO L225 Difference]: With dead ends: 46 [2018-11-23 06:19:43,956 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 06:19:43,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 06:19:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-23 06:19:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 06:19:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 06:19:43,960 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2018-11-23 06:19:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:43,960 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 06:19:43,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 06:19:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 06:19:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 06:19:43,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:43,962 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:43,962 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:43,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1124989183, now seen corresponding path program 7 times [2018-11-23 06:19:43,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:19:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:43,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:44,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:44,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:44,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:44,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:44,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:19:44,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:44,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:19:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:44,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:44,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-23 06:19:44,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:44,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 06:19:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 06:19:44,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:44,143 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 11 states. [2018-11-23 06:19:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:44,167 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 06:19:44,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:19:44,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 06:19:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:44,167 INFO L225 Difference]: With dead ends: 50 [2018-11-23 06:19:44,167 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 06:19:44,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 06:19:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-23 06:19:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 06:19:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 06:19:44,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2018-11-23 06:19:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:44,170 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 06:19:44,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 06:19:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 06:19:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 06:19:44,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:44,171 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:44,171 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:44,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash 93557764, now seen corresponding path program 8 times [2018-11-23 06:19:44,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:44,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:19:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:44,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:44,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:44,271 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:44,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:44,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:44,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:19:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:19:44,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:19:44,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 06:19:44,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:19:44,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-23 06:19:44,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:44,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:19:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:19:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:44,396 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 12 states. [2018-11-23 06:19:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:44,441 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 06:19:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 06:19:44,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 06:19:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:44,442 INFO L225 Difference]: With dead ends: 54 [2018-11-23 06:19:44,442 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 06:19:44,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 06:19:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-11-23 06:19:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 06:19:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 06:19:44,445 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 42 [2018-11-23 06:19:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:44,445 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 06:19:44,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:19:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 06:19:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 06:19:44,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:44,446 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:44,446 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:44,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:44,447 INFO L82 PathProgramCache]: Analyzing trace with hash -657397881, now seen corresponding path program 9 times [2018-11-23 06:19:44,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:44,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:44,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:19:44,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:44,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:19:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:44,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:19:44,533 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:19:44,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:19:44,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:19:44,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:19:44,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:19:44,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:19:44,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:19:44,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:19:44,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:19:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:19:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:19:44,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:19:44,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 06:19:44,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:19:44,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 06:19:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:19:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:44,665 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 13 states. [2018-11-23 06:19:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:19:44,694 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 06:19:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:19:44,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-23 06:19:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:19:44,695 INFO L225 Difference]: With dead ends: 55 [2018-11-23 06:19:44,695 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 06:19:44,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:19:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 06:19:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 06:19:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 06:19:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-23 06:19:44,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 46 [2018-11-23 06:19:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:19:44,698 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-23 06:19:44,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 06:19:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 06:19:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 06:19:44,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:19:44,698 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:19:44,699 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-11-23 06:19:44,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:19:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1583530378, now seen corresponding path program 10 times [2018-11-23 06:19:44,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:19:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:44,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:19:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:19:44,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:19:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:19:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:19:44,740 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 #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=7, 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [main_~i~0=7, 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 VAL [main_~i~0=7, 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; VAL [main_~i~0=7, 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=8, 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [main_~i~0=8, 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 VAL [main_~i~0=8, 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; VAL [main_~i~0=8, 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=9, 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [main_~i~0=9, 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 VAL [main_~i~0=9, 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; VAL [main_~i~0=9, 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=10, 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=10, 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=10, 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=10, 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=10, 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~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L8] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L8] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L10] ~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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L14] 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=10, ~p~0.base=42, ~p~0.offset=0] [L16] call #t~mem5 := read~int(~p~0.base, 2 + ~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L8] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L8] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L10] ~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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L14] 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=10, ~p~0.base=42, ~p~0.offset=0] [L16] call #t~mem5 := read~int(~p~0.base, 2 + ~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) [L16] p[2] ----- [2018-11-23 06:19:44,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:19:44 BoogieIcfgContainer [2018-11-23 06:19:44,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:19:44,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:19:44,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:19:44,805 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:19:44,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:19:42" (3/4) ... [2018-11-23 06:19:44,808 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 #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; 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] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=7, 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [main_~i~0=7, 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 VAL [main_~i~0=7, 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; VAL [main_~i~0=7, 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=8, 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [main_~i~0=8, 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 VAL [main_~i~0=8, 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; VAL [main_~i~0=8, 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=9, 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);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [main_~i~0=9, 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, |main_#t~nondet4|=0] [?] SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 VAL [main_~i~0=9, 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, |main_#t~nondet4|=0] [?] havoc #t~nondet4; VAL [main_~i~0=9, 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=10, 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=10, 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=10, 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=10, 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=10, 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~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L8] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L8] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L10] ~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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L14] 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=10, ~p~0.base=42, ~p~0.offset=0] [L16] call #t~mem5 := read~int(~p~0.base, 2 + ~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L8] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L8] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; [L10] ~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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=2, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=3, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=4, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=5, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=6, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=7, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=8, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !!(~i~0 < 10); [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, #t~nondet4=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L11] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=9, ~p~0.base=42, ~p~0.offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L10-L12] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~p~0.base=42, ~p~0.offset=0] [L14] assert 0 == ~p~0.base || 1 == #valid[~p~0.base]; [L14] 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=10, ~p~0.base=42, ~p~0.offset=0] [L16] call #t~mem5 := read~int(~p~0.base, 2 + ~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~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~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L8] ~p~0 := #t~malloc2; [L10] ~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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=2, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=3, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=4, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=5, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] 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] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=6, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; 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] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=7, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=8, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND FALSE !(!(~i~0 < 10)) [L11] assume -128 <= #t~nondet4 && #t~nondet4 <= 127; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] FCALL call write~int(#t~nondet4, { base: ~p~0!base, offset: ~p~0!offset + ~i~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, #t~nondet4=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L11] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=9, ~p~0!base=42, ~p~0!offset=0] [L10] #t~post3 := ~i~0; [L10] ~i~0 := 1 + #t~post3; [L10] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L10-L12] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L14] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L14] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L16] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: 2 + ~p~0!offset }, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~i~0=10, ~p~0!base=42, ~p~0!offset=0] [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) [L16] p[2] ----- [2018-11-23 06:19:45,056 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_94ff908b-1b05-4990-af66-dbcd68ffab80/bin-2019/utaipan/witness.graphml [2018-11-23 06:19:45,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:19:45,057 INFO L168 Benchmark]: Toolchain (without parser) took 3407.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -98.7 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:19:45,059 INFO L168 Benchmark]: CDTParser took 0.15 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 06:19:45,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:19:45,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.33 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:19:45,060 INFO L168 Benchmark]: Boogie Preprocessor took 15.37 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:19:45,060 INFO L168 Benchmark]: RCFGBuilder took 204.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:19:45,060 INFO L168 Benchmark]: TraceAbstraction took 2726.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:19:45,060 INFO L168 Benchmark]: Witness Printer took 252.00 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:19:45,063 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.15 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 189.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.33 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.37 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2726.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. * Witness Printer took 252.00 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) [L16] p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 7 error locations. UNSAFE Result, 2.6s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 263 SDtfs, 221 SDslu, 781 SDs, 0 SdLazy, 310 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 494 SyntacticMatches, 31 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=15, 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, 15 MinimizatonAttempts, 44 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 65808 SizeOfPredicates, 9 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 3/1578 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...