java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:34:03,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:34:03,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:34:03,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:34:03,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:34:03,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:34:03,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:34:03,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:34:03,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:34:03,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:34:03,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:34:03,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:34:03,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:34:03,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:34:03,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:34:03,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:34:03,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:34:03,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:34:03,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:34:03,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:34:03,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:34:03,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:34:03,199 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:34:03,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:34:03,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:34:03,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:34:03,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:34:03,203 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:34:03,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:34:03,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:34:03,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:34:03,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf [2018-01-24 16:34:03,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:34:03,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:34:03,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:34:03,215 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:34:03,216 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:34:03,216 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:34:03,216 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:34:03,216 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:34:03,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:34:03,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:34:03,217 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:34:03,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:34:03,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:34:03,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:34:03,218 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:34:03,218 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:34:03,218 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:34:03,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:34:03,219 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:34:03,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:34:03,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:34:03,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:34:03,219 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:34:03,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:34:03,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:34:03,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:34:03,220 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:34:03,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:34:03,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:34:03,221 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:34:03,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:34:03,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:34:03,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:34:03,222 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:34:03,222 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:34:03,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:34:03,271 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:34:03,275 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:34:03,277 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:34:03,277 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:34:03,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:34:03,460 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:34:03,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:34:03,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:34:03,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:34:03,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:34:03,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03, skipping insertion in model container [2018-01-24 16:34:03,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,494 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:34:03,537 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:34:03,658 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:34:03,679 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:34:03,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03 WrapperNode [2018-01-24 16:34:03,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:34:03,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:34:03,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:34:03,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:34:03,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... [2018-01-24 16:34:03,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:34:03,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:34:03,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:34:03,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:34:03,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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-01-24 16:34:03,778 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:34:03,778 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:34:03,778 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:34:03,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:34:03,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:34:03,780 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:34:03,780 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:34:03,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:34:03,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:34:04,295 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:34:04,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:34:04 BoogieIcfgContainer [2018-01-24 16:34:04,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:34:04,297 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:34:04,297 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:34:04,297 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:34:04,298 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:34:04" (1/1) ... [2018-01-24 16:34:04,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:34:07,067 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:34:07,113 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:34:07,124 INFO L268 AbstractInterpreter]: Visited 178 different actions 715 times. Merged at 119 different actions 353 times. Widened at 2 different actions 3 times. Found 35 fixpoints after 26 different actions. Largest state had 54 variables. [2018-01-24 16:34:07,127 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:34:07,129 INFO L168 Benchmark]: Toolchain (without parser) took 3667.89 ms. Allocated memory was 303.6 MB in the beginning and 651.7 MB in the end (delta: 348.1 MB). Free memory was 263.6 MB in the beginning and 423.4 MB in the end (delta: -159.8 MB). Peak memory consumption was 188.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:07,129 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:34:07,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.72 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 250.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:07,130 INFO L168 Benchmark]: Boogie Preprocessor took 38.37 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:07,130 INFO L168 Benchmark]: RCFGBuilder took 568.80 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 211.6 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:07,131 INFO L168 Benchmark]: Abstract Interpretation took 2830.92 ms. Allocated memory was 303.6 MB in the beginning and 651.7 MB in the end (delta: 348.1 MB). Free memory was 211.6 MB in the beginning and 423.4 MB in the end (delta: -211.8 MB). Peak memory consumption was 136.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:07,132 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.72 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 250.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.37 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 568.80 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 211.6 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2830.92 ms. Allocated memory was 303.6 MB in the beginning and 651.7 MB in the end (delta: 348.1 MB). Free memory was 211.6 MB in the beginning and 423.4 MB in the end (delta: -211.8 MB). Peak memory consumption was 136.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 127 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1303 LocStat_NO_SUPPORTING_DISEQUALITIES : 406 LocStat_NO_DISJUNCTIONS : -254 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 182 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 237 TransStat_NO_SUPPORTING_DISEQUALITIES : 69 TransStat_NO_DISJUNCTIONS : 199 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.463183 RENAME_VARIABLES(MILLISECONDS) : 0.193068 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.195652 PROJECTAWAY(MILLISECONDS) : 0.036378 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001614 DISJOIN(MILLISECONDS) : 0.561194 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.222869 ADD_EQUALITY(MILLISECONDS) : 0.018377 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007613 #CONJOIN_DISJUNCTIVE : 1114 #RENAME_VARIABLES : 2179 #UNFREEZE : 0 #CONJOIN : 1394 #PROJECTAWAY : 1156 #ADD_WEAK_EQUALITY : 82 #DISJOIN : 206 #RENAME_VARIABLES_DISJUNCTIVE : 2130 #ADD_EQUALITY : 265 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 57 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] FCALL end->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] FCALL end->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND TRUE __VERIFIER_nondet_int() [L1012] FCALL end->colour = BLACK - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND TRUE RED == end->colour [L1038] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND TRUE __VERIFIER_nondet_int() [L1012] FCALL end->colour = BLACK [L1023] FCALL end->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] EXPR, FCALL end->next [L1018] FCALL end->next->prev = end - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] FCALL end->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] EXPR, FCALL end->next [L1018] FCALL end->next->prev = end [L1019] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND TRUE __VERIFIER_nondet_int() [L1012] FCALL end->colour = BLACK [L1023] EXPR, FCALL end->colour [L1023] COND FALSE !(!(BLACK == end->colour)) [L1023] COND FALSE !(0) [L1024] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] FCALL list->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND TRUE RED == end->colour [L1038] EXPR, FCALL end->next [L1038] end = end->next [L1039] COND FALSE !(!(((void*)0) != end)) [L1039] COND FALSE !(0) [L1040] FCALL end->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND TRUE RED == end->colour [L1038] EXPR, FCALL end->next [L1038] end = end->next [L1039] COND FALSE !(!(((void*)0) != end)) [L1039] COND FALSE !(0) [L1040] FCALL end->colour - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] EXPR, FCALL end->next [L1018] FCALL end->next->prev = end [L1019] EXPR, FCALL end->next [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] EXPR, FCALL end->next [L1018] FCALL end->next->prev = end [L1019] EXPR, FCALL end->next [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] EXPR, FCALL end->next [L1018] FCALL end->next->prev = end [L1019] EXPR, FCALL end->next [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) [L1021] FCALL end->colour = BLACK - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND FALSE !(RED == list->colour) [L1058] FCALL list->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND TRUE RED == list->colour [L1051] FCALL list->next - UnprovableResult [Line: 991]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next [L1058] end = list->next [L1059] FCALL free(list) [L1060] list = end [L1047] COND FALSE !(((void*)0) != list) [L1064] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND TRUE RED == list->colour [L1051] EXPR, FCALL list->next [L1051] end = list->next [L1052] FCALL free(list) [L1053] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND TRUE RED == list->colour [L1051] EXPR, FCALL list->next [L1051] end = list->next [L1052] FCALL free(list) [L1053] FCALL end->next - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND TRUE RED == list->colour [L1051] EXPR, FCALL list->next [L1051] end = list->next [L1052] FCALL free(list) [L1053] EXPR, FCALL end->next [L1053] list = end->next [L1054] FCALL free(end) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next [L1058] end = list->next [L1059] FCALL free(list) [L1060] list = end [L1047] COND TRUE ((void*)0) != list [L1049] FCALL list->colour - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next [L1058] end = list->next [L1059] FCALL free(list) [L1060] list = end [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND TRUE RED == list->colour [L1051] EXPR, FCALL list->next [L1051] end = list->next [L1052] FCALL free(list) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL end->colour [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND TRUE ((void*)0) != end [L1036] EXPR, FCALL end->colour [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next [L1058] end = list->next [L1059] FCALL free(list) [L1060] list = end [L1047] COND TRUE ((void*)0) != list [L1049] EXPR, FCALL list->colour [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next [L1058] end = list->next [L1059] FCALL free(list) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] struct TSLL* end = list; [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1005] FCALL end->next = malloc(sizeof(struct TSLL)) [L1006] EXPR, FCALL end->next [L1006] FCALL end->next->prev = end [L1007] EXPR, FCALL end->next [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED [L1017] EXPR, FCALL malloc(sizeof(struct TSLL)) [L1017] FCALL end->next = malloc(sizeof(struct TSLL)) [L1018] EXPR, FCALL end->next [L1018] FCALL end->next->prev = end [L1019] EXPR, FCALL end->next [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) [L1021] FCALL end->colour = BLACK [L1023] EXPR, FCALL end->colour [L1023] COND FALSE !(!(BLACK == end->colour)) [L1023] COND FALSE !(0) [L1024] EXPR, FCALL end->next [L1024] COND FALSE !(!(((void*)0) == end->next)) [L1024] COND FALSE !(0) [L1025] COND FALSE !(!(((void*)0) != end)) [L1025] COND FALSE !(0) [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list [L1032] COND FALSE !(!(((void*)0) != end)) [L1032] COND FALSE !(0) [L1033] FCALL end->colour - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-34-07-146.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-34-07-146.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-34-07-146.csv Received shutdown request...