java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:17,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:17,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:17,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:17,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:17,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:17,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:17,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:17,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:17,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:17,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:17,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:17,340 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:17,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:17,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:17,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:17,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:17,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:17,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:17,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:17,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:17,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:17,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:17,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:17,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:17,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:17,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:17,360 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:17,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:17,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:17,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:17,362 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:27:17,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:17,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:17,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:17,371 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:17,371 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:17,371 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:17,371 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:17,372 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:17,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:17,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:17,372 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:17,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:17,373 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:17,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:17,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:17,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:17,374 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:17,374 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:17,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:17,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:17,375 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:17,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:17,375 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:17,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:17,376 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:17,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:17,376 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:17,377 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:17,377 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:17,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:17,421 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:17,425 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:17,426 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:17,427 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:17,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-24 16:27:17,598 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:17,603 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:17,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:17,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:17,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:17,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb77e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17, skipping insertion in model container [2018-01-24 16:27:17,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,628 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:17,670 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:17,799 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:17,825 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:17,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17 WrapperNode [2018-01-24 16:27:17,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:17,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:17,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:17,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:17,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (1/1) ... [2018-01-24 16:27:17,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:17,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:17,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:17,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:17,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:17" (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:27:17,944 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:17,944 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:17,944 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:17,945 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:17,945 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:17,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:17,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:17,945 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:17,945 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:17,946 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:27:17,946 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:17,946 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:17,946 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:17,946 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:18,561 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:18,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:18 BoogieIcfgContainer [2018-01-24 16:27:18,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:18,563 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:18,564 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:18,564 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:18,565 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:18" (1/1) ... [2018-01-24 16:27:18,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:22,513 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:22,573 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:22,582 INFO L268 AbstractInterpreter]: Visited 177 different actions 708 times. Merged at 134 different actions 391 times. Widened at 2 different actions 2 times. Found 61 fixpoints after 32 different actions. Largest state had 76 variables. [2018-01-24 16:27:22,585 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:22,586 INFO L168 Benchmark]: Toolchain (without parser) took 4987.65 ms. Allocated memory was 303.0 MB in the beginning and 661.7 MB in the end (delta: 358.6 MB). Free memory was 263.1 MB in the beginning and 536.9 MB in the end (delta: -273.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:22,587 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:22,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.96 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:22,587 INFO L168 Benchmark]: Boogie Preprocessor took 46.64 ms. Allocated memory is still 303.0 MB. Free memory was 251.0 MB in the beginning and 249.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:27:22,587 INFO L168 Benchmark]: RCFGBuilder took 678.82 ms. Allocated memory is still 303.0 MB. Free memory was 249.0 MB in the beginning and 209.0 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:22,587 INFO L168 Benchmark]: Abstract Interpretation took 4021.45 ms. Allocated memory was 303.0 MB in the beginning and 661.7 MB in the end (delta: 358.6 MB). Free memory was 209.0 MB in the beginning and 536.9 MB in the end (delta: -327.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:22,589 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.14 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.96 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.64 ms. Allocated memory is still 303.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 678.82 ms. Allocated memory is still 303.0 MB. Free memory was 249.0 MB in the beginning and 209.0 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 4021.45 ms. Allocated memory was 303.0 MB in the beginning and 661.7 MB in the end (delta: 358.6 MB). Free memory was 209.0 MB in the beginning and 536.9 MB in the end (delta: -327.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 137 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1787 LocStat_NO_SUPPORTING_DISEQUALITIES : 517 LocStat_NO_DISJUNCTIONS : -274 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 181 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 323 TransStat_NO_SUPPORTING_DISEQUALITIES : 88 TransStat_NO_DISJUNCTIONS : 232 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.355884 RENAME_VARIABLES(MILLISECONDS) : 0.373330 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.331740 PROJECTAWAY(MILLISECONDS) : 0.056724 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001273 DISJOIN(MILLISECONDS) : 0.518999 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.410583 ADD_EQUALITY(MILLISECONDS) : 0.022347 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021345 #CONJOIN_DISJUNCTIVE : 1095 #RENAME_VARIABLES : 2385 #UNFREEZE : 0 #CONJOIN : 1696 #PROJECTAWAY : 1385 #ADD_WEAK_EQUALITY : 83 #DISJOIN : 250 #RENAME_VARIABLES_DISJUNCTIVE : 2057 #ADD_EQUALITY : 333 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 68 - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] FCALL s->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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] EXPR, FCALL n->right [L636] n->left && n->right [L636] COND TRUE n->left && n->right [L637] COND TRUE __VERIFIER_nondet_int() [L638] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] EXPR, FCALL n->right [L636] n->left && n->right [L636] COND TRUE n->left && n->right [L637] COND FALSE !(__VERIFIER_nondet_int()) [L640] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] FCALL st->node - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] EXPR, FCALL n->right [L636] n->left && n->right [L636] COND TRUE n->left && n->right [L637] COND TRUE __VERIFIER_nondet_int() [L638] EXPR, FCALL n->left [L638] n = n->left [L636] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((void *)0) [L645] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((void *)0) [L645] EXPR, FCALL n->left [L645] FCALL n->left->right = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((void *)0) [L645] EXPR, FCALL n->left [L645] FCALL n->left->right = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND FALSE !(n->right) [L676] FCALL free(n) - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND TRUE n->left [L665] EXPR, FCALL malloc(sizeof(*st)) [L665] st = malloc(sizeof(*st)) [L666] FCALL st->next = s - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND TRUE n->left [L665] EXPR, FCALL malloc(sizeof(*st)) [L665] st = malloc(sizeof(*st)) [L666] FCALL st->next = s [L667] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND TRUE n->left [L665] EXPR, FCALL malloc(sizeof(*st)) [L665] st = malloc(sizeof(*st)) [L666] FCALL st->next = s [L667] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((void *)0) [L645] EXPR, FCALL n->left [L645] FCALL n->left->right = ((void *)0) [L646] FCALL n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND TRUE n->right [L671] EXPR, FCALL malloc(sizeof(*st)) [L671] st = malloc(sizeof(*st)) [L672] FCALL st->next = s - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND TRUE n->left [L665] EXPR, FCALL malloc(sizeof(*st)) [L665] st = malloc(sizeof(*st)) [L666] FCALL st->next = s [L667] EXPR, FCALL n->left [L667] FCALL st->node = n->left - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((void *)0) [L645] EXPR, FCALL n->left [L645] FCALL n->left->right = ((void *)0) [L646] EXPR, FCALL n->left [L646] FCALL n->left->parent = n - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND TRUE !n->left && __VERIFIER_nondet_int() [L643] EXPR, FCALL malloc(sizeof(*n)) [L643] FCALL n->left = malloc(sizeof(*n)) [L644] EXPR, FCALL n->left [L644] FCALL n->left->left = ((void *)0) [L645] EXPR, FCALL n->left [L645] FCALL n->left->right = ((void *)0) [L646] EXPR, FCALL n->left [L646] FCALL n->left->parent = n - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((void *)0) [L651] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND TRUE n->right [L671] EXPR, FCALL malloc(sizeof(*st)) [L671] st = malloc(sizeof(*st)) [L672] FCALL st->next = s [L673] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND TRUE n->right [L671] EXPR, FCALL malloc(sizeof(*st)) [L671] st = malloc(sizeof(*st)) [L672] FCALL st->next = s [L673] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND FALSE !(n->right) [L676] FCALL free(n) [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] FCALL s->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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((void *)0) [L651] EXPR, FCALL n->right [L651] FCALL n->right->right = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((void *)0) [L651] EXPR, FCALL n->right [L651] FCALL n->right->right = ((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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND TRUE n->right [L671] EXPR, FCALL malloc(sizeof(*st)) [L671] st = malloc(sizeof(*st)) [L672] FCALL st->next = s [L673] EXPR, FCALL n->right [L673] FCALL st->node = n->right - UnprovableResult [Line: 620]: 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND FALSE !(n->right) [L676] FCALL free(n) [L659] COND FALSE !(s != ((void *)0)) [L678] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((void *)0) [L651] EXPR, FCALL n->right [L651] FCALL n->right->right = ((void *)0) [L652] FCALL n->right - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((void *)0) [L651] EXPR, FCALL n->right [L651] FCALL n->right->right = ((void *)0) [L652] EXPR, FCALL n->right [L652] FCALL n->right->parent = n - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND TRUE __VERIFIER_nondet_int() [L635] n = root [L636] EXPR, FCALL n->left [L636] n->left && n->right [L636] COND FALSE !(n->left && n->right) [L642] EXPR, FCALL n->left [L642] !n->left && __VERIFIER_nondet_int() [L642] !n->left && __VERIFIER_nondet_int() [L642] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L648] EXPR, FCALL n->right [L648] !n->right && __VERIFIER_nondet_int() [L648] !n->right && __VERIFIER_nondet_int() [L648] COND TRUE !n->right && __VERIFIER_nondet_int() [L649] EXPR, FCALL malloc(sizeof(*n)) [L649] FCALL n->right = malloc(sizeof(*n)) [L650] EXPR, FCALL n->right [L650] FCALL n->right->left = ((void *)0) [L651] EXPR, FCALL n->right [L651] FCALL n->right->right = ((void *)0) [L652] EXPR, FCALL n->right [L652] FCALL n->right->parent = n - 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: [L630] EXPR, FCALL malloc(sizeof(*root)) [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; [L631] FCALL root->left = ((void *)0) [L632] FCALL root->right = ((void *)0) [L633] FCALL root->parent = ((void *)0) [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) [L656] EXPR, FCALL malloc(sizeof(*s)) [L656] struct StackItem* s = malloc(sizeof(*s)), *st; [L657] FCALL s->next = ((void *)0) [L658] FCALL s->node = root [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) [L664] FCALL n->left [L664] COND FALSE !(n->left) [L670] FCALL n->right [L670] COND FALSE !(n->right) [L676] FCALL free(n) [L659] COND TRUE s != ((void *)0) [L660] st = s [L661] EXPR, FCALL s->next [L661] s = s->next [L662] EXPR, FCALL st->node [L662] n = st->node [L663] FCALL free(st) - 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 - 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/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-27-22-601.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-27-22-601.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-27-22-601.csv Received shutdown request...