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/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:23:22,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:23:22,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:23:22,233 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:23:22,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:23:22,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:23:22,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:23:22,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:23:22,239 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:23:22,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:23:22,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:23:22,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:23:22,242 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:23:22,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:23:22,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:23:22,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:23:22,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:23:22,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:23:22,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:23:22,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:23:22,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:23:22,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:23:22,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:23:22,258 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:23:22,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:23:22,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:23:22,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:23:22,261 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:23:22,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:23:22,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:23:22,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:23:22,262 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:23:22,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:23:22,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:23:22,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:23:22,272 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:23:22,272 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:23:22,272 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:23:22,272 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:23:22,272 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:23:22,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:23:22,273 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:23:22,273 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:23:22,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:23:22,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:23:22,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:23:22,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:23:22,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:23:22,275 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:23:22,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:23:22,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:23:22,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:23:22,276 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:23:22,277 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:23:22,277 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:23:22,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:23:22,320 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:23:22,323 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:23:22,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:23:22,325 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:23:22,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-24 16:23:22,494 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:23:22,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:23:22,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:23:22,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:23:22,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:23:22,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22, skipping insertion in model container [2018-01-24 16:23:22,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,523 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:23:22,560 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:23:22,677 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:23:22,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:23:22,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22 WrapperNode [2018-01-24 16:23:22,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:23:22,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:23:22,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:23:22,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:23:22,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (1/1) ... [2018-01-24 16:23:22,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:23:22,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:23:22,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:23:22,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:23:22,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:22" (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:23:22,788 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:23:22,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:23:22,789 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 16:23:22,789 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:23:22,789 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:23:22,790 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:23:22,790 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 16:23:22,790 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:23:22,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:23:22,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:23:23,190 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:23:23,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:23:23 BoogieIcfgContainer [2018-01-24 16:23:23,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:23:23,191 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:23:23,191 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:23:23,191 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:23:23,192 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:23:23" (1/1) ... [2018-01-24 16:23:23,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:23:24,407 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:23:24,478 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:23:24,495 INFO L268 AbstractInterpreter]: Visited 123 different actions 213 times. Merged at 45 different actions 52 times. Never widened. Found 8 fixpoints after 6 different actions. Largest state had 44 variables. [2018-01-24 16:23:24,496 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:23:24,497 INFO L168 Benchmark]: Toolchain (without parser) took 2003.13 ms. Allocated memory was 299.9 MB in the beginning and 385.9 MB in the end (delta: 86.0 MB). Free memory was 259.8 MB in the beginning and 256.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:24,498 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 299.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:23:24,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.59 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 248.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:24,498 INFO L168 Benchmark]: Boogie Preprocessor took 33.39 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 246.8 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:23:24,498 INFO L168 Benchmark]: RCFGBuilder took 452.26 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 216.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:24,499 INFO L168 Benchmark]: Abstract Interpretation took 1305.45 ms. Allocated memory was 299.9 MB in the beginning and 385.9 MB in the end (delta: 86.0 MB). Free memory was 216.4 MB in the beginning and 256.5 MB in the end (delta: -40.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:24,501 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.12 ms. Allocated memory is still 299.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.59 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 248.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.39 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 452.26 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 216.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 1305.45 ms. Allocated memory was 299.9 MB in the beginning and 385.9 MB in the end (delta: 86.0 MB). Free memory was 216.4 MB in the beginning and 256.5 MB in the end (delta: -40.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 102 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1281 LocStat_NO_SUPPORTING_DISEQUALITIES : 521 LocStat_NO_DISJUNCTIONS : -204 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 129 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 230 TransStat_NO_SUPPORTING_DISEQUALITIES : 64 TransStat_NO_DISJUNCTIONS : 165 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.379896 RENAME_VARIABLES(MILLISECONDS) : 0.242098 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.164417 PROJECTAWAY(MILLISECONDS) : 0.028551 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001157 DISJOIN(MILLISECONDS) : 0.571778 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.263270 ADD_EQUALITY(MILLISECONDS) : 0.015007 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.080622 #CONJOIN_DISJUNCTIVE : 385 #RENAME_VARIABLES : 816 #UNFREEZE : 0 #CONJOIN : 735 #PROJECTAWAY : 572 #ADD_WEAK_EQUALITY : 36 #DISJOIN : 126 #RENAME_VARIABLES_DISJUNCTIVE : 710 #ADD_EQUALITY : 210 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 51 - 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: [L635] FCALL struct item *list = ((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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] FCALL \read(**plist) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] FCALL \read(**plist) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] FCALL item->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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] FCALL *plist = item - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] FCALL *plist = item - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] FCALL list->data - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND TRUE (item->next) ? item->next->data : malloc(sizeof *item) [L629] FCALL item->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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND TRUE (item->next) ? item->next->data : malloc(sizeof *item) [L629] EXPR, FCALL item->next [L629] FCALL item->next->data - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND TRUE (item->next) ? item->next->data : malloc(sizeof *item) [L629] EXPR, FCALL item->next [L629] FCALL item->next->data - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] FCALL list->next - UnprovableResult [Line: 633]: 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND FALSE !(\read(*list)) [L652] return 0; [L635] FCALL struct item *list = ((void *)0); [L652] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND TRUE !next [L648] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND FALSE !(!next) [L649] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND TRUE !next [L648] EXPR, FCALL \read(*list) [L648] FCALL list->data - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND FALSE !(!next) [L649] EXPR, FCALL \read(*list) [L649] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND TRUE !next [L648] EXPR, FCALL \read(*list) [L648] EXPR, FCALL list->data [L648] FCALL free(list->data) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND TRUE !next [L648] EXPR, FCALL \read(*list) [L648] EXPR, FCALL list->data [L648] FCALL free(list->data) - 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND FALSE !(!next) [L649] EXPR, FCALL \read(*list) [L649] FCALL free(list) [L650] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND FALSE !(!next) [L649] EXPR, FCALL \read(*list) [L649] FCALL free(list) [L650] 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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND TRUE !next [L648] EXPR, FCALL \read(*list) [L648] EXPR, FCALL list->data [L648] FCALL free(list->data) [L649] FCALL \read(*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: [L635] FCALL struct item *list = ((void *)0); [L637] CALL append(&list) [L626] EXPR, FCALL malloc(sizeof *item) [L626] struct item *item = malloc(sizeof *item); [L627] EXPR, FCALL \read(**plist) [L627] FCALL item->next = *plist [L628] EXPR, FCALL item->next [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L630] EXPR, FCALL malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L631] RET, FCALL *plist = item [L637] append(&list) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) [L640] EXPR, FCALL list->next [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) [L641] EXPR, FCALL list->data [L641] FCALL free(list->data) [L642] EXPR, FCALL \read(*list) [L642] FCALL free(list) [L643] FCALL list = next [L645] FCALL \read(*list) [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) [L646] EXPR, FCALL list->next [L646] struct item *next = list->next; [L647] COND TRUE !next [L648] EXPR, FCALL \read(*list) [L648] EXPR, FCALL list->data [L648] FCALL free(list->data) [L649] EXPR, FCALL \read(*list) [L649] FCALL free(list) - 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 - 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 * 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/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-23-24-515.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-23-24-515.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-23-24-515.csv Received shutdown request...