./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.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_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/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 dd1b14b919fe0392bfa201e707626cf5228609a3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:07:09,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:07:09,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:07:09,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:07:09,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:07:09,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:07:09,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:07:09,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:07:09,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:07:09,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:07:09,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:07:09,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:07:09,673 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:07:09,674 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:07:09,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:07:09,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:07:09,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:07:09,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:07:09,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:07:09,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:07:09,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:07:09,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:07:09,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:07:09,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:07:09,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:07:09,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:07:09,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:07:09,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:07:09,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:07:09,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:07:09,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:07:09,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:07:09,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:07:09,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:07:09,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:07:09,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:07:09,687 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:07:09,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:07:09,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:07:09,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:07:09,698 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:07:09,698 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:07:09,698 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:07:09,698 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:07:09,698 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:07:09,699 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:07:09,699 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:07:09,699 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:07:09,699 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:07:09,699 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:07:09,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:07:09,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:07:09,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:07:09,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:07:09,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:07:09,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:07:09,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:07:09,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:07:09,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:07:09,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:07:09,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:07:09,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:07:09,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:07:09,701 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:07:09,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:07:09,702 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:07:09,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:07:09,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:07:09,703 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_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/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 -> dd1b14b919fe0392bfa201e707626cf5228609a3 [2018-11-23 14:07:09,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:07:09,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:07:09,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:07:09,742 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:07:09,742 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:07:09,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 14:07:09,783 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/data/66b314d72/b70eb7698ec74201972e9ccf46fbe1e6/FLAGa9fd8bfbc [2018-11-23 14:07:10,227 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:07:10,227 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 14:07:10,237 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/data/66b314d72/b70eb7698ec74201972e9ccf46fbe1e6/FLAGa9fd8bfbc [2018-11-23 14:07:10,248 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/data/66b314d72/b70eb7698ec74201972e9ccf46fbe1e6 [2018-11-23 14:07:10,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:07:10,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:07:10,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:07:10,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:07:10,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:07:10,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7befe0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10, skipping insertion in model container [2018-11-23 14:07:10,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:07:10,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:07:10,485 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:07:10,493 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:07:10,565 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:07:10,597 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:07:10,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10 WrapperNode [2018-11-23 14:07:10,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:07:10,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:07:10,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:07:10,598 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:07:10,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:07:10,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:07:10,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:07:10,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:07:10,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... [2018-11-23 14:07:10,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:07:10,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:07:10,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:07:10,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:07:10,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:07:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:07:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:07:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 14:07:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:07:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:07:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:07:10,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:07:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:07:10,840 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:07:10,840 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 14:07:10,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:10 BoogieIcfgContainer [2018-11-23 14:07:10,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:07:10,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:07:10,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:07:10,843 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:07:10,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:07:10" (1/3) ... [2018-11-23 14:07:10,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65feaea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:07:10, skipping insertion in model container [2018-11-23 14:07:10,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:10" (2/3) ... [2018-11-23 14:07:10,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65feaea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:07:10, skipping insertion in model container [2018-11-23 14:07:10,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:10" (3/3) ... [2018-11-23 14:07:10,846 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 14:07:10,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:07:10,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:07:10,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:07:10,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:07:10,896 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:07:10,896 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:07:10,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:07:10,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:07:10,896 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:07:10,896 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:07:10,896 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:07:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 14:07:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 14:07:10,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:07:10,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:07:10,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:07:10,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:07:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash 846768608, now seen corresponding path program 1 times [2018-11-23 14:07:10,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:07:10,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:07:10,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:07:10,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:07:10,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:07:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:07:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:07:11,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:07:11,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:07:11,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:07:11,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:07:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:07:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:07:11,017 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 14:07:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:07:11,030 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2018-11-23 14:07:11,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:07:11,031 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 14:07:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:07:11,036 INFO L225 Difference]: With dead ends: 43 [2018-11-23 14:07:11,036 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 14:07:11,038 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 14:07:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 14:07:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 14:07:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 14:07:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 14:07:11,060 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2018-11-23 14:07:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:07:11,061 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 14:07:11,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:07:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 14:07:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:07:11,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:07:11,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:07:11,062 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:07:11,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:07:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash -56079215, now seen corresponding path program 1 times [2018-11-23 14:07:11,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:07:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:07:11,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:07:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:07:11,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:07:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:07:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:07:11,114 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] #t~short2 := ~i~0 < 30; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~short2|=true] [?] assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false] [?] assume !#t~short2;havoc #t~short2;havoc #t~nondet1; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem6|=0] [?] assume 1 != #t~mem6;havoc #t~mem6; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={12:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] ----- [2018-11-23 14:07:11,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:07:11 BoogieIcfgContainer [2018-11-23 14:07:11,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:07:11,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:07:11,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:07:11,149 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:07:11,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:10" (3/4) ... [2018-11-23 14:07:11,151 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|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=12, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] #t~short2 := ~i~0 < 30; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~short2|=true] [?] assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false] [?] assume !#t~short2;havoc #t~short2;havoc #t~nondet1; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem6|=0] [?] assume 1 != #t~mem6;havoc #t~mem6; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~a~0.base=12, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=12, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L633-L640] assume !#t~short2; [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L641] call write~int(~i~0, ~p~0.base, ~p~0.offset, 4); [L642] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L645-L651] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L646] call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L646-L648] assume 1 != #t~mem6; [L646] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [L647] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~a~0.base=12, ~a~0.offset=0, ~i~0=0, ~p~0.base=12, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] #t~short2 := ~i~0 < 30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~short2; [L633] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L641] FCALL call write~int(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L642] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L645-L651] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L646] FCALL call #t~mem6 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L646] COND TRUE 1 != #t~mem6 [L646] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L647] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~a~0!base=12, ~a~0!offset=0, ~i~0=0, ~p~0!base=12, ~p~0!offset=0] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={12:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] ----- [2018-11-23 14:07:11,194 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8973e0b9-cd7f-4d77-9ab7-0f565d7416cc/bin-2019/utaipan/witness.graphml [2018-11-23 14:07:11,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:07:11,195 INFO L168 Benchmark]: Toolchain (without parser) took 943.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -110.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:07:11,196 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:07:11,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:07:11,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:07:11,197 INFO L168 Benchmark]: Boogie Preprocessor took 17.89 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 14:07:11,197 INFO L168 Benchmark]: RCFGBuilder took 204.08 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:07:11,197 INFO L168 Benchmark]: TraceAbstraction took 307.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:07:11,197 INFO L168 Benchmark]: Witness Printer took 45.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:07:11,200 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.16 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 345.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.78 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 17.89 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 204.08 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 647]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={12:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={12:0}, i=0, malloc(sizeof(struct node))={12:0}, p={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=30occurred 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 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...