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_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:23,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:23,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:23,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:23,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:23,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:23,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:23,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:23,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:23,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:23,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:23,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:23,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:23,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:23,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:23,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:23,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:23,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:23,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:23,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:23,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:23,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:23,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:23,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:23,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:23,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:23,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:23,493 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:23,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:23,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:23,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:23,495 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:23,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:23,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:23,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:23,506 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:23,506 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:23,507 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:23,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:23,507 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:23,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:23,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:23,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:23,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:23,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:23,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:23,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:23,509 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:23,509 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:23,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:23,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:23,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:23,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:23,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:23,511 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:23,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:23,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:23,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:23,511 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:23,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:23,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:23,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:23,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:23,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:23,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:23,513 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:23,514 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:23,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:23,562 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:23,566 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:23,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:23,568 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:23,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-01-24 16:27:23,769 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:23,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:23,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:23,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:23,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:23,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:23" (1/1) ... [2018-01-24 16:27:23,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658178e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:23, skipping insertion in model container [2018-01-24 16:27:23,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:23" (1/1) ... [2018-01-24 16:27:23,805 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:23,843 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:23,961 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:23,982 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:23,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:23 WrapperNode [2018-01-24 16:27:23,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:23,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:23,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:23,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:24,004 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:23" (1/1) ... [2018-01-24 16:27:24,004 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:23" (1/1) ... [2018-01-24 16:27:24,013 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:23" (1/1) ... [2018-01-24 16:27:24,013 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:23" (1/1) ... [2018-01-24 16:27:24,019 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:23" (1/1) ... [2018-01-24 16:27:24,024 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:23" (1/1) ... [2018-01-24 16:27:24,025 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:23" (1/1) ... [2018-01-24 16:27:24,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:24,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:24,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:24,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:24,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:23" (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:24,079 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:24,079 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:24,080 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:27:24,080 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:24,081 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:24,081 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:24,081 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:24,597 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:24,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:24 BoogieIcfgContainer [2018-01-24 16:27:24,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:24,599 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:24,600 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:24,600 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:24,601 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:24" (1/1) ... [2018-01-24 16:27:24,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:28,140 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:28,188 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:28,193 INFO L268 AbstractInterpreter]: Visited 160 different actions 738 times. Merged at 123 different actions 419 times. Widened at 2 different actions 2 times. Found 70 fixpoints after 35 different actions. Largest state had 72 variables. [2018-01-24 16:27:28,196 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:28,197 INFO L168 Benchmark]: Toolchain (without parser) took 4427.73 ms. Allocated memory was 302.5 MB in the beginning and 660.6 MB in the end (delta: 358.1 MB). Free memory was 261.5 MB in the beginning and 363.2 MB in the end (delta: -101.7 MB). Peak memory consumption was 256.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:28,198 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:28,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.79 ms. Allocated memory is still 302.5 MB. Free memory was 261.5 MB in the beginning and 249.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:28,198 INFO L168 Benchmark]: Boogie Preprocessor took 36.65 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 247.5 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:28,199 INFO L168 Benchmark]: RCFGBuilder took 571.43 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 210.6 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:28,199 INFO L168 Benchmark]: Abstract Interpretation took 3596.74 ms. Allocated memory was 302.5 MB in the beginning and 660.6 MB in the end (delta: 358.1 MB). Free memory was 210.6 MB in the beginning and 363.2 MB in the end (delta: -152.6 MB). Peak memory consumption was 205.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:28,201 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.20 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.79 ms. Allocated memory is still 302.5 MB. Free memory was 261.5 MB in the beginning and 249.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.65 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 571.43 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 210.6 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 3596.74 ms. Allocated memory was 302.5 MB in the beginning and 660.6 MB in the end (delta: 358.1 MB). Free memory was 210.6 MB in the beginning and 363.2 MB in the end (delta: -152.6 MB). Peak memory consumption was 205.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 123 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1581 LocStat_NO_SUPPORTING_DISEQUALITIES : 405 LocStat_NO_DISJUNCTIONS : -246 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 164 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 298 TransStat_NO_SUPPORTING_DISEQUALITIES : 83 TransStat_NO_DISJUNCTIONS : 210 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.273267 RENAME_VARIABLES(MILLISECONDS) : 0.278701 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.255242 PROJECTAWAY(MILLISECONDS) : 0.050133 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001613 DISJOIN(MILLISECONDS) : 0.614885 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.306986 ADD_EQUALITY(MILLISECONDS) : 0.026439 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011832 #CONJOIN_DISJUNCTIVE : 1155 #RENAME_VARIABLES : 2524 #UNFREEZE : 0 #CONJOIN : 1743 #PROJECTAWAY : 1426 #ADD_WEAK_EQUALITY : 71 #DISJOIN : 252 #RENAME_VARIABLES_DISJUNCTIVE : 2184 #ADD_EQUALITY : 302 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 63 - 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] EXPR, FCALL n->right [L634] n->left && n->right [L634] COND TRUE n->left && n->right [L635] COND TRUE __VERIFIER_nondet_int() [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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] EXPR, FCALL n->right [L634] n->left && n->right [L634] COND TRUE n->left && n->right [L635] COND FALSE !(__VERIFIER_nondet_int()) [L638] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] EXPR, FCALL n->right [L634] n->left && n->right [L634] COND TRUE n->left && n->right [L635] COND TRUE __VERIFIER_nondet_int() [L636] EXPR, FCALL n->left [L636] n = n->left [L634] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] FCALL n->left = malloc(sizeof(*n)) [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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] FCALL n->left = malloc(sizeof(*n)) [L642] EXPR, FCALL n->left [L642] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] FCALL n->left = malloc(sizeof(*n)) [L642] EXPR, FCALL n->left [L642] FCALL n->left->left = ((void *)0) [L643] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] FCALL n->right = malloc(sizeof(*n)) [L647] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] FCALL n->left = malloc(sizeof(*n)) [L642] EXPR, FCALL n->left [L642] FCALL n->left->left = ((void *)0) [L643] EXPR, FCALL n->left [L643] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND TRUE !n->left && __VERIFIER_nondet_int() [L641] EXPR, FCALL malloc(sizeof(*n)) [L641] FCALL n->left = malloc(sizeof(*n)) [L642] EXPR, FCALL n->left [L642] FCALL n->left->left = ((void *)0) [L643] EXPR, FCALL n->left [L643] FCALL n->left->right = ((void *)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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND FALSE !(n->right) [L672] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND TRUE n->left [L661] EXPR, FCALL malloc(sizeof(*st)) [L661] st = malloc(sizeof(*st)) [L662] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] FCALL n->right = malloc(sizeof(*n)) [L647] EXPR, FCALL n->right [L647] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND TRUE n->left [L661] EXPR, FCALL malloc(sizeof(*st)) [L661] st = malloc(sizeof(*st)) [L662] FCALL st->next = s [L663] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND TRUE n->left [L661] EXPR, FCALL malloc(sizeof(*st)) [L661] st = malloc(sizeof(*st)) [L662] FCALL st->next = s [L663] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND TRUE n->right [L667] EXPR, FCALL malloc(sizeof(*st)) [L667] st = malloc(sizeof(*st)) [L668] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND TRUE n->left [L661] EXPR, FCALL malloc(sizeof(*st)) [L661] st = malloc(sizeof(*st)) [L662] FCALL st->next = s [L663] EXPR, FCALL n->left [L663] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] FCALL n->right = malloc(sizeof(*n)) [L647] EXPR, FCALL n->right [L647] FCALL n->right->left = ((void *)0) [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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND TRUE n->right [L667] EXPR, FCALL malloc(sizeof(*st)) [L667] st = malloc(sizeof(*st)) [L668] FCALL st->next = s [L669] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND TRUE n->right [L667] EXPR, FCALL malloc(sizeof(*st)) [L667] st = malloc(sizeof(*st)) [L668] FCALL st->next = s [L669] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND FALSE !(n->right) [L672] FCALL free(n) [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] FCALL n->right = malloc(sizeof(*n)) [L647] EXPR, FCALL n->right [L647] FCALL n->right->left = ((void *)0) [L648] EXPR, FCALL n->right [L648] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR, FCALL n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR, FCALL n->left [L640] !n->left && __VERIFIER_nondet_int() [L640] !n->left && __VERIFIER_nondet_int() [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR, FCALL n->right [L645] !n->right && __VERIFIER_nondet_int() [L645] !n->right && __VERIFIER_nondet_int() [L645] COND TRUE !n->right && __VERIFIER_nondet_int() [L646] EXPR, FCALL malloc(sizeof(*n)) [L646] FCALL n->right = malloc(sizeof(*n)) [L647] EXPR, FCALL n->right [L647] FCALL n->right->left = ((void *)0) [L648] EXPR, FCALL n->right [L648] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND TRUE n->right [L667] EXPR, FCALL malloc(sizeof(*st)) [L667] st = malloc(sizeof(*st)) [L668] FCALL st->next = s [L669] EXPR, FCALL n->right [L669] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND FALSE !(n->right) [L672] FCALL free(n) [L655] COND FALSE !(s != ((void *)0)) [L674] 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: [L629] EXPR, FCALL malloc(sizeof(*root)) [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] FCALL root->left = ((void *)0) [L631] FCALL root->right = ((void *)0) [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) [L652] EXPR, FCALL malloc(sizeof(*s)) [L652] struct StackItem* s = malloc(sizeof(*s)), *st; [L653] FCALL s->next = ((void *)0) [L654] FCALL s->node = root [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] FCALL free(st) [L660] FCALL n->left [L660] COND FALSE !(n->left) [L666] FCALL n->right [L666] COND FALSE !(n->right) [L672] FCALL free(n) [L655] COND TRUE s != ((void *)0) [L656] st = s [L657] EXPR, FCALL s->next [L657] s = s->next [L658] EXPR, FCALL st->node [L658] n = st->node [L659] 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]: 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 * 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_stack_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-28-214.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_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-28-214.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_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-28-214.csv Received shutdown request...