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/test-0137_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:23:07,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:23:07,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:23:07,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:23:07,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:23:07,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:23:07,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:23:07,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:23:07,957 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:23:07,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:23:07,959 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:23:07,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:23:07,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:23:07,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:23:07,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:23:07,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:23:07,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:23:07,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:23:07,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:23:07,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:23:07,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:23:07,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:23:07,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:23:07,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:23:07,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:23:07,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:23:07,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:23:07,979 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:23:07,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:23:07,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:23:07,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:23:07,980 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:23:07,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:23:07,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:23:07,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:23:07,991 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:23:07,992 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:23:07,992 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:23:07,992 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:23:07,992 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:23:07,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:23:07,993 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:23:07,993 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:23:07,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:23:07,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:23:07,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:23:07,994 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:23:07,994 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:23:07,995 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:23:07,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:23:07,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:23:07,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:23:07,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:23:07,996 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:23:07,996 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:23:07,996 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:23:07,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:23:07,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:23:07,997 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:23:07,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:23:07,997 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:23:07,997 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:23:07,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:23:07,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:23:07,998 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:23:07,999 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:23:07,999 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:23:08,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:23:08,047 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:23:08,052 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:23:08,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:23:08,054 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:23:08,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i [2018-01-24 16:23:08,256 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:23:08,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:23:08,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:23:08,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:23:08,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:23:08,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63efad59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08, skipping insertion in model container [2018-01-24 16:23:08,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,287 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:23:08,329 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:23:08,469 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:23:08,497 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:23:08,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08 WrapperNode [2018-01-24 16:23:08,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:23:08,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:23:08,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:23:08,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:23:08,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (1/1) ... [2018-01-24 16:23:08,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:23:08,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:23:08,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:23:08,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:23:08,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:23:08" (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:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-01-24 16:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 16:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-24 16:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-24 16:23:08,609 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-24 16:23:08,610 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:23:08,610 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:23:08,610 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:23:08,610 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:23:08,611 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-01-24 16:23:08,612 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 16:23:08,612 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-24 16:23:08,612 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-24 16:23:08,612 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-24 16:23:08,612 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-24 16:23:08,612 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-24 16:23:08,613 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-24 16:23:08,613 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-24 16:23:08,613 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-01-24 16:23:08,613 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-24 16:23:08,613 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:23:08,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:23:08,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:23:09,177 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:23:09,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:23:09 BoogieIcfgContainer [2018-01-24 16:23:09,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:23:09,179 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:23:09,179 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:23:09,179 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:23:09,180 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:23:09" (1/1) ... [2018-01-24 16:23:09,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:23:13,649 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:23:13,687 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:23:13,723 INFO L268 AbstractInterpreter]: Visited 202 different actions 732 times. Merged at 49 different actions 163 times. Never widened. Found 31 fixpoints after 12 different actions. Largest state had 35 variables. [2018-01-24 16:23:13,725 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:23:13,726 INFO L168 Benchmark]: Toolchain (without parser) took 5469.02 ms. Allocated memory was 302.5 MB in the beginning and 665.8 MB in the end (delta: 363.3 MB). Free memory was 262.6 MB in the beginning and 412.0 MB in the end (delta: -149.4 MB). Peak memory consumption was 213.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:13,727 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:23:13,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.01 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 249.4 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:23:13,727 INFO L168 Benchmark]: Boogie Preprocessor took 46.02 ms. Allocated memory is still 302.5 MB. Free memory was 249.4 MB in the beginning and 247.5 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:23:13,728 INFO L168 Benchmark]: RCFGBuilder took 620.34 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 203.3 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:13,728 INFO L168 Benchmark]: Abstract Interpretation took 4546.16 ms. Allocated memory was 302.5 MB in the beginning and 665.8 MB in the end (delta: 363.3 MB). Free memory was 203.3 MB in the beginning and 412.0 MB in the end (delta: -208.7 MB). Peak memory consumption was 154.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:23:13,730 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 249.01 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 249.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.02 ms. Allocated memory is still 302.5 MB. Free memory was 249.4 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 620.34 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 203.3 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 4546.16 ms. Allocated memory was 302.5 MB in the beginning and 665.8 MB in the end (delta: 363.3 MB). Free memory was 203.3 MB in the beginning and 412.0 MB in the end (delta: -208.7 MB). Peak memory consumption was 154.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 167 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1623 LocStat_NO_SUPPORTING_DISEQUALITIES : 568 LocStat_NO_DISJUNCTIONS : -334 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 228 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 368 TransStat_NO_SUPPORTING_DISEQUALITIES : 59 TransStat_NO_DISJUNCTIONS : 260 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.224838 RENAME_VARIABLES(MILLISECONDS) : 0.427694 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.203337 PROJECTAWAY(MILLISECONDS) : 0.254615 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001501 DISJOIN(MILLISECONDS) : 0.202934 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.454258 ADD_EQUALITY(MILLISECONDS) : 0.011692 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.034372 #CONJOIN_DISJUNCTIVE : 1247 #RENAME_VARIABLES : 3034 #UNFREEZE : 0 #CONJOIN : 2356 #PROJECTAWAY : 2051 #ADD_WEAK_EQUALITY : 105 #DISJOIN : 662 #RENAME_VARIABLES_DISJUNCTIVE : 2848 #ADD_EQUALITY : 425 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 49 - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] FCALL 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] FCALL 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] FCALL prev->next = new - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] FCALL 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] FCALL gl_list.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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] FCALL next->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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] EXPR, FCALL next->next [L680] FCALL gl_list.next = next->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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] FCALL head->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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] EXPR, FCALL next->next [L680] FCALL gl_list.next = next->next [L681] FCALL free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage)))) - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] EXPR, FCALL next->next [L680] FCALL gl_list.next = next->next [L681] FCALL free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage)))) [L679] FCALL gl_list.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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] FCALL gl_list.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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] EXPR, FCALL next->next [L680] FCALL gl_list.next = next->next [L681] FCALL free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage)))) [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] FCALL next->next - UnprovableResult [Line: 719]: 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND TRUE, RET list_empty(&gl_list) [L722] gl_sort() [L723] CALL gl_destroy() [L678] struct list_head *next; [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND TRUE &gl_list != (next = gl_list.next) [L680] EXPR, FCALL next->next [L680] FCALL gl_list.next = next->next [L681] FCALL free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage)))) [L679] EXPR, FCALL gl_list.next [L679] EXPR next = gl_list.next [L679] COND FALSE, RET !(&gl_list != (next = gl_list.next)) [L723] gl_destroy() [L724] 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] FCALL dst.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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] FCALL entry->value - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] FCALL entry->value - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] FCALL dst.prev - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] EXPR, FCALL dst.prev [L716] FCALL dst.prev->next = &gl_list - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] EXPR, FCALL dst.prev [L716] FCALL dst.prev->next = &gl_list - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] FCALL (max_pos)->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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] EXPR, FCALL dst.prev [L716] FCALL dst.prev->next = &gl_list [L717] FCALL gl_list = dst - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] EXPR, FCALL dst.prev [L716] FCALL dst.prev->next = &gl_list [L717] FCALL gl_list = dst - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] EXPR, FCALL dst.prev [L716] FCALL dst.prev->next = &gl_list [L717] FCALL gl_list = dst - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND TRUE list_empty(&gl_list) [L693] RET return ((void *)0); [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND FALSE !((max_pos = gl_seek_max())) [L715] EXPR, FCALL dst.next [L715] FCALL dst.next->prev = &gl_list [L716] EXPR, FCALL dst.prev [L716] FCALL dst.prev->next = &gl_list [L717] FCALL gl_list = dst - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] FCALL list->prev - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] FCALL list->prev [L653] FCALL list->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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND TRUE pos != (max_pos) [L699] CALL, EXPR val_from_node(pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L699] EXPR val_from_node(pos) [L699] const int value = val_from_node(pos); [L700] COND TRUE value < max [L698] FCALL pos->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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] EXPR, FCALL list->prev [L653] EXPR, FCALL list->next [L653] CALL __list_del(list->prev, list->next) [L638] FCALL next->prev = prev - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] EXPR, FCALL list->prev [L653] EXPR, FCALL list->next [L653] CALL __list_del(list->prev, list->next) [L638] FCALL next->prev = prev [L639] FCALL prev->next = 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] EXPR, FCALL list->prev [L653] EXPR, FCALL list->next [L653] CALL __list_del(list->prev, list->next) [L638] FCALL next->prev = prev [L639] FCALL prev->next = 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND TRUE pos != (max_pos) [L699] CALL, EXPR val_from_node(pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L699] EXPR val_from_node(pos) [L699] const int value = val_from_node(pos); [L700] COND FALSE !(value < max) [L702] max_pos = pos [L703] max = value [L698] EXPR, FCALL pos->next [L698] pos = pos->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] FCALL list->prev - 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: [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; [L721] CALL gl_read() [L672] CALL gl_insert(__VERIFIER_nondet_int()) [L663] EXPR, FCALL malloc(sizeof *node) [L663] struct node *node = malloc(sizeof *node); [L664] COND FALSE !(!node) [L666] FCALL node->value = value [L667] CALL list_add(&node->linkage, &gl_list) [L643] EXPR, FCALL head->next [L643] CALL __list_add(new, head, head->next) [L631] FCALL next->prev = new [L632] FCALL new->next = next [L633] FCALL new->prev = prev [L634] RET, FCALL prev->next = new [L643] __list_add(new, head, head->next) [L667] FCALL list_add(&node->linkage, &gl_list) [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() [L722] CALL gl_sort() [L709] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L709] list_empty(&gl_list) [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; [L712] struct list_head *max_pos; [L713] CALL, EXPR gl_seek_max() [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; [L692] CALL list_empty(&gl_list) [L625] EXPR, FCALL head->next [L625] RET return head->next == head; [L692] list_empty(&gl_list) [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next [L698] pos = (max_pos)->next [L698] COND TRUE pos != (max_pos) [L699] CALL, EXPR val_from_node(pos) [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); [L686] EXPR, FCALL entry->value [L686] RET return entry->value; [L699] EXPR val_from_node(pos) [L699] const int value = val_from_node(pos); [L700] COND TRUE value < max [L698] EXPR, FCALL pos->next [L698] pos = pos->next [L698] COND FALSE !(pos != (max_pos)) [L705] RET return max_pos; [L713] EXPR gl_seek_max() [L713] EXPR max_pos = gl_seek_max() [L713] COND TRUE (max_pos = gl_seek_max()) [L714] CALL list_move(max_pos, &dst) [L653] EXPR, FCALL list->prev [L653] EXPR, FCALL list->next [L653] CALL __list_del(list->prev, list->next) [L638] FCALL next->prev = prev - 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]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: 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/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-23-13-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-23-13-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-23-13-743.csv Received shutdown request...