./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-optional_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_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/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 9782fe34c3bae6ab09bbe7588de1b0d436c1fccc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:21:19,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:21:19,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:21:19,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:21:19,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:21:19,937 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:21:19,938 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:21:19,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:21:19,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:21:19,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:21:19,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:21:19,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:21:19,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:21:19,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:21:19,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:21:19,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:21:19,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:21:19,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:21:19,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:21:19,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:21:19,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:21:19,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:21:19,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:21:19,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:21:19,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:21:19,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:21:19,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:21:19,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:21:19,953 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:21:19,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:21:19,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:21:19,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:21:19,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:21:19,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:21:19,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:21:19,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:21:19,956 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:21:19,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:21:19,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:21:19,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:21:19,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:21:19,967 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:21:19,968 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:21:19,968 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:21:19,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:21:19,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:21:19,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:21:19,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:21:19,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:21:19,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:21:19,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:21:19,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:21:19,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:21:19,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:21:19,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:21:19,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:21:19,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:21:19,971 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:21:19,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:21:19,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:21:19,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:21:19,971 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_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/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 -> 9782fe34c3bae6ab09bbe7588de1b0d436c1fccc [2018-11-23 01:21:19,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:21:20,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:21:20,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:21:20,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:21:20,008 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:21:20,008 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-optional_false-unreach-call_false-valid-memcleanup.i [2018-11-23 01:21:20,051 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/data/eb032fcf5/9cf31e25b67f4bf78c274c686bb6a800/FLAG9e71000af [2018-11-23 01:21:20,509 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:21:20,509 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/sv-benchmarks/c/forester-heap/sll-optional_false-unreach-call_false-valid-memcleanup.i [2018-11-23 01:21:20,519 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/data/eb032fcf5/9cf31e25b67f4bf78c274c686bb6a800/FLAG9e71000af [2018-11-23 01:21:21,026 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/data/eb032fcf5/9cf31e25b67f4bf78c274c686bb6a800 [2018-11-23 01:21:21,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:21:21,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:21:21,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:21:21,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:21:21,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:21:21,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172b0922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21, skipping insertion in model container [2018-11-23 01:21:21,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:21:21,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:21:21,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:21:21,266 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:21:21,338 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:21:21,361 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:21:21,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21 WrapperNode [2018-11-23 01:21:21,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:21:21,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:21:21,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:21:21,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:21:21,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:21:21,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:21:21,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:21:21,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:21:21,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... [2018-11-23 01:21:21,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:21:21,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:21:21,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:21:21,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:21:21,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/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 01:21:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:21:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:21:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:21:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:21:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:21:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:21:21,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:21:21,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:21:21,677 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:21:21,678 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 01:21:21,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:21 BoogieIcfgContainer [2018-11-23 01:21:21,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:21:21,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:21:21,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:21:21,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:21:21,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:21:21" (1/3) ... [2018-11-23 01:21:21,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e08202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:21:21, skipping insertion in model container [2018-11-23 01:21:21,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:21:21" (2/3) ... [2018-11-23 01:21:21,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e08202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:21:21, skipping insertion in model container [2018-11-23 01:21:21,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:21" (3/3) ... [2018-11-23 01:21:21,684 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional_false-unreach-call_false-valid-memcleanup.i [2018-11-23 01:21:21,691 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:21:21,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:21:21,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:21:21,723 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:21:21,723 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:21:21,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:21:21,723 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:21:21,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:21:21,723 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:21:21,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:21:21,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:21:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 01:21:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 01:21:21,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:21:21,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:21:21,742 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:21:21,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:21:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash 90778063, now seen corresponding path program 1 times [2018-11-23 01:21:21,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:21:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:21:21,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:21:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:21:21,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:21:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:21:21,848 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 01:21:21,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:21:21,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:21:21,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:21:21,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:21:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:21:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:21:21,862 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 01:21:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:21:21,874 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2018-11-23 01:21:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:21:21,875 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 01:21:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:21:21,882 INFO L225 Difference]: With dead ends: 49 [2018-11-23 01:21:21,882 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 01:21:21,884 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 01:21:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 01:21:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 01:21:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 01:21:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 01:21:21,910 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2018-11-23 01:21:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:21:21,910 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 01:21:21,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:21:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-11-23 01:21:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:21:21,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:21:21,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:21:21,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:21:21,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:21:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash -955807242, now seen corresponding path program 1 times [2018-11-23 01:21:21,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:21:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:21:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:21:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:21:21,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:21:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:21:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:21:21,975 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=20, |#NULL.offset|=13, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] RET #104#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=18, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume 0 != #t~nondet1;havoc #t~nondet1;call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~nondet5|=0] [?] assume !(0 != #t~nondet5);havoc #t~nondet5; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0); VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem12 := read~int(~x~0.base, 8 + ~x~0.offset, 4);#t~short14 := 2 == #t~mem12; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem12|=2, |main_#t~short14|=true] [?] assume #t~short14;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, 4 + ~x~0.offset, 4);#t~short14 := #t~mem13.base == ~x~0.base && #t~mem13.offset == ~x~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem12|=2, |main_#t~mem13.base|=15, |main_#t~mem13.offset|=0, |main_#t~short14|=false] [?] assume !#t~short14;havoc #t~short14;havoc #t~mem12;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=20, #NULL.offset=13, old(#NULL.base)=20, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=18, ~head~0.offset=0] [L987] assume 0 != #t~nondet1; [L987] havoc #t~nondet1; [L987] call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4); [L987] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L987] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4); [L987] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4); [L987] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L987] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0] [L988] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet5=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume !(0 != #t~nondet5); [L990] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L993] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L994-L998] assume !!(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] call #t~mem12 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~short14=true, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume #t~short14; [L996] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, 4 + ~x~0.offset, 4); [L996] #t~short14 := #t~mem13.base == ~x~0.base && #t~mem13.offset == ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~mem13.base=15, #t~mem13.offset=0, #t~short14=false, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume !#t~short14; [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=20, #NULL.offset=13, old(#NULL.base)=20, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=18, ~head~0.offset=0] [L987] assume 0 != #t~nondet1; [L987] havoc #t~nondet1; [L987] call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4); [L987] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L987] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4); [L987] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4); [L987] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L987] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0] [L988] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet5=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume !(0 != #t~nondet5); [L990] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L993] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L994-L998] assume !!(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] call #t~mem12 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~short14=true, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume #t~short14; [L996] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, 4 + ~x~0.offset, 4); [L996] #t~short14 := #t~mem13.base == ~x~0.base && #t~mem13.offset == ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~mem13.base=15, #t~mem13.offset=0, #t~short14=false, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume !#t~short14; [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] COND TRUE __VERIFIER_nondet_int() [L987] head->data = 2 [L987] head->opt = malloc(sizeof(SLL)) [L987] EXPR head->opt [L987] head->opt->next = ((void*)0) [L988] SLL* x = head; VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L994] COND TRUE x != ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L996] EXPR x->data [L996] EXPR x->data == 2 && x->opt == x [L996] EXPR x->opt [L996] EXPR x->data == 2 && x->opt == x VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=2, x->data == 2 && x->opt == x=0, x->opt={15:0}] [L996] COND TRUE !(x->data == 2 && x->opt == x) [L996] __VERIFIER_error() VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] ----- [2018-11-23 01:21:22,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:21:22 BoogieIcfgContainer [2018-11-23 01:21:22,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:21:22,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:21:22,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:21:22,008 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:21:22,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:21:21" (3/4) ... [2018-11-23 01:21:22,011 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|=20, |#NULL.offset|=13, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] RET #104#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=18, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume 0 != #t~nondet1;havoc #t~nondet1;call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~nondet5|=0] [?] assume !(0 != #t~nondet5);havoc #t~nondet5; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0); VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] call #t~mem12 := read~int(~x~0.base, 8 + ~x~0.offset, 4);#t~short14 := 2 == #t~mem12; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem12|=2, |main_#t~short14|=true] [?] assume #t~short14;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, 4 + ~x~0.offset, 4);#t~short14 := #t~mem13.base == ~x~0.base && #t~mem13.offset == ~x~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0, |main_#t~mem12|=2, |main_#t~mem13.base|=15, |main_#t~mem13.offset|=0, |main_#t~short14|=false] [?] assume !#t~short14;havoc #t~short14;havoc #t~mem12;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=18, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=15, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=20, #NULL.offset=13, old(#NULL.base)=20, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=18, ~head~0.offset=0] [L987] assume 0 != #t~nondet1; [L987] havoc #t~nondet1; [L987] call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4); [L987] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L987] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4); [L987] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4); [L987] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L987] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0] [L988] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet5=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume !(0 != #t~nondet5); [L990] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L993] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L994-L998] assume !!(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] call #t~mem12 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~short14=true, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume #t~short14; [L996] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, 4 + ~x~0.offset, 4); [L996] #t~short14 := #t~mem13.base == ~x~0.base && #t~mem13.offset == ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~mem13.base=15, #t~mem13.offset=0, #t~short14=false, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume !#t~short14; [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=20, #NULL.offset=13, old(#NULL.base)=20, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=18, ~head~0.offset=0] [L987] assume 0 != #t~nondet1; [L987] havoc #t~nondet1; [L987] call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4); [L987] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L987] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4); [L987] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4); [L987] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L987] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0] [L988] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~nondet5=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L990] assume !(0 != #t~nondet5); [L990] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L993] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L994-L998] assume !!(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] call #t~mem12 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~short14=true, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume #t~short14; [L996] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, 4 + ~x~0.offset, 4); [L996] #t~short14 := #t~mem13.base == ~x~0.base && #t~mem13.offset == ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, #t~mem12=2, #t~mem13.base=15, #t~mem13.offset=0, #t~short14=false, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assume !#t~short14; [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L996] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, #t~malloc2.base=15, #t~malloc2.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=18, ~head~0!offset=0] [L987] COND TRUE 0 != #t~nondet1 [L987] havoc #t~nondet1; [L987] FCALL call write~int(2, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L987] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L987] FCALL call write~$Pointer$(#t~malloc2, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call #t~mem3 := read~$Pointer$({ base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L987] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0] [L988] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~nondet5=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L990] COND TRUE !(0 != #t~nondet5) [L990] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L993] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L994-L998] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] FCALL call #t~mem12 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L996] #t~short14 := 2 == #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~short14=true, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE #t~short14 [L996] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L996] #t~short14 := #t~mem13 == ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, #t~mem12=2, #t~mem13!base=15, #t~mem13!offset=0, #t~short14=false, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] COND TRUE !#t~short14 [L996] havoc #t~short14; [L996] havoc #t~mem12; [L996] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L996] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, #t~malloc2!base=15, #t~malloc2!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] COND TRUE __VERIFIER_nondet_int() [L987] head->data = 2 [L987] head->opt = malloc(sizeof(SLL)) [L987] EXPR head->opt [L987] head->opt->next = ((void*)0) [L988] SLL* x = head; VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L994] COND TRUE x != ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L996] EXPR x->data [L996] EXPR x->data == 2 && x->opt == x [L996] EXPR x->opt [L996] EXPR x->data == 2 && x->opt == x VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=2, x->data == 2 && x->opt == x=0, x->opt={15:0}] [L996] COND TRUE !(x->data == 2 && x->opt == x) [L996] __VERIFIER_error() VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] ----- [2018-11-23 01:21:22,052 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e2d13c47-1b46-4c5e-a404-4f06cb1ae6ce/bin-2019/utaipan/witness.graphml [2018-11-23 01:21:22,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:21:22,053 INFO L168 Benchmark]: Toolchain (without parser) took 1023.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -92.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:22,054 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:21:22,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:22,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:22,055 INFO L168 Benchmark]: Boogie Preprocessor took 25.55 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 01:21:22,056 INFO L168 Benchmark]: RCFGBuilder took 269.11 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:22,056 INFO L168 Benchmark]: TraceAbstraction took 328.95 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:22,057 INFO L168 Benchmark]: Witness Printer took 44.42 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:21:22,060 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.55 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 269.11 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 328.95 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Witness Printer took 44.42 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 996]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] COND TRUE __VERIFIER_nondet_int() [L987] head->data = 2 [L987] head->opt = malloc(sizeof(SLL)) [L987] EXPR head->opt [L987] head->opt->next = ((void*)0) [L988] SLL* x = head; VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L994] COND TRUE x != ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L996] EXPR x->data [L996] EXPR x->data == 2 && x->opt == x [L996] EXPR x->opt [L996] EXPR x->data == 2 && x->opt == x VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=2, x->data == 2 && x->opt == x=0, x->opt={15:0}] [L996] COND TRUE !(x->data == 2 && x->opt == x) [L996] __VERIFIER_error() VAL [head={18:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...