./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 981f9605b8ccc487ab91eaf7b6ca746d6b73f5da .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:21:17,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:21:17,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:21:17,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:21:17,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:21:17,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:21:17,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:21:17,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:21:17,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:21:17,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:21:17,693 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:21:17,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:21:17,694 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:21:17,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:21:17,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:21:17,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:21:17,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:21:17,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:21:17,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:21:17,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:21:17,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:21:17,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:21:17,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:21:17,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:21:17,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:21:17,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:21:17,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:21:17,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:21:17,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:21:17,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:21:17,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:21:17,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:21:17,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:21:17,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:21:17,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:21:17,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:21:17,715 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 09:21:17,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:21:17,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:21:17,726 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:21:17,726 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:21:17,726 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 09:21:17,727 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 09:21:17,727 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 09:21:17,727 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 09:21:17,727 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 09:21:17,727 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 09:21:17,727 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 09:21:17,728 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 09:21:17,728 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 09:21:17,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:21:17,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:21:17,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:21:17,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:21:17,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:21:17,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:21:17,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:21:17,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:21:17,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:21:17,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:21:17,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:21:17,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:21:17,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:21:17,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:21:17,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:21:17,731 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:21:17,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:21:17,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:21:17,732 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:21:17,732 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:21:17,732 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 09:21:17,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:21:17,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:21:17,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:21:17,733 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_1e576eb5-e2da-4eee-9dea-f34571296800/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 ! call(__VERIFIER_error())) ) 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 -> 981f9605b8ccc487ab91eaf7b6ca746d6b73f5da [2018-11-23 09:21:17,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:21:17,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:21:17,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:21:17,779 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:21:17,779 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:21:17,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 09:21:17,832 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/data/8c323a86b/375756600e3c481e91f7a0d646c98f3d/FLAGbac58da75 [2018-11-23 09:21:18,239 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:21:18,240 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 09:21:18,252 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/data/8c323a86b/375756600e3c481e91f7a0d646c98f3d/FLAGbac58da75 [2018-11-23 09:21:18,606 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/data/8c323a86b/375756600e3c481e91f7a0d646c98f3d [2018-11-23 09:21:18,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:21:18,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:21:18,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:21:18,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:21:18,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:21:18,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:21:18" (1/1) ... [2018-11-23 09:21:18,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7f8f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:18, skipping insertion in model container [2018-11-23 09:21:18,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:21:18" (1/1) ... [2018-11-23 09:21:18,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:21:18,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:21:18,904 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:21:18,913 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:21:19,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:21:19,040 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:21:19,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19 WrapperNode [2018-11-23 09:21:19,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:21:19,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:21:19,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:21:19,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:21:19,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:21:19,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:21:19,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:21:19,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:21:19,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... [2018-11-23 09:21:19,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:21:19,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:21:19,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:21:19,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:21:19,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/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 09:21:19,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:21:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:21:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 09:21:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 09:21:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:21:19,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:21:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:21:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:21:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:21:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 09:21:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 09:21:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:21:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:21:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:21:19,397 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:21:19,398 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 09:21:19,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:19 BoogieIcfgContainer [2018-11-23 09:21:19,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:21:19,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:21:19,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:21:19,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:21:19,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:21:18" (1/3) ... [2018-11-23 09:21:19,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192b9db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:21:19, skipping insertion in model container [2018-11-23 09:21:19,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:21:19" (2/3) ... [2018-11-23 09:21:19,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192b9db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:21:19, skipping insertion in model container [2018-11-23 09:21:19,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:19" (3/3) ... [2018-11-23 09:21:19,406 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-23 09:21:19,417 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:21:19,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:21:19,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:21:19,480 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:21:19,481 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:21:19,481 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:21:19,481 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:21:19,481 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:21:19,481 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:21:19,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:21:19,482 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:21:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 09:21:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:21:19,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:21:19,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:21:19,510 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:21:19,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:21:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash 985352840, now seen corresponding path program 1 times [2018-11-23 09:21:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:21:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:19,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:21:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:19,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:21:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:21:19,629 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 09:21:19,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:21:19,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:21:19,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:21:19,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:21:19,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:21:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:21:19,653 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 09:21:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:21:19,670 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2018-11-23 09:21:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:21:19,672 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 09:21:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:21:19,681 INFO L225 Difference]: With dead ends: 52 [2018-11-23 09:21:19,681 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 09:21:19,684 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 09:21:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 09:21:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 09:21:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 09:21:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 09:21:19,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2018-11-23 09:21:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:21:19,720 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 09:21:19,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:21:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 09:21:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 09:21:19,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:21:19,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:21:19,721 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:21:19,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:21:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -811727628, now seen corresponding path program 1 times [2018-11-23 09:21:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:21:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:21:19,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:19,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:21:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:21:19,789 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 09:21:19,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:21:19,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:21:19,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:21:19,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:21:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:21:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:21:19,791 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 09:21:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:21:19,817 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 09:21:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:21:19,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 09:21:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:21:19,819 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:21:19,819 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:21:19,820 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 09:21:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:21:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 09:21:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 09:21:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 09:21:19,826 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2018-11-23 09:21:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:21:19,827 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 09:21:19,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:21:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 09:21:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 09:21:19,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:21:19,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:21:19,828 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:21:19,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:21:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash -811734572, now seen corresponding path program 1 times [2018-11-23 09:21:19,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:21:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:19,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:21:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:19,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:21:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:21:19,915 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 09:21:19,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:21:19,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:21:19,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:21:19,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 09:21:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:21:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:21:19,917 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2018-11-23 09:21:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:21:20,047 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 09:21:20,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:21:20,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 09:21:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:21:20,049 INFO L225 Difference]: With dead ends: 61 [2018-11-23 09:21:20,049 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 09:21:20,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:21:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 09:21:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 09:21:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 09:21:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 09:21:20,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2018-11-23 09:21:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:21:20,056 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 09:21:20,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 09:21:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 09:21:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 09:21:20,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:21:20,057 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:21:20,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:21:20,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:21:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -506955009, now seen corresponding path program 1 times [2018-11-23 09:21:20,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:21:20,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:20,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:21:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:21:20,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:21:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:21:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:21:20,112 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #97#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume 0 != ~flag~0;call write~int(2, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem4|=2] [?] assume !!(3 != #t~mem4);havoc #t~mem4; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume 0 != ~flag~0;~flag~0 := 0;call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5|=2] [?] assume 1 != #t~mem5;havoc #t~mem5; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632-L644] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L633-L639] assume 0 != ~flag~0; [L634] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L635] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L640] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L643] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L644] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L647] ~flag~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648-L659] assume !!(3 != #t~mem4); [L648] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L657] assume 0 != ~flag~0; [L650] ~flag~0 := 0; [L651] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 1 != #t~mem5; [L651] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L668] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632-L644] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L633-L639] assume 0 != ~flag~0; [L634] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L635] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L640] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L643] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L644] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L647] ~flag~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648-L659] assume !!(3 != #t~mem4); [L648] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L657] assume 0 != ~flag~0; [L650] ~flag~0 := 0; [L651] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 1 != #t~mem5; [L651] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L668] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L627] int flag = 1; [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L629] COND FALSE !(a == 0) VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L630] List t; [L631] List p = a; VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] p->h = 2 [L635] flag = 0 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L640] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L641] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a [L647] flag = 1 VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L648] EXPR p->h VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2, t={17:0}] [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 1 [L668] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] ----- [2018-11-23 09:21:20,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:21:20 BoogieIcfgContainer [2018-11-23 09:21:20,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:21:20,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:21:20,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:21:20,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:21:20,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:21:19" (3/4) ... [2018-11-23 09:21:20,172 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|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #97#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume 0 != ~flag~0;call write~int(2, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem4|=2] [?] assume !!(3 != #t~mem4);havoc #t~mem4; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume 0 != ~flag~0;~flag~0 := 0;call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5|=2] [?] assume 1 != #t~mem5;havoc #t~mem5; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632-L644] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L633-L639] assume 0 != ~flag~0; [L634] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L635] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L640] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L643] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L644] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L647] ~flag~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648-L659] assume !!(3 != #t~mem4); [L648] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L657] assume 0 != ~flag~0; [L650] ~flag~0 := 0; [L651] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 1 != #t~mem5; [L651] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L668] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L632-L644] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L633-L639] assume 0 != ~flag~0; [L634] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L635] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L640] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L640] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L641] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L642] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L643] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L643] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L644] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L646] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L647] ~flag~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L648-L659] assume !!(3 != #t~mem4); [L648] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L657] assume 0 != ~flag~0; [L650] ~flag~0 := 0; [L651] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 1 != #t~mem5; [L651] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L668] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L632-L644] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L633-L639] COND TRUE 0 != ~flag~0 [L634] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L635] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L640] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L640] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L641] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L642] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := #t~mem3; [L643] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L644] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L646] ~p~0 := ~a~0; [L647] ~flag~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L648-L659] COND FALSE !(!(3 != #t~mem4)) [L648] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L657] COND TRUE 0 != ~flag~0 [L650] ~flag~0 := 0; [L651] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 1 != #t~mem5 [L651] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L668] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L627] int flag = 1; [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L629] COND FALSE !(a == 0) VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L630] List t; [L631] List p = a; VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] p->h = 2 [L635] flag = 0 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L640] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L641] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a [L647] flag = 1 VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L648] EXPR p->h VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2, t={17:0}] [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 1 [L668] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] ----- [2018-11-23 09:21:20,233 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1e576eb5-e2da-4eee-9dea-f34571296800/bin-2019/utaipan/witness.graphml [2018-11-23 09:21:20,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:21:20,234 INFO L168 Benchmark]: Toolchain (without parser) took 1625.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -78.5 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:21:20,236 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:21:20,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:21:20,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:21:20,237 INFO L168 Benchmark]: Boogie Preprocessor took 26.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:21:20,237 INFO L168 Benchmark]: RCFGBuilder took 303.80 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: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:21:20,238 INFO L168 Benchmark]: TraceAbstraction took 762.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:21:20,238 INFO L168 Benchmark]: Witness Printer took 71.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:21:20,241 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 429.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 303.80 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: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 762.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. * Witness Printer took 71.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 668]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = 1; [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L629] COND FALSE !(a == 0) VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L630] List t; [L631] List p = a; VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] p->h = 2 [L635] flag = 0 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L640] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L641] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L642] p->n = t [L643] EXPR p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 [L646] p = a [L647] flag = 1 VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L648] EXPR p->h VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2, t={17:0}] [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 1 [L668] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 24 SDslu, 71 SDs, 0 SdLazy, 35 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 1126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...