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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 04:50:26,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 04:50:26,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 04:50:26,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 04:50:26,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 04:50:26,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 04:50:26,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 04:50:26,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 04:50:26,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 04:50:26,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 04:50:26,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 04:50:26,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 04:50:26,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 04:50:26,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 04:50:26,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 04:50:26,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 04:50:26,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 04:50:26,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 04:50:26,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 04:50:26,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 04:50:26,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 04:50:26,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 04:50:26,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 04:50:26,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 04:50:26,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 04:50:26,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 04:50:26,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 04:50:26,820 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 04:50:26,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 04:50:26,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 04:50:26,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 04:50:26,821 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_smtcomp.epf [2018-01-25 04:50:26,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 04:50:26,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 04:50:26,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 04:50:26,836 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 04:50:26,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 04:50:26,836 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 04:50:26,836 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 04:50:26,837 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 04:50:26,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 04:50:26,840 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 04:50:26,841 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 04:50:26,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 04:50:26,841 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 04:50:26,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 04:50:26,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 04:50:26,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 04:50:26,841 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 04:50:26,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 04:50:26,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 04:50:26,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 04:50:26,842 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 04:50:26,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 04:50:26,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 04:50:26,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-25 04:50:26,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 04:50:26,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 04:50:26,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 04:50:26,843 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 04:50:26,844 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 04:50:26,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 04:50:26,900 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 04:50:26,903 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 04:50:26,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 04:50:26,904 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 04:50:26,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-01-25 04:50:27,172 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 04:50:27,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 04:50:27,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 04:50:27,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 04:50:27,187 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 04:50:27,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27, skipping insertion in model container [2018-01-25 04:50:27,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,208 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 04:50:27,257 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 04:50:27,401 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 04:50:27,422 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 04:50:27,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27 WrapperNode [2018-01-25 04:50:27,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 04:50:27,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 04:50:27,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 04:50:27,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 04:50:27,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:27,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 04:50:27,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 04:50:27,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 04:50:27,469 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 04:50:27,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 04:50:27" (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-25 04:50:27,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 04:50:27,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 04:50:27,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 04:50:27,527 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-01-25 04:50:27,527 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-01-25 04:50:27,527 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 04:50:27,527 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 04:50:27,527 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 04:50:27,527 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 04:50:27,527 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-01-25 04:50:27,528 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-01-25 04:50:27,529 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 04:50:27,529 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 04:50:27,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 04:50:27,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 04:50:27,973 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 04:50:27,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 04:50:27 BoogieIcfgContainer [2018-01-25 04:50:27,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 04:50:27,975 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-25 04:50:27,975 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-25 04:50:27,975 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-25 04:50:27,976 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 04:50:27" (1/1) ... [2018-01-25 04:50:28,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 04:50:54,621 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 04:50:54,632 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 04:50:54,680 INFO L268 AbstractInterpreter]: Visited 104 different actions 180 times. Merged at 33 different actions 42 times. Never widened. Found 7 fixpoints after 7 different actions. Largest state had 36 variables. [2018-01-25 04:50:54,682 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-25 04:50:54,683 INFO L168 Benchmark]: Toolchain (without parser) took 27510.93 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 264.0 MB in the beginning and 1.0 GB in the end (delta: -770.1 MB). Peak memory consumption was 291.1 MB. Max. memory is 5.3 GB. [2018-01-25 04:50:54,684 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 04:50:54,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.88 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 250.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 04:50:54,685 INFO L168 Benchmark]: Boogie Preprocessor took 33.99 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 04:50:54,685 INFO L168 Benchmark]: RCFGBuilder took 505.75 ms. Allocated memory is still 305.1 MB. Free memory was 248.0 MB in the beginning and 222.9 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-01-25 04:50:54,685 INFO L168 Benchmark]: Abstract Interpretation took 26707.56 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 222.9 MB in the beginning and 1.0 GB in the end (delta: -811.2 MB). Peak memory consumption was 250.0 MB. Max. memory is 5.3 GB. [2018-01-25 04:50:54,686 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.12 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 253.88 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 250.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.99 ms. Allocated memory is still 305.1 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 505.75 ms. Allocated memory is still 305.1 MB. Free memory was 248.0 MB in the beginning and 222.9 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 26707.56 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 222.9 MB in the beginning and 1.0 GB in the end (delta: -811.2 MB). Peak memory consumption was 250.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 82 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1432 LocStat_NO_SUPPORTING_DISEQUALITIES : 562 LocStat_NO_DISJUNCTIONS : -164 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 116 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 209 TransStat_NO_SUPPORTING_DISEQUALITIES : 45 TransStat_NO_DISJUNCTIONS : 146 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.779266 RENAME_VARIABLES(MILLISECONDS) : 1.563787 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.732076 PROJECTAWAY(MILLISECONDS) : 45.133176 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.044007 DISJOIN(MILLISECONDS) : 0.555898 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.596681 ADD_EQUALITY(MILLISECONDS) : 0.009754 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003985 #CONJOIN_DISJUNCTIVE : 296 #RENAME_VARIABLES : 655 #UNFREEZE : 0 #CONJOIN : 646 #PROJECTAWAY : 471 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 92 #RENAME_VARIABLES_DISJUNCTIVE : 582 #ADD_EQUALITY : 183 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 40 - UnprovableResult [Line: 1472]: 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND TRUE, RET !a10 [L1473] entry_point() - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] FCALL a10->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] FCALL a10->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] FCALL a10->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] FCALL a10->b->c - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND TRUE !a10->b->c [L1467] FCALL a10->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] FCALL a->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] FCALL a->b->c - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] FCALL a->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] FCALL a->b->c - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] FCALL a->b->c - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] FCALL a->b->c->p - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] FCALL a->b->c->p - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] FCALL free(a->b->c->p) - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] FCALL free(a->b->c->p) - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] RET, FCALL free(a->b->c->p) [L1463] free_10(a10) [L1465] FCALL a10->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] RET, FCALL free(a->b->c->p) [L1463] free_10(a10) [L1465] FCALL a10->b - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] RET, FCALL free(a->b->c->p) [L1463] free_10(a10) [L1465] EXPR, FCALL a10->b [L1465] FCALL a10->b->c - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] RET, FCALL free(a->b->c->p) [L1463] free_10(a10) [L1465] EXPR, FCALL a10->b [L1465] FCALL a10->b->c - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] RET, FCALL free(a->b->c->p) [L1463] free_10(a10) [L1465] EXPR, FCALL a10->b [L1465] EXPR, FCALL a10->b->c [L1465] FCALL free(a10->b->c) - 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: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1455] EXPR ldv_malloc(sizeof(struct A10)) [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1457] EXPR ldv_malloc(sizeof(struct B10)) [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) [L1458] EXPR, FCALL a10->b [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) [L1074] RET return malloc(size); [L1459] EXPR ldv_malloc(sizeof(struct C10)) [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) [L1460] EXPR, FCALL a10->b [L1460] EXPR, FCALL a10->b->c [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) [L1447] EXPR, FCALL a->b [L1447] EXPR, FCALL a->b->c [L1447] CALL, EXPR ldv_malloc(sizeof(int)) [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; [L1447] EXPR ldv_malloc(sizeof(int)) [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) [L1462] alloc_10(a10) [L1463] CALL free_10(a10) [L1451] EXPR, FCALL a->b [L1451] EXPR, FCALL a->b->c [L1451] EXPR, FCALL a->b->c->p [L1451] RET, FCALL free(a->b->c->p) [L1463] free_10(a10) [L1465] EXPR, FCALL a10->b [L1465] EXPR, FCALL a10->b->c [L1465] FCALL free(a10->b->c) - 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]: free always succeeds For all program executions holds that free 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]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-25_04-50-54-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-25_04-50-54-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_smtcomp.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_04-50-54-698.csv Received shutdown request...