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/sll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:34:47,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:34:47,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:34:47,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:34:47,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:34:47,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:34:47,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:34:47,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:34:47,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:34:47,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:34:47,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:34:47,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:34:47,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:34:47,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:34:47,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:34:47,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:34:47,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:34:47,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:34:47,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:34:47,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:34:47,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:34:47,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:34:47,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:34:47,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:34:47,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:34:47,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:34:47,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:34:47,579 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:34:47,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:34:47,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:34:47,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:34:47,581 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:47,590 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:34:47,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:34:47,591 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:34:47,591 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:34:47,591 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:34:47,591 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:34:47,592 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:34:47,592 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:34:47,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:34:47,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:34:47,592 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:34:47,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:34:47,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:34:47,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:34:47,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:34:47,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:34:47,594 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:34:47,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:34:47,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:34:47,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:34:47,595 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:34:47,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:34:47,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:34:47,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:34:47,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:34:47,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:34:47,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:34:47,597 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:34:47,597 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:34:47,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:34:47,644 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:34:47,647 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:34:47,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:34:47,649 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:34:47,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:34:47,818 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:34:47,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:34:47,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:34:47,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:34:47,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:34:47,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:34:47" (1/1) ... [2018-01-24 16:34:47,834 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:47, skipping insertion in model container [2018-01-24 16:34:47,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:34:47" (1/1) ... [2018-01-24 16:34:47,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:34:47,891 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:34:48,019 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:34:48,042 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:34:48,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:48 WrapperNode [2018-01-24 16:34:48,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:34:48,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:34:48,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:34:48,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:34:48,070 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:48" (1/1) ... [2018-01-24 16:34:48,070 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:48" (1/1) ... [2018-01-24 16:34:48,082 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:48" (1/1) ... [2018-01-24 16:34:48,082 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:48" (1/1) ... [2018-01-24 16:34:48,087 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:48" (1/1) ... [2018-01-24 16:34:48,090 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:48" (1/1) ... [2018-01-24 16:34:48,092 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:48" (1/1) ... [2018-01-24 16:34:48,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:34:48,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:34:48,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:34:48,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:34:48,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:34:48" (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:48,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:34:48,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:34:48,148 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:34:48,148 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:34:48,149 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:34:48,150 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:34:48,150 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:34:48,150 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:34:48,150 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:34:48,575 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:34:48,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:34:48 BoogieIcfgContainer [2018-01-24 16:34:48,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:34:48,577 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:34:48,577 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:34:48,577 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:34:48,578 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:48" (1/1) ... [2018-01-24 16:34:48,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:34:51,282 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:34:51,321 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:34:51,329 INFO L268 AbstractInterpreter]: Visited 137 different actions 635 times. Merged at 87 different actions 336 times. Widened at 3 different actions 6 times. Found 21 fixpoints after 13 different actions. Largest state had 44 variables. [2018-01-24 16:34:51,331 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:34:51,332 INFO L168 Benchmark]: Toolchain (without parser) took 3514.20 ms. Allocated memory was 299.4 MB in the beginning and 620.2 MB in the end (delta: 320.9 MB). Free memory was 259.4 MB in the beginning and 345.4 MB in the end (delta: -86.0 MB). Peak memory consumption was 234.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:51,333 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:34:51,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.74 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 246.4 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:51,333 INFO L168 Benchmark]: Boogie Preprocessor took 40.43 ms. Allocated memory is still 299.4 MB. Free memory was 246.4 MB in the beginning and 244.4 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:51,334 INFO L168 Benchmark]: RCFGBuilder took 481.94 ms. Allocated memory is still 299.4 MB. Free memory was 244.4 MB in the beginning and 214.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:51,334 INFO L168 Benchmark]: Abstract Interpretation took 2755.05 ms. Allocated memory was 299.4 MB in the beginning and 620.2 MB in the end (delta: 320.9 MB). Free memory was 214.8 MB in the beginning and 345.4 MB in the end (delta: -130.7 MB). Peak memory consumption was 190.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:34:51,335 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.13 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.74 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 246.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.43 ms. Allocated memory is still 299.4 MB. Free memory was 246.4 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 481.94 ms. Allocated memory is still 299.4 MB. Free memory was 244.4 MB in the beginning and 214.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2755.05 ms. Allocated memory was 299.4 MB in the beginning and 620.2 MB in the end (delta: 320.9 MB). Free memory was 214.8 MB in the beginning and 345.4 MB in the end (delta: -130.7 MB). Peak memory consumption was 190.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 98 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1073 LocStat_NO_SUPPORTING_DISEQUALITIES : 325 LocStat_NO_DISJUNCTIONS : -196 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 141 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 186 TransStat_NO_SUPPORTING_DISEQUALITIES : 54 TransStat_NO_DISJUNCTIONS : 150 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.406597 RENAME_VARIABLES(MILLISECONDS) : 0.313778 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.380262 PROJECTAWAY(MILLISECONDS) : 0.066310 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002087 DISJOIN(MILLISECONDS) : 0.184342 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.343132 ADD_EQUALITY(MILLISECONDS) : 0.030671 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010783 #CONJOIN_DISJUNCTIVE : 1041 #RENAME_VARIABLES : 2089 #UNFREEZE : 0 #CONJOIN : 1310 #PROJECTAWAY : 1097 #ADD_WEAK_EQUALITY : 52 #DISJOIN : 204 #RENAME_VARIABLES_DISJUNCTIVE : 2027 #ADD_EQUALITY : 194 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 42 - 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND TRUE __VERIFIER_nondet_int() [L1002] EXPR, FCALL malloc(sizeof(SLL)) [L1002] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND TRUE __VERIFIER_nondet_int() [L1002] EXPR, FCALL malloc(sizeof(SLL)) [L1002] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND TRUE __VERIFIER_nondet_int() [L1002] EXPR, FCALL malloc(sizeof(SLL)) [L1002] FCALL x->next = malloc(sizeof(SLL)) [L1003] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND TRUE __VERIFIER_nondet_int() [L1002] EXPR, FCALL malloc(sizeof(SLL)) [L1002] FCALL x->next = malloc(sizeof(SLL)) [L1003] EXPR, FCALL x->next [L1003] x = x->next [L1004] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND TRUE 1 != x->data [L1017] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND TRUE 1 != x->data [L1017] EXPR, FCALL x->data [L1017] COND FALSE !(!(0 == x->data)) [L1017] COND FALSE !(0) [L1018] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND TRUE 1 != x->data [L1017] EXPR, FCALL x->data [L1017] COND FALSE !(!(0 == x->data)) [L1017] COND FALSE !(0) [L1018] EXPR, FCALL x->next [L1018] x = x->next [L1015] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND TRUE 1 != x->data [L1028] head = x [L1029] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) [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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND TRUE 1 != x->data [L1028] head = x [L1029] EXPR, FCALL x->next [L1029] x = x->next [L1030] FCALL free(head) [L1026] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL x->next [L1033] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL x->next [L1033] FCALL free(x->next) [L1034] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND TRUE 1 != x->data [L1028] head = x [L1029] EXPR, FCALL x->next [L1029] x = x->next [L1030] FCALL free(head) [L1026] EXPR, FCALL x->data [L1026] COND TRUE 1 != x->data [L1028] head = x [L1029] EXPR, FCALL x->next [L1029] x = x->next [L1030] FCALL free(head) - UnprovableResult [Line: 989]: 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL x->next [L1033] FCALL free(x->next) [L1034] FCALL free(x) [L1036] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND TRUE 1 != x->data [L1028] head = x [L1029] EXPR, FCALL x->next [L1029] x = x->next [L1030] FCALL free(head) [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL x->next [L1033] 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1013] COND FALSE !(0) [L1015] EXPR, FCALL x->data [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data [L1020] COND FALSE !(!(1 == x->data)) [L1020] COND FALSE !(0) [L1021] EXPR, FCALL x->next [L1021] x = x->next [L1022] EXPR, FCALL x->data [L1022] COND FALSE !(!(2 == x->data)) [L1022] COND FALSE !(0) [L1024] x = head [L1026] EXPR, FCALL x->data [L1026] COND TRUE 1 != x->data [L1028] head = x [L1029] EXPR, FCALL x->next [L1029] x = x->next [L1030] FCALL free(head) [L1026] EXPR, FCALL x->data [L1026] COND FALSE !(1 != x->data) [L1032] EXPR, FCALL x->data [L1032] COND FALSE !(!(1 == x->data)) [L1032] COND FALSE !(0) [L1033] EXPR, FCALL x->next [L1033] FCALL free(x->next) [L1034] 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]: 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 * 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/sll-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-51-345.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-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-51-345.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-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-51-345.csv Received shutdown request...