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.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:24:09,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:24:09,865 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:24:09,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:24:09,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:24:09,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:24:09,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:24:09,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:24:09,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:24:09,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:24:09,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:24:09,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:24:09,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:24:09,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:24:09,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:24:09,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:24:09,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:24:09,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:24:09,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:24:09,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:24:09,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:24:09,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:24:09,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:24:09,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:24:09,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:24:09,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:24:09,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:24:09,909 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:24:09,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:24:09,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:24:09,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:24:09,911 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:09,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:24:09,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:24:09,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:24:09,921 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:24:09,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:24:09,922 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:24:09,922 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:24:09,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:24:09,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:24:09,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:24:09,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:24:09,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:24:09,924 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:24:09,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:24:09,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:24:09,924 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:24:09,924 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:24:09,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:24:09,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:24:09,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:24:09,925 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:24:09,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:24:09,926 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:24:09,926 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:24:09,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:24:09,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:24:09,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:24:09,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:24:09,927 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:24:09,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:24:09,973 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:24:09,977 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:24:09,978 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:24:09,978 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:24:09,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-01-24 16:24:10,147 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:24:10,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:24:10,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:24:10,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:24:10,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:24:10,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:24:10" (1/1) ... [2018-01-24 16:24:10,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:10, skipping insertion in model container [2018-01-24 16:24:10,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:24:10" (1/1) ... [2018-01-24 16:24:10,176 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:24:10,215 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:24:10,342 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:24:10,366 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:24:10,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:10 WrapperNode [2018-01-24 16:24:10,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:24:10,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:24:10,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:24:10,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:24:10,393 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:10" (1/1) ... [2018-01-24 16:24:10,393 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:10" (1/1) ... [2018-01-24 16:24:10,402 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:10" (1/1) ... [2018-01-24 16:24:10,402 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:10" (1/1) ... [2018-01-24 16:24:10,410 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:10" (1/1) ... [2018-01-24 16:24:10,414 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:10" (1/1) ... [2018-01-24 16:24:10,416 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:10" (1/1) ... [2018-01-24 16:24:10,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:24:10,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:24:10,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:24:10,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:24:10,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:24:10" (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:10,476 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:24:10,476 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:24:10,476 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 16:24:10,476 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 16:24:10,476 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:24:10,477 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:24:10,477 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:24:10,477 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:24:10,477 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:24:10,477 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:24:10,477 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:24:10,478 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:24:10,478 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:24:10,478 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:24:10,478 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:24:10,478 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 16:24:10,478 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 16:24:10,479 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:24:10,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:24:10,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:24:10,833 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:24:10,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:24:10 BoogieIcfgContainer [2018-01-24 16:24:10,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:24:10,834 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:24:10,835 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:24:10,835 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:24:10,836 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:10" (1/1) ... [2018-01-24 16:24:10,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:24:22,791 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:24:22,811 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:24:22,835 INFO L268 AbstractInterpreter]: Visited 95 different actions 1848 times. Merged at 39 different actions 617 times. Widened at 4 different actions 28 times. Found 271 fixpoints after 11 different actions. Largest state had 52 variables. [2018-01-24 16:24:22,837 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:24:22,838 INFO L168 Benchmark]: Toolchain (without parser) took 12690.87 ms. Allocated memory was 302.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 262.0 MB in the beginning and 813.4 MB in the end (delta: -551.4 MB). Peak memory consumption was 711.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:22,839 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:24:22,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.17 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:22,840 INFO L168 Benchmark]: Boogie Preprocessor took 42.20 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:22,840 INFO L168 Benchmark]: RCFGBuilder took 414.44 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 222.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:22,841 INFO L168 Benchmark]: Abstract Interpretation took 12002.95 ms. Allocated memory was 302.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 222.4 MB in the beginning and 813.4 MB in the end (delta: -591.0 MB). Peak memory consumption was 672.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:24:22,843 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.17 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.17 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.20 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 414.44 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 222.4 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 12002.95 ms. Allocated memory was 302.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 222.4 MB in the beginning and 813.4 MB in the end (delta: -591.0 MB). Peak memory consumption was 672.0 MB. 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 : 332 TransStat_NO_SUPPORTING_DISEQUALITIES : 41 TransStat_NO_DISJUNCTIONS : 130 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.395267 RENAME_VARIABLES(MILLISECONDS) : 0.001725 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.175993 PROJECTAWAY(MILLISECONDS) : 1.105006 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002691 DISJOIN(MILLISECONDS) : 0.322970 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.007220 ADD_EQUALITY(MILLISECONDS) : 0.006248 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006306 #CONJOIN_DISJUNCTIVE : 4225 #RENAME_VARIABLES : 12201 #UNFREEZE : 0 #CONJOIN : 9311 #PROJECTAWAY : 7575 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 2603 #RENAME_VARIABLES_DISJUNCTIVE : 11347 #ADD_EQUALITY : 347 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 37 - 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND TRUE 1 != pc1 || 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] COND FALSE !(1 != pc1 || 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.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-24-22-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-24-22-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-24-22-854.csv Received shutdown request...