./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.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_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:26:36,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:26:36,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:26:36,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:26:36,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:26:36,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:26:36,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:26:36,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:26:36,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:26:36,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:26:36,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:26:36,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:26:36,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:26:36,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:26:36,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:26:36,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:26:36,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:26:36,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:26:36,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:26:36,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:26:36,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:26:36,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:26:36,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:26:36,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:26:36,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:26:36,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:26:36,033 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:26:36,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:26:36,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:26:36,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:26:36,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:26:36,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:26:36,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:26:36,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:26:36,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:26:36,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:26:36,037 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 13:26:36,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:26:36,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:26:36,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:26:36,048 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:26:36,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:26:36,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:26:36,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:26:36,049 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:26:36,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:26:36,049 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:26:36,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:26:36,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:26:36,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:26:36,050 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:26:36,050 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:26:36,050 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:26:36,050 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:26:36,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:26:36,050 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:26:36,051 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:26:36,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:26:36,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:26:36,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:26:36,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:26:36,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:26:36,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:26:36,052 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:26:36,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:26:36,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:26:36,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak 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 -> Kojak 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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-11-23 13:26:36,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:26:36,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:26:36,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:26:36,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:26:36,087 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:26:36,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 13:26:36,127 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/data/692fa7cce/7c97e297980f4680b696a45a620b531e/FLAG95add33ed [2018-11-23 13:26:36,592 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:26:36,592 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 13:26:36,598 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/data/692fa7cce/7c97e297980f4680b696a45a620b531e/FLAG95add33ed [2018-11-23 13:26:36,608 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/data/692fa7cce/7c97e297980f4680b696a45a620b531e [2018-11-23 13:26:36,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:26:36,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:26:36,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:26:36,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:26:36,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:26:36,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:36,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ed6b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36, skipping insertion in model container [2018-11-23 13:26:36,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:36,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:26:36,653 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:26:36,842 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:26:36,849 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:26:36,929 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:26:36,953 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:26:36,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36 WrapperNode [2018-11-23 13:26:36,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:26:36,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:26:36,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:26:36,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:26:36,959 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:26:36" (1/1) ... [2018-11-23 13:26:36,969 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:26:36" (1/1) ... [2018-11-23 13:26:36,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:26:36,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:26:36,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:26:36,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:26:36,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:36,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:36,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:36,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:37,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:37,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:37,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... [2018-11-23 13:26:37,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:26:37,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:26:37,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:26:37,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:26:37,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 13:26:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:26:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:26:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:26:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:26:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:26:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:26:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:26:37,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:26:37,461 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:26:37,461 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-11-23 13:26:37,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:37 BoogieIcfgContainer [2018-11-23 13:26:37,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:26:37,462 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:26:37,462 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:26:37,473 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:26:37,473 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:37" (1/1) ... [2018-11-23 13:26:37,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:26:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:26:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-23 13:26:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-23 13:26:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 13:26:37,524 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:26:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:37,632 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 13:26:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:26:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 22 states and 30 transitions. [2018-11-23 13:26:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2018-11-23 13:26:37,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 13:26:37,640 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:26:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:37,699 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 13:26:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:26:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 20 states and 28 transitions. [2018-11-23 13:26:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-11-23 13:26:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:26:37,737 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:26:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:37,863 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 13:26:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:26:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 27 states and 35 transitions. [2018-11-23 13:26:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 13:26:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:26:38,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:26:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:26:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:26:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:26:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 29 states and 40 transitions. [2018-11-23 13:26:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-11-23 13:26:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:26:38,611 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:26:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:26:38,674 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 5 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0.base, 4 + main_~list~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~nondet1|=0] [?] assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] call main_#t~mem7 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem7|=1] [?] assume !!(~unnamed1~0~BLACK == main_#t~mem7);havoc main_#t~mem7; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);call main_#t~mem8 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume ~unnamed1~0~RED == main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;ParallelCodeBlock1: assume !(~unnamed1~0~RED == main_#t~mem8);havoc main_#t~mem8;}EndParallelComposition VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem11.base|=0, |ULTIMATE.start_main_#t~mem11.offset|=0, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] assume main_#t~mem11.base == 0 && main_#t~mem11.offset == 0;havoc main_#t~mem11.base, main_#t~mem11.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] assume !false; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset; [L995] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L995] main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L996] call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 4 + main_~list~0.offset, 4); [L999] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002-L1021] assume !(0 != main_#t~nondet1); [L1002] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1023] main_~end~0.base, main_~end~0.offset := 0, 0; [L1024] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1027] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] call main_#t~mem7 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem7=1, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == main_#t~mem7); [L1028] havoc main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1030-L1040] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); [L1032] call main_#t~mem8 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); [L1032-L1036] assume !(~unnamed1~0~RED == main_#t~mem8); [L1032] havoc main_#t~mem8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem11.base=0, main_#t~mem11.offset=0, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assume main_#t~mem11.base == 0 && main_#t~mem11.offset == 0; [L1038] havoc main_#t~mem11.base, main_#t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset; [L995] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L995] main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L996] call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 4 + main_~list~0.offset, 4); [L999] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002-L1021] assume !(0 != main_#t~nondet1); [L1002] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1023] main_~end~0.base, main_~end~0.offset := 0, 0; [L1024] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1027] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] call main_#t~mem7 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem7=1, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == main_#t~mem7); [L1028] havoc main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1030-L1040] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); [L1032] call main_#t~mem8 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); [L1032-L1036] assume !(~unnamed1~0~RED == main_#t~mem8); [L1032] havoc main_#t~mem8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem11.base=0, main_#t~mem11.offset=0, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assume main_#t~mem11.base == 0 && main_#t~mem11.offset == 0; [L1038] havoc main_#t~mem11.base, main_#t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~malloc5, main_#t~mem6, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_~list~0, main_~end~0; [L995] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L995] main_~list~0 := main_#t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~list~0!base, offset: main_~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~list~0!base, offset: 4 + main_~list~0!offset }, 4); [L999] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != main_#t~nondet1) [L1002] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1023] main_~end~0 := { base: 0, offset: 0 }; [L1024] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] FCALL call main_#t~mem7 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem7=1, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == main_#t~mem7)) [L1028] havoc main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) [L1032] FCALL call main_#t~mem8 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == main_#t~mem8) [L1032] havoc main_#t~mem8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] FCALL call main_#t~mem11 := read~$Pointer$({ base: main_~end~0!base, offset: main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem11!base=0, main_#t~mem11!offset=0, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] COND TRUE main_#t~mem11 == { base: 0, offset: 0 } [L1038] havoc main_#t~mem11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~malloc5, main_#t~mem6, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_~list~0, main_~end~0; [L995] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L995] main_~list~0 := main_#t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~list~0!base, offset: main_~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~list~0!base, offset: 4 + main_~list~0!offset }, 4); [L999] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != main_#t~nondet1) [L1002] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1023] main_~end~0 := { base: 0, offset: 0 }; [L1024] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] FCALL call main_#t~mem7 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem7=1, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == main_#t~mem7)) [L1028] havoc main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) [L1032] FCALL call main_#t~mem8 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == main_#t~mem8) [L1032] havoc main_#t~mem8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] FCALL call main_#t~mem11 := read~$Pointer$({ base: main_~end~0!base, offset: main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem11!base=0, main_#t~mem11!offset=0, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] COND TRUE main_#t~mem11 == { base: 0, offset: 0 } [L1038] havoc main_#t~mem11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list [L1027] COND FALSE !(!(((void*)0) != end)) [L1028] EXPR end->colour [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() ----- [2018-11-23 13:26:38,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:26:38 ImpRootNode [2018-11-23 13:26:38,718 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:26:38,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:26:38,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:26:38,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:26:38,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:37" (3/4) ... [2018-11-23 13:26:38,721 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0.base, 4 + main_~list~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~nondet1|=0] [?] assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] call main_#t~mem7 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem7|=1] [?] assume !!(~unnamed1~0~BLACK == main_#t~mem7);havoc main_#t~mem7; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);call main_#t~mem8 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume ~unnamed1~0~RED == main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;ParallelCodeBlock1: assume !(~unnamed1~0~RED == main_#t~mem8);havoc main_#t~mem8;}EndParallelComposition VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem11.base|=0, |ULTIMATE.start_main_#t~mem11.offset|=0, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] assume main_#t~mem11.base == 0 && main_#t~mem11.offset == 0;havoc main_#t~mem11.base, main_#t~mem11.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] assume !false; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=10, |ULTIMATE.start_main_#t~mem10.offset|=11, |ULTIMATE.start_main_#t~mem9.base|=12, |ULTIMATE.start_main_#t~mem9.offset|=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset; [L995] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L995] main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L996] call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 4 + main_~list~0.offset, 4); [L999] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002-L1021] assume !(0 != main_#t~nondet1); [L1002] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1023] main_~end~0.base, main_~end~0.offset := 0, 0; [L1024] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1027] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] call main_#t~mem7 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem7=1, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == main_#t~mem7); [L1028] havoc main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1030-L1040] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); [L1032] call main_#t~mem8 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); [L1032-L1036] assume !(~unnamed1~0~RED == main_#t~mem8); [L1032] havoc main_#t~mem8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem11.base=0, main_#t~mem11.offset=0, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assume main_#t~mem11.base == 0 && main_#t~mem11.offset == 0; [L1038] havoc main_#t~mem11.base, main_#t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset; [L995] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L995] main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L996] call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 4 + main_~list~0.offset, 4); [L999] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1002-L1021] assume !(0 != main_#t~nondet1); [L1002] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1023] main_~end~0.base, main_~end~0.offset := 0, 0; [L1024] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1027] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] call main_#t~mem7 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem7=1, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == main_#t~mem7); [L1028] havoc main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1030-L1040] assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); [L1032] call main_#t~mem8 := read~int(main_~end~0.base, 4 + main_~end~0.offset, 4); [L1032-L1036] assume !(~unnamed1~0~RED == main_#t~mem8); [L1032] havoc main_#t~mem8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem11.base=0, main_#t~mem11.offset=0, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assume main_#t~mem11.base == 0 && main_#t~mem11.offset == 0; [L1038] havoc main_#t~mem11.base, main_#t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~mem10.base=10, main_#t~mem10.offset=11, main_#t~mem9.base=12, main_#t~mem9.offset=9, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~malloc5, main_#t~mem6, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_~list~0, main_~end~0; [L995] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L995] main_~list~0 := main_#t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~list~0!base, offset: main_~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~list~0!base, offset: 4 + main_~list~0!offset }, 4); [L999] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != main_#t~nondet1) [L1002] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1023] main_~end~0 := { base: 0, offset: 0 }; [L1024] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] FCALL call main_#t~mem7 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem7=1, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == main_#t~mem7)) [L1028] havoc main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) [L1032] FCALL call main_#t~mem8 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == main_#t~mem8) [L1032] havoc main_#t~mem8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] FCALL call main_#t~mem11 := read~$Pointer$({ base: main_~end~0!base, offset: main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem11!base=0, main_#t~mem11!offset=0, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] COND TRUE main_#t~mem11 == { base: 0, offset: 0 } [L1038] havoc main_#t~mem11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~malloc5, main_#t~mem6, main_#t~nondet1, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_~list~0, main_~end~0; [L995] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L995] main_~list~0 := main_#t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~list~0!base, offset: main_~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~list~0!base, offset: 4 + main_~list~0!offset }, 4); [L999] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != main_#t~nondet1) [L1002] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1023] main_~end~0 := { base: 0, offset: 0 }; [L1024] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] FCALL call main_#t~mem7 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem7=1, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == main_#t~mem7)) [L1028] havoc main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != main_~end~0)) [L1032] FCALL call main_#t~mem8 := read~int({ base: main_~end~0!base, offset: 4 + main_~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == main_#t~mem8) [L1032] havoc main_#t~mem8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] FCALL call main_#t~mem11 := read~$Pointer$({ base: main_~end~0!base, offset: main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem11!base=0, main_#t~mem11!offset=0, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] COND TRUE main_#t~mem11 == { base: 0, offset: 0 } [L1038] havoc main_#t~mem11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~mem10!base=10, main_#t~mem10!offset=11, main_#t~mem9!base=12, main_#t~mem9!offset=9, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list [L1027] COND FALSE !(!(((void*)0) != end)) [L1028] EXPR end->colour [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() ----- [2018-11-23 13:26:38,772 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_37082d9b-76a5-41cc-b634-644fbbe1f1ee/bin-2019/ukojak/witness.graphml [2018-11-23 13:26:38,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:26:38,773 INFO L168 Benchmark]: Toolchain (without parser) took 2161.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 957.6 MB in the beginning and 941.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:38,774 INFO L168 Benchmark]: CDTParser took 0.14 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 13:26:38,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:38,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.27 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 13:26:38,776 INFO L168 Benchmark]: Boogie Preprocessor took 18.97 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 13:26:38,776 INFO L168 Benchmark]: RCFGBuilder took 455.72 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: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:38,776 INFO L168 Benchmark]: CodeCheck took 1255.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.2 MB in the end (delta: 140.7 MB). Peak memory consumption was 140.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:38,777 INFO L168 Benchmark]: Witness Printer took 53.25 ms. Allocated memory is still 1.2 GB. Free memory was 944.2 MB in the beginning and 941.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:26:38,781 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 29 locations, 3 error locations. UNSAFE Result, 1.1s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 84 SDslu, 116 SDs, 0 SdLazy, 178 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 216 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 2021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list [L1027] COND FALSE !(!(((void*)0) != end)) [L1028] EXPR end->colour [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.27 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 18.97 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. * RCFGBuilder took 455.72 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: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * CodeCheck took 1255.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.2 MB in the end (delta: 140.7 MB). Peak memory consumption was 140.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.25 ms. Allocated memory is still 1.2 GB. Free memory was 944.2 MB in the beginning and 941.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...