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-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:57,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:57,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:57,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:57,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:57,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:57,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:57,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:57,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:57,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:57,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:57,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:57,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:57,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:57,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:57,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:57,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:57,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:57,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:57,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:57,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:57,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:57,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:57,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:57,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:57,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:57,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:57,412 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:57,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:57,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:57,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:57,414 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:28:57,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:57,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:57,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:57,425 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:57,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:57,426 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:57,426 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:57,426 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:57,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:57,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:57,427 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:57,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:57,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:57,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:57,428 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:57,428 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:57,428 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:57,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:57,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:57,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:57,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:57,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:57,430 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:57,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:57,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:57,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:57,431 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:57,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:57,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:57,431 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:57,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:57,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:57,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:57,433 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:57,433 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:57,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:57,483 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:57,488 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:57,489 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:57,490 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:57,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-24 16:28:57,692 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:57,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:57,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:57,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:57,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:57,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa8bd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57, skipping insertion in model container [2018-01-24 16:28:57,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:57,760 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:57,881 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:57,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:57,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57 WrapperNode [2018-01-24 16:28:57,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:57,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:57,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:57,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:57,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (1/1) ... [2018-01-24 16:28:57,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:57,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:57,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:57,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:57,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:57" (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:28:57,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:57,994 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:57,994 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:57,994 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:57,995 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:57,995 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:28:57,995 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:57,995 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:57,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:57,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:58,427 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:58,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:58 BoogieIcfgContainer [2018-01-24 16:28:58,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:58,428 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:58,429 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:58,429 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:58,430 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:58" (1/1) ... [2018-01-24 16:28:58,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:29:00,576 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:29:00,608 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:29:00,630 INFO L268 AbstractInterpreter]: Visited 114 different actions 385 times. Merged at 86 different actions 189 times. Widened at 2 different actions 2 times. Found 31 fixpoints after 17 different actions. Largest state had 53 variables. [2018-01-24 16:29:00,633 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:29:00,634 INFO L168 Benchmark]: Toolchain (without parser) took 2940.75 ms. Allocated memory was 305.1 MB in the beginning and 486.5 MB in the end (delta: 181.4 MB). Free memory was 264.2 MB in the beginning and 314.4 MB in the end (delta: -50.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:29:00,635 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:29:00,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.52 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 252.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:29:00,635 INFO L168 Benchmark]: Boogie Preprocessor took 39.99 ms. Allocated memory is still 305.1 MB. Free memory was 252.2 MB in the beginning and 250.2 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:29:00,636 INFO L168 Benchmark]: RCFGBuilder took 480.09 ms. Allocated memory is still 305.1 MB. Free memory was 250.2 MB in the beginning and 221.7 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:29:00,636 INFO L168 Benchmark]: Abstract Interpretation took 2204.47 ms. Allocated memory was 305.1 MB in the beginning and 486.5 MB in the end (delta: 181.4 MB). Free memory was 221.7 MB in the beginning and 314.4 MB in the end (delta: -92.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:29:00,638 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.25 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.52 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 252.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.99 ms. Allocated memory is still 305.1 MB. Free memory was 252.2 MB in the beginning and 250.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 480.09 ms. Allocated memory is still 305.1 MB. Free memory was 250.2 MB in the beginning and 221.7 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2204.47 ms. Allocated memory was 305.1 MB in the beginning and 486.5 MB in the end (delta: 181.4 MB). Free memory was 221.7 MB in the beginning and 314.4 MB in the end (delta: -92.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 86 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 917 LocStat_NO_SUPPORTING_DISEQUALITIES : 180 LocStat_NO_DISJUNCTIONS : -172 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 118 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 209 TransStat_NO_SUPPORTING_DISEQUALITIES : 47 TransStat_NO_DISJUNCTIONS : 144 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.923830 RENAME_VARIABLES(MILLISECONDS) : 0.409086 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.417797 PROJECTAWAY(MILLISECONDS) : 0.055622 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001020 DISJOIN(MILLISECONDS) : 1.032391 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.445831 ADD_EQUALITY(MILLISECONDS) : 0.011015 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.023109 #CONJOIN_DISJUNCTIVE : 558 #RENAME_VARIABLES : 1144 #UNFREEZE : 0 #CONJOIN : 883 #PROJECTAWAY : 676 #ADD_WEAK_EQUALITY : 79 #DISJOIN : 75 #RENAME_VARIABLES_DISJUNCTIVE : 1024 #ADD_EQUALITY : 239 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 39 - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] FCALL first->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] FCALL first->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] FCALL x->head.next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] FCALL x->head.next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] FCALL y->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y - UnprovableResult [Line: 630]: 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND FALSE !(c1 > 0) [L682] 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] FCALL x->head.next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head [L654] FCALL y->data = c2*c1 - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head [L654] FCALL y->data = c2*c1 [L655] FCALL x->head.next = y - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND TRUE y != &x->head [L674] struct T* z = y; [L675] FCALL y->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND TRUE y != &x->head [L674] struct T* z = y; [L675] FCALL y->next - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND TRUE y != &x->head [L674] struct T* z = y; [L675] EXPR, FCALL y->next [L675] y = y->next [L676] FCALL z->data - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND TRUE y != &x->head [L674] struct T* z = y; [L675] EXPR, FCALL y->next [L675] y = y->next [L676] EXPR, FCALL z->data [L676] COND TRUE z->data < 16 [L677] FCALL free(z) - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND FALSE !(!first) [L663] FCALL last->next = x - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND FALSE !(!first) [L663] FCALL last->next = x - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND TRUE y != &x->head [L674] struct T* z = y; [L675] EXPR, FCALL y->next [L675] y = y->next [L676] EXPR, FCALL z->data [L676] COND TRUE z->data < 16 [L677] FCALL free(z) [L673] COND FALSE !(y != &x->head) [L680] FCALL free(x) - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND FALSE !(!first) [L663] FCALL last->next = x [L664] FCALL x->prev = last - 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND FALSE !(c2 < 3 && __VERIFIER_nondet_int()) [L658] c2 = 0 [L659] COND TRUE !first [L660] first = x [L661] last = x [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND FALSE !(y != &x->head) [L680] FCALL free(x) [L668] COND TRUE c1 > 0 [L669] c1-- [L670] struct T2* x = first; [L671] EXPR, FCALL first->next [L671] first = first->next [L672] EXPR, FCALL x->head.next [L672] struct T* y = x->head.next; [L673] COND FALSE !(y != &x->head) [L680] FCALL free(x) - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-29-00-650.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-29-00-650.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-29-00-650.csv Received shutdown request...