java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:24:22,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:24:22,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:24:22,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:24:22,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:24:22,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:24:22,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:24:22,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:24:22,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:24:22,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:24:22,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:24:22,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:24:22,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:24:22,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:24:22,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:24:22,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:24:22,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:24:22,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:24:22,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:24:22,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:24:22,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:24:22,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:24:22,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:24:22,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:24:22,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:24:22,729 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:24:22,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:24:22,730 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:24:22,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:24:22,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:24:22,731 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:24:22,731 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:24:22,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:24:22,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:24:22,740 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:24:22,740 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:24:22,740 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:24:22,740 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:24:22,741 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:24:22,741 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:24:22,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:24:22,741 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:24:22,741 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:24:22,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:24:22,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:24:22,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:24:22,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:24:22,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:24:22,743 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:24:22,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:24:22,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:24:22,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:24:22,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:24:22,745 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:24:22,745 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:24:22,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:24:22,786 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:24:22,790 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:24:22,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:24:22,792 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:24:22,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-01-24 16:24:22,951 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:24:22,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:24:22,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:24:22,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:24:22,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:24:22,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:24:22" (1/1) ... [2018-01-24 16:24:22,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:22, skipping insertion in model container [2018-01-24 16:24:22,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:24:22" (1/1) ... [2018-01-24 16:24:22,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:24:23,017 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:24:23,137 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:24:23,162 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:24:23,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23 WrapperNode [2018-01-24 16:24:23,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:24:23,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:24:23,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:24:23,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:24:23,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:24:23,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:24:23,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:24:23,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:24:23,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:24:23,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:24:23,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:24:23,260 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 16:24:23,260 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 16:24:23,260 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:24:23,260 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:24:23,260 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:24:23,260 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:24:23,260 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:24:23,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 16:24:23,261 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:24:23,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:24:23,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:24:23,606 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:24:23,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:24:23 BoogieIcfgContainer [2018-01-24 16:24:23,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:24:23,608 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:24:23,608 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:24:23,608 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:24:23,609 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:24:23" (1/1) ... [2018-01-24 16:24:23,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:24:35,045 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:24:35,065 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:24:35,085 INFO L268 AbstractInterpreter]: Visited 95 different actions 1816 times. Merged at 39 different actions 618 times. Widened at 4 different actions 54 times. Found 261 fixpoints after 10 different actions. Largest state had 52 variables. [2018-01-24 16:24:35,087 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:24:35,088 INFO L168 Benchmark]: Toolchain (without parser) took 12136.56 ms. Allocated memory was 305.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 264.7 MB in the beginning and 424.0 MB in the end (delta: -159.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 16:24:35,088 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:24:35,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.73 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 252.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:35,089 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.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:24:35,089 INFO L168 Benchmark]: RCFGBuilder took 395.15 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 226.0 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:35,089 INFO L168 Benchmark]: Abstract Interpretation took 11479.35 ms. Allocated memory was 305.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 226.0 MB in the beginning and 424.0 MB in the end (delta: -198.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 16:24:35,091 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.73 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 252.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.16 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 395.15 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 226.0 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 11479.35 ms. Allocated memory was 305.7 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 226.0 MB in the beginning and 424.0 MB in the end (delta: -198.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 71 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1034 LocStat_NO_SUPPORTING_DISEQUALITIES : 118 LocStat_NO_DISJUNCTIONS : -142 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 103 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 334 TransStat_NO_SUPPORTING_DISEQUALITIES : 42 TransStat_NO_DISJUNCTIONS : 131 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.343494 RENAME_VARIABLES(MILLISECONDS) : 0.001536 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.173707 PROJECTAWAY(MILLISECONDS) : 0.958118 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.003569 DISJOIN(MILLISECONDS) : 0.281385 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.006878 ADD_EQUALITY(MILLISECONDS) : 0.005782 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003476 #CONJOIN_DISJUNCTIVE : 4140 #RENAME_VARIABLES : 11882 #UNFREEZE : 0 #CONJOIN : 9037 #PROJECTAWAY : 7296 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 2596 #RENAME_VARIABLES_DISJUNCTIVE : 11043 #ADD_EQUALITY : 348 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 38 - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] FCALL x1->next = ((void *)0) - UnprovableResult [Line: 688]: 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L672] FCALL t4->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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L672] FCALL t4->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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: [L680] case 5: [L681] FCALL t4->data - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: [L680] case 5: [L681] FCALL t4->data - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L638] FCALL x1->data = 4 - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L638] FCALL x1->data = 4 - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L644] FCALL x1->next = t1 - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L644] FCALL x1->next = t1 - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: [L680] case 5: [L681] EXPR, FCALL t4->data [L681] res4 = t4->data [L682] FCALL t4->next = garbage - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L647] COND TRUE S == t1 [L648] RET S = x1 [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: [L680] case 5: [L681] EXPR, FCALL t4->data [L681] res4 = t4->data [L682] FCALL t4->next = garbage [L683] garbage = t4 [L684] RET pc4 = 1 [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND TRUE \read(*garbage) [L697] FCALL garbage->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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L647] COND TRUE S == t1 [L648] RET S = x1 [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: [L680] case 5: [L681] EXPR, FCALL t4->data [L681] res4 = t4->data [L682] FCALL t4->next = garbage [L683] garbage = t4 [L684] RET pc4 = 1 [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND TRUE \read(*garbage) [L697] FCALL garbage->next - 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: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L633] EXPR, FCALL malloc(sizeof(*x1)) [L633] x1 = malloc(sizeof(*x1)) [L634] FCALL x1->data = 0 [L635] RET, FCALL x1->next = ((void *)0) [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L647] COND TRUE S == t1 [L648] RET S = x1 [L692] push() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L665] RET t4 = S [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE S || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: [L680] case 5: [L681] EXPR, FCALL t4->data [L681] res4 = t4->data [L682] FCALL t4->next = garbage [L683] garbage = t4 [L684] RET pc4 = 1 [L694] pop() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(S || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND TRUE \read(*garbage) [L697] EXPR, FCALL garbage->next [L697] struct cell *next = garbage->next; [L698] FCALL free(garbage) [L699] garbage = next [L696] COND TRUE \read(*garbage) [L697] EXPR, FCALL garbage->next [L697] struct cell *next = garbage->next; [L698] FCALL free(garbage) - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * 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/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-24-35-104.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-24-35-104.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-24-35-104.csv Received shutdown request...