./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/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 3aee1e8d9b723b18f218b6c1185554e637930c5d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:53:46,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:53:46,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:53:46,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:53:46,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:53:46,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:53:46,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:53:46,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:53:46,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:53:46,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:53:46,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:53:46,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:53:46,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:53:46,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:53:46,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:53:46,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:53:46,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:53:46,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:53:46,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:53:46,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:53:46,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:53:46,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:53:46,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:53:46,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:53:46,827 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:53:46,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:53:46,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:53:46,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:53:46,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:53:46,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:53:46,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:53:46,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:53:46,831 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:53:46,831 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:53:46,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:53:46,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:53:46,832 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:53:46,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:53:46,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:53:46,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:53:46,844 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:53:46,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:53:46,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:53:46,845 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:53:46,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:53:46,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:53:46,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:53:46,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:53:46,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:53:46,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:53:46,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:53:46,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:53:46,847 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:53:46,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:53:46,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:53:46,848 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_c041f26d-1fde-4066-8317-d18583d7fea8/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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-11-22 21:53:46,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:53:46,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:53:46,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:53:46,885 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:53:46,886 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:53:46,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-22 21:53:46,934 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/data/faf9dfcdb/cc4e59e63df8480489b9dc8e0af18693/FLAGe06ab8966 [2018-11-22 21:53:47,304 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:53:47,304 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-22 21:53:47,314 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/data/faf9dfcdb/cc4e59e63df8480489b9dc8e0af18693/FLAGe06ab8966 [2018-11-22 21:53:47,323 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/data/faf9dfcdb/cc4e59e63df8480489b9dc8e0af18693 [2018-11-22 21:53:47,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:53:47,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:53:47,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:53:47,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:53:47,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:53:47,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa062a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47, skipping insertion in model container [2018-11-22 21:53:47,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:53:47,371 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:53:47,569 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:53:47,577 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:53:47,647 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:53:47,674 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:53:47,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47 WrapperNode [2018-11-22 21:53:47,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:53:47,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:53:47,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:53:47,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:53:47,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:53:47,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:53:47,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:53:47,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:53:47,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... [2018-11-22 21:53:47,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:53:47,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:53:47,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:53:47,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:53:47,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/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-22 21:53:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:53:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:53:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:53:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:53:47,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:53:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:53:47,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:53:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 21:53:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 21:53:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:53:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:53:47,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:53:47,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:53:47,985 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-22 21:53:47,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:53:47 BoogieIcfgContainer [2018-11-22 21:53:47,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:53:47,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:53:47,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:53:47,989 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:53:47,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:53:47" (1/3) ... [2018-11-22 21:53:47,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c99bd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:53:47, skipping insertion in model container [2018-11-22 21:53:47,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:53:47" (2/3) ... [2018-11-22 21:53:47,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c99bd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:53:47, skipping insertion in model container [2018-11-22 21:53:47,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:53:47" (3/3) ... [2018-11-22 21:53:47,992 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-22 21:53:47,997 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:53:48,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-22 21:53:48,011 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-22 21:53:48,031 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:53:48,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:53:48,031 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:53:48,032 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:53:48,032 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:53:48,032 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:53:48,032 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:53:48,032 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:53:48,032 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:53:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-22 21:53:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 21:53:48,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:53:48,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:48,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:53:48,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash -807935886, now seen corresponding path program 1 times [2018-11-22 21:53:48,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:48,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:48,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:48,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:48,146 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-22 21:53:48,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:53:48,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:53:48,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:53:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:53:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:53:48,159 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-22 21:53:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:53:48,171 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2018-11-22 21:53:48,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:53:48,172 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-22 21:53:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:53:48,177 INFO L225 Difference]: With dead ends: 59 [2018-11-22 21:53:48,177 INFO L226 Difference]: Without dead ends: 27 [2018-11-22 21:53:48,180 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-22 21:53:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-22 21:53:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-22 21:53:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 21:53:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-22 21:53:48,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-22 21:53:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:53:48,203 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-22 21:53:48,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:53:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-22 21:53:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-22 21:53:48,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:53:48,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:48,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:53:48,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash 711422280, now seen corresponding path program 1 times [2018-11-22 21:53:48,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:48,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:48,270 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-22 21:53:48,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:53:48,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:53:48,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:53:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:53:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:53:48,272 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-22 21:53:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:53:48,337 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-22 21:53:48,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:53:48,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-22 21:53:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:53:48,338 INFO L225 Difference]: With dead ends: 35 [2018-11-22 21:53:48,338 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 21:53:48,339 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-22 21:53:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 21:53:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-22 21:53:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 21:53:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-22 21:53:48,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-11-22 21:53:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:53:48,343 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-22 21:53:48,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:53:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-22 21:53:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:53:48,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:53:48,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:48,343 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:53:48,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1678513884, now seen corresponding path program 1 times [2018-11-22 21:53:48,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:48,440 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-22 21:53:48,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:53:48,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:53:48,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:53:48,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:53:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:53:48,441 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-22 21:53:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:53:48,524 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-22 21:53:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:53:48,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-22 21:53:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:53:48,525 INFO L225 Difference]: With dead ends: 51 [2018-11-22 21:53:48,525 INFO L226 Difference]: Without dead ends: 49 [2018-11-22 21:53:48,525 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-22 21:53:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-22 21:53:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-11-22 21:53:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 21:53:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-22 21:53:48,529 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2018-11-22 21:53:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:53:48,529 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-22 21:53:48,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:53:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-22 21:53:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:53:48,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:53:48,530 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:53:48,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:53:48,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1763906605, now seen corresponding path program 1 times [2018-11-22 21:53:48,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:48,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:48,713 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-22 21:53:48,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:53:48,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/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-22 21:53:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:48,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:53:48,780 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-22 21:53:48,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,802 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-22 21:53:48,804 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-22 21:53:48,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,812 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-22 21:53:48,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-22 21:53:48,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:53:48,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:53:48,852 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-22 21:53:48,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:53:48,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:53:48,907 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 41 treesize of output 31 [2018-11-22 21:53:48,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:53:48,913 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-22 21:53:48,913 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,926 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 32 treesize of output 33 [2018-11-22 21:53:48,929 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 12 treesize of output 1 [2018-11-22 21:53:48,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,939 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,951 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:56, output treesize:17 [2018-11-22 21:53:48,971 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-22 21:53:48,973 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-22 21:53:48,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:53:48,985 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-22 21:53:48,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-22 21:53:49,030 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-22 21:53:49,033 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-22 21:53:49,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:49,039 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-22 21:53:49,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:53:49,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:53:49,043 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-22 21:53:49,043 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-22 21:53:49,046 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-22 21:53:49,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:53:49,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-22 21:53:49,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 21:53:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 21:53:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:53:49,072 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2018-11-22 21:53:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:53:49,523 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2018-11-22 21:53:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 21:53:49,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-22 21:53:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:53:49,526 INFO L225 Difference]: With dead ends: 100 [2018-11-22 21:53:49,527 INFO L226 Difference]: Without dead ends: 98 [2018-11-22 21:53:49,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-11-22 21:53:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-22 21:53:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 36. [2018-11-22 21:53:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:53:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 21:53:49,534 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2018-11-22 21:53:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:53:49,535 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 21:53:49,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 21:53:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 21:53:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:53:49,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:53:49,535 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-22 21:53:49,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:53:49,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1644345819, now seen corresponding path program 1 times [2018-11-22 21:53:49,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:49,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:49,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:53:49,624 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-22 21:53:49,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:53:49,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:53:49,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:53:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:53:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:53:49,626 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2018-11-22 21:53:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:53:49,672 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-22 21:53:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:53:49,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-22 21:53:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:53:49,673 INFO L225 Difference]: With dead ends: 52 [2018-11-22 21:53:49,673 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:53:49,674 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-22 21:53:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:53:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-22 21:53:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 21:53:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-22 21:53:49,679 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-11-22 21:53:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:53:49,679 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-22 21:53:49,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:53:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-22 21:53:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:53:49,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:53:49,680 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-22 21:53:49,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:53:49,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:53:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1644286237, now seen corresponding path program 1 times [2018-11-22 21:53:49,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:53:49,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:53:49,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:49,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:53:49,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:53:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:53:49,709 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #118#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~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~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |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=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~mem7|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~mem8|=1] [?] assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~mem11.base|=0, |main_#t~mem11.offset|=0] [?] assume #t~mem11.base == 0 && #t~mem11.offset == 0;havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~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=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem7=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem8=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem11.base=0, #t~mem11.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assume #t~mem11.base == 0 && #t~mem11.offset == 0; [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~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=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem7=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem8=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem11.base=0, #t~mem11.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assume #t~mem11.base == 0 && #t~mem11.offset == 0; [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={11:0}, end->next={0:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] ----- [2018-11-22 21:53:49,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:53:49 BoogieIcfgContainer [2018-11-22 21:53:49,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:53:49,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:53:49,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:53:49,741 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:53:49,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:53:47" (3/4) ... [2018-11-22 21:53:49,744 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #118#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~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~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |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=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~mem7|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~mem8|=1] [?] assume !(~unnamed1~0~RED == #t~mem8);havoc #t~mem8; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0, |main_#t~mem11.base|=0, |main_#t~mem11.offset|=0] [?] assume #t~mem11.base == 0 && #t~mem11.offset == 0;havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=11, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~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=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem7=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem8=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem11.base=0, #t~mem11.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assume #t~mem11.base == 0 && #t~mem11.offset == 0; [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L995] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L995] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L996] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L997] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~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=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~nondet1=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1002-L1021] assume !(0 != #t~nondet1); [L1002] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1023] ~end~0.base, ~end~0.offset := 0, 0; [L1024] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1027] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem7=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1028] assume !!(~unnamed1~0~BLACK == #t~mem7); [L1028] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1030-L1040] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1032] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem8=1, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1032-L1036] assume !(~unnamed1~0~RED == #t~mem8); [L1032] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, #t~mem11.base=0, #t~mem11.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assume #t~mem11.base == 0 && #t~mem11.offset == 0; [L1038] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=11, #t~malloc0.offset=0, ~end~0.base=11, ~end~0.offset=0, ~list~0.base=11, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L995] ~list~0 := #t~malloc0; [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L997] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L999] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~nondet1=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1002-L1021] COND TRUE !(0 != #t~nondet1) [L1002] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1023] ~end~0 := { base: 0, offset: 0 }; [L1024] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] FCALL call #t~mem7 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem7=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1028] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem7)) [L1028] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1030-L1040] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1032] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem8=1, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1032] COND FALSE !(~unnamed1~0~RED == #t~mem8) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, #t~mem11!base=0, #t~mem11!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] COND TRUE #t~mem11 == { base: 0, offset: 0 } [L1038] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=11, #t~malloc0!offset=0, ~end~0!base=11, ~end~0!offset=0, ~list~0!base=11, ~list~0!offset=0] [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={11:0}, end->next={0:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] ----- [2018-11-22 21:53:49,794 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c041f26d-1fde-4066-8317-d18583d7fea8/bin-2019/uautomizer/witness.graphml [2018-11-22 21:53:49,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:53:49,795 INFO L168 Benchmark]: Toolchain (without parser) took 2468.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 957.6 MB in the beginning and 861.2 MB in the end (delta: 96.5 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:49,796 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:53:49,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:49,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.03 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:49,797 INFO L168 Benchmark]: Boogie Preprocessor took 25.02 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-22 21:53:49,797 INFO L168 Benchmark]: RCFGBuilder took 264.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:49,798 INFO L168 Benchmark]: TraceAbstraction took 1754.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 864.5 MB in the end (delta: 245.5 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:49,798 INFO L168 Benchmark]: Witness Printer took 52.86 ms. Allocated memory is still 1.2 GB. Free memory was 864.5 MB in the beginning and 861.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:53:49,800 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.03 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.02 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 264.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1754.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 864.5 MB in the end (delta: 245.5 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. * Witness Printer took 52.86 ms. Allocated memory is still 1.2 GB. Free memory was 864.5 MB in the beginning and 861.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={11:0}, end->next={0:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. UNSAFE Result, 1.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 220 SDslu, 326 SDs, 0 SdLazy, 253 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 93 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 6 QuantifiedInterpolants, 8452 SizeOfPredicates, 10 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 25 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...