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/list-properties/splice_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:33:31,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:33:31,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:33:31,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:33:31,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:33:31,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:33:31,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:33:31,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:33:31,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:33:31,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:33:31,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:33:31,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:33:31,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:33:31,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:33:31,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:33:31,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:33:31,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:33:31,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:33:31,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:33:31,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:33:31,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:33:31,249 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:33:31,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:33:31,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:33:31,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:33:31,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:33:31,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:33:31,252 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:33:31,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:33:31,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:33:31,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:33:31,254 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:33:31,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:33:31,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:33:31,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:33:31,265 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:33:31,265 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:33:31,265 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:33:31,265 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:33:31,266 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:33:31,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:33:31,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:33:31,267 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:33:31,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:33:31,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:33:31,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:33:31,268 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:33:31,268 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:33:31,268 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:33:31,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:33:31,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:33:31,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:33:31,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:33:31,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:33:31,269 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:33:31,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:33:31,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:33:31,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:33:31,270 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:33:31,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:33:31,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:33:31,271 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:33:31,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:33:31,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:33:31,271 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:33:31,272 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:33:31,272 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:33:31,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:33:31,319 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:33:31,323 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:33:31,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:33:31,326 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:33:31,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-01-24 16:33:31,510 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:33:31,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:33:31,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:33:31,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:33:31,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:33:31,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31, skipping insertion in model container [2018-01-24 16:33:31,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,546 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:33:31,588 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:33:31,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:33:31,725 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:33:31,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31 WrapperNode [2018-01-24 16:33:31,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:33:31,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:33:31,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:33:31,733 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:33:31,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (1/1) ... [2018-01-24 16:33:31,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:33:31,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:33:31,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:33:31,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:33:31,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:33:31" (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:33:31,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:33:31,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:33:31,819 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 16:33:31,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:33:31,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:33:31,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 16:33:31,820 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:33:31,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:33:31,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:33:32,207 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:33:32,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:33:32 BoogieIcfgContainer [2018-01-24 16:33:32,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:33:32,208 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:33:32,209 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:33:32,209 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:33:32,210 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:33:32" (1/1) ... [2018-01-24 16:33:32,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:33:35,068 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:33:35,083 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:33:35,112 INFO L268 AbstractInterpreter]: Visited 98 different actions 464 times. Merged at 71 different actions 260 times. Widened at 5 different actions 8 times. Found 35 fixpoints after 19 different actions. Largest state had 47 variables. [2018-01-24 16:33:35,115 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:33:35,116 INFO L168 Benchmark]: Toolchain (without parser) took 3605.23 ms. Allocated memory was 305.7 MB in the beginning and 619.2 MB in the end (delta: 313.5 MB). Free memory was 265.7 MB in the beginning and 524.1 MB in the end (delta: -258.4 MB). Peak memory consumption was 55.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:35,117 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:33:35,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.07 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 253.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:35,117 INFO L168 Benchmark]: Boogie Preprocessor took 31.41 ms. Allocated memory is still 305.7 MB. Free memory was 253.6 MB in the beginning and 251.6 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:33:35,117 INFO L168 Benchmark]: RCFGBuilder took 443.38 ms. Allocated memory is still 305.7 MB. Free memory was 251.6 MB in the beginning and 226.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:35,118 INFO L168 Benchmark]: Abstract Interpretation took 2906.91 ms. Allocated memory was 305.7 MB in the beginning and 619.2 MB in the end (delta: 313.5 MB). Free memory was 226.0 MB in the beginning and 524.1 MB in the end (delta: -298.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:33:35,119 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 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.07 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 253.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.41 ms. Allocated memory is still 305.7 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 443.38 ms. Allocated memory is still 305.7 MB. Free memory was 251.6 MB in the beginning and 226.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2906.91 ms. Allocated memory was 305.7 MB in the beginning and 619.2 MB in the end (delta: 313.5 MB). Free memory was 226.0 MB in the beginning and 524.1 MB in the end (delta: -298.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 76 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 789 LocStat_NO_SUPPORTING_DISEQUALITIES : 428 LocStat_NO_DISJUNCTIONS : -152 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 102 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 144 TransStat_NO_SUPPORTING_DISEQUALITIES : 38 TransStat_NO_DISJUNCTIONS : 115 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.350443 RENAME_VARIABLES(MILLISECONDS) : 0.250727 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.323808 PROJECTAWAY(MILLISECONDS) : 0.068921 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001136 DISJOIN(MILLISECONDS) : 0.226587 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.279397 ADD_EQUALITY(MILLISECONDS) : 0.014760 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020106 #CONJOIN_DISJUNCTIVE : 833 #RENAME_VARIABLES : 1664 #UNFREEZE : 0 #CONJOIN : 998 #PROJECTAWAY : 863 #ADD_WEAK_EQUALITY : 41 #DISJOIN : 248 #RENAME_VARIABLES_DISJUNCTIVE : 1593 #ADD_EQUALITY : 171 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 32 - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] FCALL a->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 - UnprovableResult [Line: 626]: 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND TRUE a->h == 3 [L650] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] FCALL p->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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND FALSE !(\read(flag)) [L641] FCALL p->h = 2 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] FCALL p->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] FCALL p->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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] FCALL p->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND FALSE !(\read(flag)) [L641] FCALL p->h = 2 [L642] flag = 1 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND FALSE !(\read(flag)) [L641] FCALL p->h = 2 [L642] flag = 1 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] FCALL a->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND FALSE !(\read(flag)) [L641] FCALL p->h = 2 [L642] flag = 1 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND FALSE !(\read(flag)) [L641] FCALL p->h = 2 [L642] flag = 1 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND FALSE !(\read(flag)) [L641] FCALL p->h = 2 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND FALSE !(p->h != 3) [L668] p = l1 [L669] COND TRUE p != 0 [L670] FCALL p->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND FALSE !(\read(flag)) [L663] FCALL t->n = l2 - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND FALSE !(p->h != 3) [L668] p = l1 [L669] COND TRUE p != 0 [L670] EXPR, FCALL p->h [L670] COND FALSE !(p->h != 1) [L671] FCALL p->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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND FALSE !(p->h != 3) [L668] p = l1 [L669] COND TRUE p != 0 [L670] EXPR, FCALL p->h [L670] COND FALSE !(p->h != 1) [L671] EXPR, FCALL p->n [L671] p = p->n [L669] COND TRUE p != 0 [L670] FCALL p->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND FALSE !(\read(flag)) [L663] FCALL t->n = l2 [L664] l2 = t [L665] flag = 1 [L655] EXPR, FCALL p->h [L655] COND FALSE !(p->h != 3) [L668] p = l1 [L669] COND FALSE !(p != 0) [L673] p = l2 [L674] COND TRUE p != 0 [L675] FCALL p->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND FALSE !(\read(flag)) [L663] FCALL t->n = l2 [L664] l2 = t [L665] flag = 1 [L655] EXPR, FCALL p->h [L655] COND FALSE !(p->h != 3) [L668] p = l1 [L669] COND FALSE !(p != 0) [L673] p = l2 [L674] COND TRUE p != 0 [L675] FCALL p->h - 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: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); [L629] COND FALSE !(a == 0) [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 [L655] EXPR, FCALL p->h [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND FALSE !(\read(flag)) [L663] FCALL t->n = l2 [L664] l2 = t [L665] flag = 1 [L655] EXPR, FCALL p->h [L655] COND FALSE !(p->h != 3) [L668] p = l1 [L669] COND FALSE !(p != 0) [L673] p = l2 [L674] COND TRUE p != 0 [L675] EXPR, FCALL p->h [L675] COND FALSE !(p->h != 2) [L676] FCALL p->n - 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 * 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/splice_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-33-35-128.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-33-35-128.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-33-35-128.csv Received shutdown request...