java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:34:15,622 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:34:15,624 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:34:15,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:34:15,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:34:15,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:34:15,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:34:15,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:34:15,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:34:15,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:34:15,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:34:15,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:34:15,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:34:15,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:34:15,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:34:15,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:34:15,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:34:15,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:34:15,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:34:15,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:34:15,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:34:15,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:34:15,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:34:15,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:34:15,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:34:15,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:34:15,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:34:15,689 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:34:15,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:34:15,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:34:15,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:34:15,690 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf [2018-01-24 16:34:15,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:34:15,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:34:15,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:34:15,700 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:34:15,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:34:15,701 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:34:15,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:34:15,701 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:34:15,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:34:15,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:34:15,701 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:34:15,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:34:15,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:34:15,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:34:15,703 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:34:15,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:34:15,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:34:15,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:34:15,704 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:34:15,705 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:34:15,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:34:15,754 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:34:15,759 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:34:15,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:34:15,761 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:34:15,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:34:15,934 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:34:15,941 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:34:15,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:34:15,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:34:15,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:34:15,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:34:15" (1/1) ... [2018-01-24 16:34:15,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e82129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:15, skipping insertion in model container [2018-01-24 16:34:15,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:34:15" (1/1) ... [2018-01-24 16:34:15,973 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:34:16,018 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:34:16,145 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:34:16,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:34:16,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16 WrapperNode [2018-01-24 16:34:16,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:34:16,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:34:16,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:34:16,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:34:16,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:34:16,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:34:16,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:34:16,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:34:16,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:34:16,264 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:34:16,265 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:34:16,265 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:34:16,265 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:34:16,265 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:34:16,265 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:34:16,265 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:34:16,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:34:16,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:34:16,267 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:34:16,746 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:34:16,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:34:16 BoogieIcfgContainer [2018-01-24 16:34:16,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:34:16,748 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:34:16,748 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:34:16,749 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:34:16,750 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:34:16" (1/1) ... [2018-01-24 16:34:16,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:34:19,148 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:34:19,199 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:34:19,206 INFO L268 AbstractInterpreter]: Visited 154 different actions 598 times. Merged at 99 different actions 299 times. Widened at 3 different actions 3 times. Found 22 fixpoints after 16 different actions. Largest state had 48 variables. [2018-01-24 16:34:19,209 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:34:19,210 INFO L168 Benchmark]: Toolchain (without parser) took 3275.94 ms. Allocated memory was 307.2 MB in the beginning and 602.4 MB in the end (delta: 295.2 MB). Free memory was 265.1 MB in the beginning and 524.4 MB in the end (delta: -259.3 MB). Peak memory consumption was 35.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:19,211 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:34:19,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.93 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 252.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:19,211 INFO L168 Benchmark]: Boogie Preprocessor took 42.03 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:19,211 INFO L168 Benchmark]: RCFGBuilder took 532.71 ms. Allocated memory is still 307.2 MB. Free memory was 250.0 MB in the beginning and 217.0 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:19,211 INFO L168 Benchmark]: Abstract Interpretation took 2461.36 ms. Allocated memory was 307.2 MB in the beginning and 602.4 MB in the end (delta: 295.2 MB). Free memory was 217.0 MB in the beginning and 524.4 MB in the end (delta: -307.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:34:19,213 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.18 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.93 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 252.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.03 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 532.71 ms. Allocated memory is still 307.2 MB. Free memory was 250.0 MB in the beginning and 217.0 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2461.36 ms. Allocated memory was 307.2 MB in the beginning and 602.4 MB in the end (delta: 295.2 MB). Free memory was 217.0 MB in the beginning and 524.4 MB in the end (delta: -307.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 112 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1217 LocStat_NO_SUPPORTING_DISEQUALITIES : 357 LocStat_NO_DISJUNCTIONS : -224 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 158 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 211 TransStat_NO_SUPPORTING_DISEQUALITIES : 59 TransStat_NO_DISJUNCTIONS : 172 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.719387 RENAME_VARIABLES(MILLISECONDS) : 0.015449 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.531398 PROJECTAWAY(MILLISECONDS) : 1.818500 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002084 DISJOIN(MILLISECONDS) : 0.624072 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.035451 ADD_EQUALITY(MILLISECONDS) : 0.028648 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009661 #CONJOIN_DISJUNCTIVE : 850 #RENAME_VARIABLES : 1677 #UNFREEZE : 0 #CONJOIN : 1126 #PROJECTAWAY : 938 #ADD_WEAK_EQUALITY : 70 #DISJOIN : 124 #RENAME_VARIABLES_DISJUNCTIVE : 1635 #ADD_EQUALITY : 231 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 47 - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) [L1005] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) [L1005] EXPR, FCALL x->next [L1005] FCALL x->next->prev = x - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) [L1005] EXPR, FCALL x->next [L1005] FCALL x->next->prev = x [L1006] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) [L1005] EXPR, FCALL x->next [L1005] FCALL x->next->prev = x [L1006] EXPR, FCALL x->next [L1006] x = x->next [L1007] FCALL x->data = 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1004] EXPR, FCALL malloc(sizeof(SLL)) [L1004] FCALL x->next = malloc(sizeof(SLL)) [L1005] EXPR, FCALL x->next [L1005] FCALL x->next->prev = x [L1006] EXPR, FCALL x->next [L1006] x = x->next [L1007] FCALL x->data = 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND TRUE 1 != x->data [L1021] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND TRUE 1 != x->data [L1021] EXPR, FCALL x->data [L1021] COND FALSE !(!(0 == x->data)) [L1021] COND FALSE !(0) [L1022] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND TRUE 1 != x->data [L1021] EXPR, FCALL x->data [L1021] COND FALSE !(!(0 == x->data)) [L1021] COND FALSE !(0) [L1022] EXPR, FCALL x->next [L1022] x = x->next [L1019] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND TRUE 1 != x->data [L1032] head = x [L1033] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] EXPR, FCALL x->data [L1036] COND FALSE !(!(1 == x->data)) [L1036] COND FALSE !(0) [L1037] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND TRUE 1 != x->data [L1032] head = x [L1033] EXPR, FCALL x->next [L1033] x = x->next [L1034] FCALL free(head) [L1030] FCALL x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] EXPR, FCALL x->data [L1036] COND FALSE !(!(1 == x->data)) [L1036] COND FALSE !(0) [L1037] EXPR, FCALL x->next [L1037] FCALL free(x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] EXPR, FCALL x->data [L1036] COND FALSE !(!(1 == x->data)) [L1036] COND FALSE !(0) [L1037] EXPR, FCALL x->next [L1037] FCALL free(x->next) [L1038] FCALL free(x) - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND TRUE 1 != x->data [L1032] head = x [L1033] EXPR, FCALL x->next [L1033] x = x->next [L1034] FCALL free(head) [L1030] EXPR, FCALL x->data [L1030] COND TRUE 1 != x->data [L1032] head = x [L1033] EXPR, FCALL x->next [L1033] x = x->next [L1034] FCALL free(head) - UnprovableResult [Line: 990]: 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] EXPR, FCALL x->data [L1036] COND FALSE !(!(1 == x->data)) [L1036] COND FALSE !(0) [L1037] EXPR, FCALL x->next [L1037] FCALL free(x->next) [L1038] FCALL free(x) [L1040] return 0; - 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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND TRUE 1 != x->data [L1032] head = x [L1033] EXPR, FCALL x->next [L1033] x = x->next [L1034] FCALL free(head) [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] EXPR, FCALL x->data [L1036] COND FALSE !(!(1 == x->data)) [L1036] COND FALSE !(0) [L1037] EXPR, FCALL x->next [L1037] FCALL free(x->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: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1017] COND FALSE !(0) [L1019] EXPR, FCALL x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(!(2 == x->data)) [L1026] COND FALSE !(0) [L1028] x = head [L1030] EXPR, FCALL x->data [L1030] COND TRUE 1 != x->data [L1032] head = x [L1033] EXPR, FCALL x->next [L1033] x = x->next [L1034] FCALL free(head) [L1030] EXPR, FCALL x->data [L1030] COND FALSE !(1 != x->data) [L1036] EXPR, FCALL x->data [L1036] COND FALSE !(!(1 == x->data)) [L1036] COND FALSE !(0) [L1037] EXPR, FCALL x->next [L1037] FCALL free(x->next) [L1038] FCALL free(x) - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-34-19-226.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-34-19-226.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-34-19-226.csv Received shutdown request...