./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-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_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f270b702de634d3ad2ee5a400388c6410a4cf10 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:47,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:22:47,135 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:22:47,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:22:47,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:22:47,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:22:47,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:22:47,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:22:47,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:22:47,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:22:47,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:22:47,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:22:47,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:22:47,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:22:47,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:22:47,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:22:47,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:22:47,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:22:47,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:22:47,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:22:47,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:22:47,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:22:47,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:22:47,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:22:47,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:22:47,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:22:47,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:22:47,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:22:47,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:22:47,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:22:47,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:22:47,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:22:47,161 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:22:47,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:22:47,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:22:47,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:22:47,163 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 14:22:47,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:22:47,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:22:47,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:22:47,170 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:22:47,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:22:47,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:22:47,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:22:47,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:22:47,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:22:47,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:22:47,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:22:47,172 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:22:47,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:22:47,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:22:47,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:22:47,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:22:47,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:22:47,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:22:47,174 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_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer 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 -> Automizer 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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2018-11-23 14:22:47,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:22:47,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:22:47,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:22:47,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:22:47,208 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:22:47,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 14:22:47,246 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/data/66ef8bfdf/19e60f692cb14f5e9d6a554344f37931/FLAG0df4de9c7 [2018-11-23 14:22:47,587 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:22:47,588 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 14:22:47,596 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/data/66ef8bfdf/19e60f692cb14f5e9d6a554344f37931/FLAG0df4de9c7 [2018-11-23 14:22:47,606 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/data/66ef8bfdf/19e60f692cb14f5e9d6a554344f37931 [2018-11-23 14:22:47,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:22:47,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:22:47,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:47,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:22:47,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:22:47,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15534403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47, skipping insertion in model container [2018-11-23 14:22:47,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:22:47,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:22:47,836 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:47,843 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:22:47,922 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:47,951 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:22:47,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47 WrapperNode [2018-11-23 14:22:47,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:47,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:47,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:22:47,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:22:47,958 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:22:47" (1/1) ... [2018-11-23 14:22:47,966 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:22:47" (1/1) ... [2018-11-23 14:22:47,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:47,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:22:47,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:22:47,972 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:22:47,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... [2018-11-23 14:22:47,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:22:47,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:22:47,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:22:47,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:22:47,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/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:22:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:22:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:22:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:22:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:22:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:22:48,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:22:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:22:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:22:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:22:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:22:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:22:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:22:48,286 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:22:48,286 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 14:22:48,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:48 BoogieIcfgContainer [2018-11-23 14:22:48,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:22:48,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:22:48,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:22:48,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:22:48,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:22:47" (1/3) ... [2018-11-23 14:22:48,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c93bce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:22:48, skipping insertion in model container [2018-11-23 14:22:48,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:47" (2/3) ... [2018-11-23 14:22:48,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c93bce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:22:48, skipping insertion in model container [2018-11-23 14:22:48,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:48" (3/3) ... [2018-11-23 14:22:48,292 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-23 14:22:48,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:22:48,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 14:22:48,318 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 14:22:48,341 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:22:48,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:22:48,342 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:22:48,342 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:22:48,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:22:48,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:22:48,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:22:48,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:22:48,342 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:22:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 14:22:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:22:48,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:48,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:48,364 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:48,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash -807935886, now seen corresponding path program 1 times [2018-11-23 14:22:48,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:48,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:48,466 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:22:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:22:48,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:22:48,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:22:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:22:48,479 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 14:22:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:48,495 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2018-11-23 14:22:48,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:22:48,497 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 14:22:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:48,503 INFO L225 Difference]: With dead ends: 59 [2018-11-23 14:22:48,504 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 14:22:48,506 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:22:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 14:22:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 14:22:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 14:22:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 14:22:48,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-23 14:22:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:48,527 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 14:22:48,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:22:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 14:22:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:22:48,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:48,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:48,528 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:48,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash 711422280, now seen corresponding path program 1 times [2018-11-23 14:22:48,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:48,597 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:22:48,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:48,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:22:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:22:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:22:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:22:48,599 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-23 14:22:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:48,671 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 14:22:48,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:22:48,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 14:22:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:48,673 INFO L225 Difference]: With dead ends: 35 [2018-11-23 14:22:48,673 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 14:22:48,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:22:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 14:22:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-23 14:22:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 14:22:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 14:22:48,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-11-23 14:22:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:48,677 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 14:22:48,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:22:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 14:22:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:22:48,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:48,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:48,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:48,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:48,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1678513884, now seen corresponding path program 1 times [2018-11-23 14:22:48,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:48,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:48,794 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:22:48,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:48,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:22:48,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:22:48,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:22:48,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:22:48,796 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-23 14:22:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:48,881 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 14:22:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:22:48,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 14:22:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:48,882 INFO L225 Difference]: With dead ends: 51 [2018-11-23 14:22:48,882 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 14:22:48,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:22:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 14:22:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-11-23 14:22:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 14:22:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 14:22:48,888 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2018-11-23 14:22:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:48,888 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 14:22:48,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:22:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 14:22:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:22:48,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:48,889 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:48,889 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:48,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1763906605, now seen corresponding path program 1 times [2018-11-23 14:22:48,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:48,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:49,053 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 14:22:49,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:22:49,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:22:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:49,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:49,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 14:22:49,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 14:22:49,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 14:22:49,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 14:22:49,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:49,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:49,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:22:49,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-23 14:22:49,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 14:22:49,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 14:22:49,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 14:22:49,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,279 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,299 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:49,307 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:49,323 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:49,327 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:49,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2018-11-23 14:22:49,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:49,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 14:22:49,355 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-23 14:22:49,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 14:22:49,372 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 14:22:49,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-11-23 14:22:49,395 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 14:22:49,403 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:22:49,414 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:22:49,433 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:22:49,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,451 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:108, output treesize:17 [2018-11-23 14:22:49,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 14:22:49,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 14:22:49,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:49,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-23 14:22:49,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 14:22:49,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 14:22:49,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 14:22:49,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:49,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-23 14:22:49,546 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 14:22:49,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:22:49,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 14:22:49,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 14:22:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 14:22:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:22:49,573 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2018-11-23 14:22:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:49,969 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2018-11-23 14:22:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:22:49,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 14:22:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:49,972 INFO L225 Difference]: With dead ends: 93 [2018-11-23 14:22:49,972 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 14:22:49,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-23 14:22:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 14:22:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 38. [2018-11-23 14:22:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 14:22:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 14:22:49,979 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-11-23 14:22:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:49,979 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 14:22:49,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 14:22:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 14:22:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:22:49,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:49,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:49,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:49,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1644345819, now seen corresponding path program 1 times [2018-11-23 14:22:49,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:49,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:49,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:50,069 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:22:50,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:50,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:22:50,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:22:50,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:22:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:22:50,070 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 14:22:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:50,139 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-23 14:22:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:22:50,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 14:22:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:50,140 INFO L225 Difference]: With dead ends: 54 [2018-11-23 14:22:50,140 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 14:22:50,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:22:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 14:22:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-11-23 14:22:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 14:22:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 14:22:50,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 19 [2018-11-23 14:22:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:50,145 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 14:22:50,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:22:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 14:22:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:22:50,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:50,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:50,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:50,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1644286237, now seen corresponding path program 1 times [2018-11-23 14:22:50,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:50,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:50,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:50,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:50,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:50,175 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=18, |#NULL.offset|=13, |old(#NULL.base)|=18, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=18, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=18, |old(#NULL.offset)|=13] [?] RET #118#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~mem9|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~mem10|=1] [?] assume !(~unnamed1~0~RED == #t~mem10);havoc #t~mem10; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~mem13.base|=0, |main_#t~mem13.offset|=0] [?] assume #t~mem13.base == 0 && #t~mem13.offset == 0;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=18, #NULL.offset=13, old(#NULL.base)=18, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem9=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem10=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem13.base=0, #t~mem13.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assume #t~mem13.base == 0 && #t~mem13.offset == 0; [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=18, #NULL.offset=13, old(#NULL.base)=18, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem9=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem10=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem13.base=0, #t~mem13.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assume #t~mem13.base == 0 && #t~mem13.offset == 0; [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={17:0}, end->next={0:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] ----- [2018-11-23 14:22:50,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:22:50 BoogieIcfgContainer [2018-11-23 14:22:50,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:22:50,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:22:50,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:22:50,215 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:22:50,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:48" (3/4) ... [2018-11-23 14:22:50,217 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|=18, |#NULL.offset|=13, |old(#NULL.base)|=18, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=18, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=18, |old(#NULL.offset)|=13] [?] RET #118#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~mem9|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem9);havoc #t~mem9; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~mem10|=1] [?] assume !(~unnamed1~0~RED == #t~mem10);havoc #t~mem10; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0, |main_#t~mem13.base|=0, |main_#t~mem13.offset|=0] [?] assume #t~mem13.base == 0 && #t~mem13.offset == 0;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~end~0.base=17, main_~end~0.offset=0, main_~list~0.base=17, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=17, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=18, #NULL.offset=13, old(#NULL.base)=18, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem9=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem10=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem13.base=0, #t~mem13.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assume #t~mem13.base == 0 && #t~mem13.offset == 0; [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=18, #NULL.offset=13, old(#NULL.base)=18, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L994] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L999] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1002-L1023] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1025] ~end~0.base, ~end~0.offset := 0, 0; [L1026] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1029] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] call #t~mem9 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem9=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1030] assume !!(~unnamed1~0~BLACK == #t~mem9); [L1030] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1032-L1042] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1034] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem10=1, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1034-L1038] assume !(~unnamed1~0~RED == #t~mem10); [L1034] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, #t~mem13.base=0, #t~mem13.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assume #t~mem13.base == 0 && #t~mem13.offset == 0; [L1040] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [L1040] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=17, #t~malloc0.offset=0, ~end~0.base=17, ~end~0.offset=0, ~list~0.base=17, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=13, old(#NULL!base)=18, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L994] ~list~0 := #t~malloc0; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1002-L1023] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1025] ~end~0 := { base: 0, offset: 0 }; [L1026] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1029] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem9=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1030] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem9)) [L1030] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1032-L1042] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1034] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem10=1, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem10) [L1034] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] FCALL call #t~mem13 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] COND TRUE #t~mem13 == { base: 0, offset: 0 } [L1040] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L1040] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=17, #t~malloc0!offset=0, ~end~0!base=17, ~end~0!offset=0, ~list~0!base=17, ~list~0!offset=0] [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={17:0}, end->next={0:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] ----- [2018-11-23 14:22:50,270 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cea6f00c-852e-43d1-8520-34dc779f8690/bin-2019/uautomizer/witness.graphml [2018-11-23 14:22:50,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:22:50,271 INFO L168 Benchmark]: Toolchain (without parser) took 2662.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:22:50,272 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:22:50,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:50,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:50,273 INFO L168 Benchmark]: Boogie Preprocessor took 23.16 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:22:50,273 INFO L168 Benchmark]: RCFGBuilder took 291.46 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:50,274 INFO L168 Benchmark]: TraceAbstraction took 1927.92 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: -26.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:22:50,274 INFO L168 Benchmark]: Witness Printer took 55.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:50,279 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.16 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 291.46 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1927.92 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: -26.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 55.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={17:0}, end->next={0:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. UNSAFE Result, 1.8s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 189 SDslu, 294 SDs, 0 SdLazy, 230 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, 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, 5 MinimizatonAttempts, 84 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 6 QuantifiedInterpolants, 8564 SizeOfPredicates, 11 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...