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/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:55,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:55,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:55,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:55,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:55,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:55,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:55,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:55,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:55,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:55,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:55,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:55,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:55,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:55,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:55,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:55,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:55,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:55,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:55,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:55,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:55,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:55,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:55,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:55,787 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:55,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:55,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:55,789 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:55,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:55,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:55,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:55,790 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:28:55,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:55,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:55,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:55,801 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:55,801 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:55,801 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:55,801 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:55,802 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:55,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:55,802 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:55,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:55,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:55,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:55,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:55,803 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:55,804 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:55,804 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:55,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:55,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:55,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:55,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:55,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:55,805 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:55,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:55,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:55,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:55,806 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:55,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:55,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:55,806 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:55,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:55,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:55,807 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:55,808 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:55,808 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:55,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:55,854 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:55,859 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:55,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:55,861 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:55,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-01-24 16:28:56,059 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:56,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:56,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:56,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:56,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:56,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6a7c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56, skipping insertion in model container [2018-01-24 16:28:56,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,095 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:56,134 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:56,252 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:56,276 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:56,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56 WrapperNode [2018-01-24 16:28:56,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:56,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:56,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:56,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:56,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:56,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:56,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:56,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:56,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:56" (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:28:56,363 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:56,364 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:56,364 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 16:28:56,364 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:56,364 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:28:56,364 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:28:56,364 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:56,365 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:56,365 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:56,365 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:56,365 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:56,365 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:56,365 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 16:28:56,366 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:56,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:56,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:56,775 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:56,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:56 BoogieIcfgContainer [2018-01-24 16:28:56,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:56,776 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:56,776 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:56,776 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:56,777 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:56" (1/1) ... [2018-01-24 16:28:56,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:28:57,769 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:28:57,795 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:28:57,817 INFO L268 AbstractInterpreter]: Visited 109 different actions 191 times. Merged at 35 different actions 44 times. Never widened. Found 7 fixpoints after 7 different actions. Largest state had 42 variables. [2018-01-24 16:28:57,820 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:28:57,821 INFO L168 Benchmark]: Toolchain (without parser) took 1760.88 ms. Allocated memory was 302.0 MB in the beginning and 379.1 MB in the end (delta: 77.1 MB). Free memory was 258.7 MB in the beginning and 218.2 MB in the end (delta: 40.6 MB). Peak memory consumption was 117.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:57,822 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:57,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.91 ms. Allocated memory is still 302.0 MB. Free memory was 258.7 MB in the beginning and 246.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:57,822 INFO L168 Benchmark]: Boogie Preprocessor took 33.15 ms. Allocated memory is still 302.0 MB. Free memory is still 246.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:57,823 INFO L168 Benchmark]: RCFGBuilder took 457.17 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 217.9 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:57,823 INFO L168 Benchmark]: Abstract Interpretation took 1043.76 ms. Allocated memory was 302.0 MB in the beginning and 379.1 MB in the end (delta: 77.1 MB). Free memory was 217.9 MB in the beginning and 218.2 MB in the end (delta: -279.6 kB). Peak memory consumption was 76.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:57,825 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.91 ms. Allocated memory is still 302.0 MB. Free memory was 258.7 MB in the beginning and 246.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.15 ms. Allocated memory is still 302.0 MB. Free memory is still 246.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 457.17 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 217.9 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 1043.76 ms. Allocated memory was 302.0 MB in the beginning and 379.1 MB in the end (delta: 77.1 MB). Free memory was 217.9 MB in the beginning and 218.2 MB in the end (delta: -279.6 kB). Peak memory consumption was 76.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 91 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1148 LocStat_NO_SUPPORTING_DISEQUALITIES : 509 LocStat_NO_DISJUNCTIONS : -182 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 115 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 205 TransStat_NO_SUPPORTING_DISEQUALITIES : 49 TransStat_NO_DISJUNCTIONS : 142 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.186954 RENAME_VARIABLES(MILLISECONDS) : 0.206605 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.157960 PROJECTAWAY(MILLISECONDS) : 0.140714 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000730 DISJOIN(MILLISECONDS) : 0.546876 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.231352 ADD_EQUALITY(MILLISECONDS) : 0.013544 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.030223 #CONJOIN_DISJUNCTIVE : 295 #RENAME_VARIABLES : 597 #UNFREEZE : 0 #CONJOIN : 563 #PROJECTAWAY : 439 #ADD_WEAK_EQUALITY : 35 #DISJOIN : 92 #RENAME_VARIABLES_DISJUNCTIVE : 546 #ADD_EQUALITY : 193 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 37 - 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: [L620] int c = 0; [L637] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] FCALL list->data - UnprovableResult [Line: 635]: 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND FALSE !(length > 0) [L656] return 0; [L637] FCALL struct item *list = ((void *)0); [L656] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] EXPR, FCALL list->next [L651] struct item *next = list->next; [L652] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] FCALL free(list->data) [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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] FCALL free(list->data) [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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] EXPR, FCALL list->next [L651] struct item *next = list->next; [L652] EXPR, FCALL \read(*list) [L652] FCALL free(list) [L653] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] EXPR, FCALL list->next [L651] struct item *next = list->next; [L652] EXPR, FCALL \read(*list) [L652] FCALL free(list) [L653] FCALL list = 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] FCALL free(list->data) [L646] EXPR, FCALL \read(*list) [L646] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND TRUE __VERIFIER_nondet_int() && c < 20 [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND TRUE (item->next) ? item->next->data : malloc(sizeof *item) [L631] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] FCALL free(list->data) [L646] EXPR, FCALL \read(*list) [L646] FCALL free(list) [L647] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 [L644] EXPR, FCALL \read(*list) [L644] EXPR, FCALL list->next [L644] struct item *next = list->next; [L645] EXPR, FCALL \read(*list) [L645] EXPR, FCALL list->data [L645] FCALL free(list->data) [L646] EXPR, FCALL \read(*list) [L646] FCALL free(list) [L647] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND TRUE __VERIFIER_nondet_int() && c < 20 [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND TRUE (item->next) ? item->next->data : malloc(sizeof *item) [L631] EXPR, FCALL item->next [L631] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND TRUE __VERIFIER_nondet_int() && c < 20 [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND TRUE (item->next) ? item->next->data : malloc(sizeof *item) [L631] EXPR, FCALL item->next [L631] 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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] EXPR, FCALL list->next [L651] struct item *next = list->next; [L652] EXPR, FCALL \read(*list) [L652] FCALL free(list) [L653] FCALL list = next [L654] length-- [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] FCALL list->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: [L620] int c = 0; [L637] FCALL struct item *list = ((void *)0); [L638] int length = 0; [L640] CALL append(&list) [L627] c++ [L628] EXPR, FCALL malloc(sizeof *item) [L628] struct item *item = malloc(sizeof *item); [L629] EXPR, FCALL \read(**plist) [L629] FCALL item->next = *plist [L630] EXPR, FCALL item->next [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) [L632] EXPR, FCALL malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L633] RET, FCALL *plist = item [L640] append(&list) [L641] length++ [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND FALSE !(length > 0) [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] EXPR, FCALL list->next [L651] struct item *next = list->next; [L652] EXPR, FCALL \read(*list) [L652] FCALL free(list) [L653] FCALL list = next [L654] length-- [L650] COND TRUE length > 0 [L651] EXPR, FCALL \read(*list) [L651] EXPR, FCALL list->next [L651] struct item *next = list->next; [L652] EXPR, FCALL \read(*list) [L652] 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]: 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]: 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 * 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-28-57-836.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-28-57-836.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-28-57-836.csv Received shutdown request...