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/mempurity-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-a5595af
[2018-01-31 22:27:52,594 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-01-31 22:27:52,596 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-31 22:27:52,610 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-31 22:27:52,610 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-31 22:27:52,611 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-31 22:27:52,612 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-31 22:27:52,614 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-31 22:27:52,616 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-31 22:27:52,617 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-31 22:27:52,618 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-31 22:27:52,618 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-31 22:27:52,619 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-31 22:27:52,621 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-31 22:27:52,622 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-31 22:27:52,625 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-31 22:27:52,627 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-31 22:27:52,629 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-31 22:27:52,630 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-31 22:27:52,631 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-31 22:27:52,634 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-31 22:27:52,634 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-31 22:27:52,634 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-31 22:27:52,635 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-31 22:27:52,636 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-31 22:27:52,637 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-31 22:27:52,638 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-31 22:27:52,638 INFO  L177        SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-31 22:27:52,639 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-31 22:27:52,639 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-31 22:27:52,640 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-01-31 22:27:52,640 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ_imprecise.epf
[2018-01-31 22:27:52,651 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-01-31 22:27:52,651 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-31 22:27:52,652 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-31 22:27:52,652 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-01-31 22:27:52,652 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-31 22:27:52,653 INFO  L133        SettingsManager]:  * Deactivate Weak Equivalences=true
[2018-01-31 22:27:52,653 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-31 22:27:52,653 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-01-31 22:27:52,654 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-31 22:27:52,654 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-01-31 22:27:52,654 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-01-31 22:27:52,654 INFO  L133        SettingsManager]:  * Check allocation purity=true
[2018-01-31 22:27:52,654 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-01-31 22:27:52,655 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-01-31 22:27:52,655 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-01-31 22:27:52,655 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-01-31 22:27:52,655 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-31 22:27:52,655 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-01-31 22:27:52,656 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-01-31 22:27:52,656 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-01-31 22:27:52,656 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-01-31 22:27:52,656 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-31 22:27:52,656 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-01-31 22:27:52,657 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-01-31 22:27:52,657 INFO  L133        SettingsManager]:  * Add additional assume for each assert=false
[2018-01-31 22:27:52,657 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-01-31 22:27:52,657 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-31 22:27:52,657 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-31 22:27:52,658 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-01-31 22:27:52,658 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-01-31 22:27:52,658 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-31 22:27:52,658 INFO  L133        SettingsManager]:  * Stop after first violation was found=false
[2018-01-31 22:27:52,658 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-01-31 22:27:52,659 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-31 22:27:52,659 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-31 22:27:52,659 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-31 22:27:52,660 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-31 22:27:52,660 INFO  L133        SettingsManager]:  * TransformationType=HEAP_SEPARATOR
[2018-01-31 22:27:52,696 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-31 22:27:52,709 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-31 22:27:52,713 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-31 22:27:52,715 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-01-31 22:27:52,715 INFO  L276        PluginConnector]: CDTParser initialized
[2018-01-31 22:27:52,716 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i
[2018-01-31 22:27:52,938 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-31 22:27:52,943 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-31 22:27:52,944 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-31 22:27:52,944 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-31 22:27:52,949 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-31 22:27:52,950 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:27:52" (1/1) ...
[2018-01-31 22:27:52,952 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d87b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:52, skipping insertion in model container
[2018-01-31 22:27:52,952 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:27:52" (1/1) ...
[2018-01-31 22:27:52,965 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-31 22:27:53,014 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-31 22:27:53,150 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-31 22:27:53,181 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-31 22:27:53,196 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53 WrapperNode
[2018-01-31 22:27:53,196 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-31 22:27:53,197 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-31 22:27:53,197 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-31 22:27:53,197 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-01-31 22:27:53,210 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,210 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,220 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,221 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,233 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,242 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,246 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,249 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-31 22:27:53,250 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-31 22:27:53,250 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-01-31 22:27:53,250 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-01-31 22:27:53,251 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:27:53" (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-31 22:27:53,297 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-31 22:27:53,297 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-31 22:27:53,330 INFO  L136     BoogieDeclarations]: Found implementation of procedure fail
[2018-01-31 22:27:53,330 INFO  L136     BoogieDeclarations]: Found implementation of procedure inspect
[2018-01-31 22:27:53,330 INFO  L136     BoogieDeclarations]: Found implementation of procedure __list_add
[2018-01-31 22:27:53,330 INFO  L136     BoogieDeclarations]: Found implementation of procedure __list_del
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure list_add
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure list_move
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure gl_insert
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure gl_read
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure gl_destroy
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure val_from_node
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure gl_sort_pass
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure gl_sort
[2018-01-31 22:27:53,331 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-01-31 22:27:53,331 INFO  L128     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-31 22:27:53,331 INFO  L128     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure write~int
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure read~int
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure free
[2018-01-31 22:27:53,332 INFO  L128     BoogieDeclarations]: Found specification of procedure abort
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure fail
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure inspect
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure __list_add
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure __list_del
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure list_add
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure list_move
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure gl_insert
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure gl_read
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure gl_destroy
[2018-01-31 22:27:53,333 INFO  L128     BoogieDeclarations]: Found specification of procedure val_from_node
[2018-01-31 22:27:53,334 INFO  L128     BoogieDeclarations]: Found specification of procedure gl_sort_pass
[2018-01-31 22:27:53,334 INFO  L128     BoogieDeclarations]: Found specification of procedure gl_sort
[2018-01-31 22:27:53,334 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-01-31 22:27:53,334 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-31 22:27:53,334 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-31 22:27:53,902 INFO  L257             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-31 22:27:53,903 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:27:53 BoogieIcfgContainer
[2018-01-31 22:27:53,903 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-31 22:27:53,904 INFO  L113        PluginConnector]: ------------------------Abstract Interpretation----------------------------
[2018-01-31 22:27:53,904 INFO  L271        PluginConnector]: Initializing Abstract Interpretation...
[2018-01-31 22:27:53,904 INFO  L276        PluginConnector]: Abstract Interpretation initialized
[2018-01-31 22:27:53,905 INFO  L185        PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:27:53" (1/1) ...
[2018-01-31 22:27:53,965 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2)
[2018-01-31 22:28:33,766 INFO  L262    AbstractInterpreter]: Some error location(s) were reachable
[2018-01-31 22:28:33,776 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,780 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,780 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,780 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,780 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,785 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,786 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,786 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,786 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,786 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,789 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,790 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,790 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,790 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,790 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,791 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,791 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,791 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,791 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,792 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,802 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,802 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,802 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,803 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,803 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,803 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,803 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,804 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,804 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,804 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,804 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,813 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,813 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,813 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,813 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,814 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,814 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,814 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,814 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,815 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,815 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,815 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,815 WARN  L343   cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-01-31 22:28:33,823 INFO  L271    AbstractInterpreter]: Visited 270 different actions 1816 times. Merged at 45 different actions 257 times. Never widened. Found 59 fixpoints after 14 different actions. Largest state had 54 variables.
[2018-01-31 22:28:33,825 INFO  L132        PluginConnector]: ------------------------ END Abstract Interpretation----------------------------
[2018-01-31 22:28:33,826 INFO  L168              Benchmark]: Toolchain (without parser) took 40887.75 ms. Allocated memory was 305.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 262.2 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 800.4 MB. Max. memory is 5.3 GB.
[2018-01-31 22:28:33,827 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-31 22:28:33,827 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 252.73 ms. Allocated memory is still 305.1 MB. Free memory was 261.2 MB in the beginning and 248.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB.
[2018-01-31 22:28:33,827 INFO  L168              Benchmark]: Boogie Preprocessor took 52.93 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 245.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB.
[2018-01-31 22:28:33,828 INFO  L168              Benchmark]: RCFGBuilder took 653.22 ms. Allocated memory is still 305.1 MB. Free memory was 245.2 MB in the beginning and 195.7 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 5.3 GB.
[2018-01-31 22:28:33,828 INFO  L168              Benchmark]: Abstract Interpretation took 39921.47 ms. Allocated memory was 305.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 195.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 733.8 MB. Max. memory is 5.3 GB.
[2018-01-31 22:28:33,830 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.18 ms. Allocated memory is still 305.1 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 252.73 ms. Allocated memory is still 305.1 MB. Free memory was 261.2 MB in the beginning and 248.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB.
 * Boogie Preprocessor took 52.93 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 245.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB.
 * RCFGBuilder took 653.22 ms. Allocated memory is still 305.1 MB. Free memory was 245.2 MB in the beginning and 195.7 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 5.3 GB.
 * Abstract Interpretation took 39921.47 ms. Allocated memory was 305.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 195.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 733.8 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2:
  - StatisticsResult: ArrayEqualityDomainStatistics
    
#Locations                               :     194 
LocStat_MAX_WEQGRAPH_SIZE                :       0 
LocStat_MAX_SIZEOF_WEQEDGELABEL          :       0 
LocStat_NO_SUPPORTING_EQUALITIES         :    2405 
LocStat_NO_SUPPORTING_DISEQUALITIES      :     612 
LocStat_NO_DISJUNCTIONS                  :    -388 
LocStat_MAX_NO_DISJUNCTIONS              :      -1 
#Transitions                             :     298 
TransStat_MAX_WEQGRAPH_SIZE              :       0 
TransStat_MAX_SIZEOF_WEQEDGELABEL        :       0 
TransStat_NO_SUPPORTING_EQUALITIES       :     315 
TransStat_NO_SUPPORTING_DISEQUALITIES    :      57 
TransStat_NO_DISJUNCTIONS                :     267 
TransStat_MAX_NO_DISJUNCTIONS            :       4 

  - StatisticsResult: EqConstraintFactoryStatistics
    
CONJOIN_DISJUNCTIVE(MILLISECONDS)        : 0.389218 
RENAME_VARIABLES(MILLISECONDS)           : 0.143036 
UNFREEZE(MILLISECONDS)                   : 0.000000 
CONJOIN(MILLISECONDS)                    : 0.076230 
PROJECTAWAY(MILLISECONDS)                : 0.057223 
ADD_WEAK_EQUALITY(MILLISECONDS)          : 0.002291 
DISJOIN(MILLISECONDS)                    : 0.207519 
RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.158282 
ADD_EQUALITY(MILLISECONDS)               : 0.009230 
DISJOIN_DISJUNCTIVE(MILLISECONDS)        : 0.000000 
ADD_DISEQUALITY(MILLISECONDS)            : 0.011172 
#CONJOIN_DISJUNCTIVE                     :   12468 
#RENAME_VARIABLES                        :   28870 
#UNFREEZE                                :       0 
#CONJOIN                                 :   17278 
#PROJECTAWAY                             :   13932 
#ADD_WEAK_EQUALITY                       :      78 
#DISJOIN                                 :    6601 
#RENAME_VARIABLES_DISJUNCTIVE            :   30705 
#ADD_EQUALITY                            :     356 
#DISJOIN_DISJUNCTIVE                     :       0 
#ADD_DISEQUALITY                         :      50 

  - UnprovableResult [Line: 1]: 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: 
[L839]  FCALL  struct list_head gl_list = { &(gl_list), &(gl_list) };

  - UnprovableResult [Line: 886]: 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: 
[L839]  FCALL        struct list_head gl_list = { &(gl_list), &(gl_list) };
[L938]  CALL         gl_read()
[L898]  CALL         gl_insert(__VERIFIER_nondet_int())
[L888]  EXPR, FCALL  malloc(sizeof *node)
[L888]               struct node *node = malloc(sizeof *node);
[L889]  COND FALSE   !(!node)
[L891]  FCALL        node->value = value
[L892]  CALL         list_add(&node->linkage, &gl_list)
[L879]  EXPR, FCALL  head->next
[L879]  CALL         __list_add(new, head, head->next)
[L867]  FCALL        next->prev = new
[L868]  FCALL        new->next = next
[L869]  FCALL        new->prev = prev
[L870]  RET, FCALL   prev->next = new
[L879]  RET          __list_add(new, head, head->next)
[L892]               list_add(&node->linkage, &gl_list)
[L893]  FCALL        (&node->nested)->next = (&node->nested)
[L893]  FCALL        (&node->nested)->prev = (&node->nested)
[L893]  COND FALSE   !(0)

  - UnprovableResult [Line: 895]: 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: 
[L839]  FCALL            struct list_head gl_list = { &(gl_list), &(gl_list) };
[L938]  CALL             gl_read()
[L898]  CALL             gl_insert(__VERIFIER_nondet_int())
[L888]  EXPR, FCALL      malloc(sizeof *node)
[L888]                   struct node *node = malloc(sizeof *node);
[L889]  COND FALSE       !(!node)
[L891]  FCALL            node->value = value
[L892]  CALL             list_add(&node->linkage, &gl_list)
[L879]  EXPR, FCALL      head->next
[L879]  CALL             __list_add(new, head, head->next)
[L867]  FCALL            next->prev = new
[L868]  FCALL            new->next = next
[L869]  FCALL            new->prev = prev
[L870]  RET, FCALL       prev->next = new
[L879]  RET              __list_add(new, head, head->next)
[L892]                   list_add(&node->linkage, &gl_list)
[L893]  FCALL            (&node->nested)->next = (&node->nested)
[L893]  FCALL            (&node->nested)->prev = (&node->nested)
[L893]  COND FALSE, RET  !(0)
[L898]                   gl_insert(__VERIFIER_nondet_int())
[L900]  COND FALSE       !(__VERIFIER_nondet_int())

  - UnprovableResult [Line: 902]: 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: 
[L839]  FCALL            struct list_head gl_list = { &(gl_list), &(gl_list) };
[L938]  CALL             gl_read()
[L898]  CALL             gl_insert(__VERIFIER_nondet_int())
[L888]  EXPR, FCALL      malloc(sizeof *node)
[L888]                   struct node *node = malloc(sizeof *node);
[L889]  COND FALSE       !(!node)
[L891]  FCALL            node->value = value
[L892]  CALL             list_add(&node->linkage, &gl_list)
[L879]  EXPR, FCALL      head->next
[L879]  CALL             __list_add(new, head, head->next)
[L867]  FCALL            next->prev = new
[L868]  FCALL            new->next = next
[L869]  FCALL            new->prev = prev
[L870]  RET, FCALL       prev->next = new
[L879]  RET              __list_add(new, head, head->next)
[L892]                   list_add(&node->linkage, &gl_list)
[L893]  FCALL            (&node->nested)->next = (&node->nested)
[L893]  FCALL            (&node->nested)->prev = (&node->nested)
[L893]  COND FALSE, RET  !(0)
[L898]                   gl_insert(__VERIFIER_nondet_int())
[L900]  COND FALSE, RET  !(__VERIFIER_nondet_int())
[L938]                   gl_read()
[L939]  CALL             inspect(&gl_list)
[L842]  COND FALSE       !(!(head))
[L842]  COND FALSE       !(0)
[L843]  EXPR, FCALL      head->next
[L843]  COND FALSE       !(!(head->next != head))
[L843]  COND FALSE       !(0)
[L844]  EXPR, FCALL      head->prev
[L844]  COND FALSE       !(!(head->prev != head))
[L844]  COND FALSE       !(0)
[L845]  EXPR, FCALL      head->prev
[L845]                   head = head->prev
[L846]  COND FALSE       !(!(head))
[L846]  COND FALSE       !(0)
[L847]  EXPR, FCALL      head->next
[L847]  COND FALSE       !(!(head->next != head))
[L847]  COND FALSE       !(0)
[L848]  EXPR, FCALL      head->prev
[L848]  COND FALSE       !(!(head->prev != head))
[L848]  COND FALSE       !(0)
[L849]                   const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage)));
[L850]  COND FALSE       !(!(node))
[L850]  COND FALSE       !(0)
[L851]  EXPR, FCALL      node->nested.next
[L851]  COND FALSE       !(!(node->nested.next == &node->nested))
[L851]  COND FALSE       !(0)
[L852]  EXPR, FCALL      node->nested.prev
[L852]  COND FALSE       !(!(node->nested.prev == &node->nested))
[L852]  COND FALSE       !(0)
[L853]  EXPR, FCALL      node->nested.next
[L853]  COND FALSE       !(!(node->nested.next != &node->linkage))
[L853]  COND FALSE       !(0)
[L854]  EXPR, FCALL      node->nested.prev
[L854]  COND FALSE       !(!(node->nested.prev != &node->linkage))
[L854]  COND FALSE       !(0)
[L855]  COND FALSE       !(!(node != (const struct node *)head))
[L855]  COND FALSE       !(0)
[L856]  COND FALSE       !(!(node != (const struct node *)&node->linkage))
[L856]  COND FALSE       !(0)
[L857]  COND FALSE       !(!(node == (const struct node *)&node->value))
[L857]  COND FALSE       !(0)
[L858]  EXPR, FCALL      node->linkage.next
[L858]  EXPR, FCALL      node->linkage.next->prev
[L858]  COND FALSE       !(!(head == node->linkage.next->prev))
[L858]  COND FALSE       !(0)
[L859]  EXPR, FCALL      node->linkage.prev
[L859]  EXPR, FCALL      node->linkage.prev->next
[L859]  COND FALSE       !(!(head == node->linkage.prev->next))
[L859]  COND FALSE       !(0)
[L860]  EXPR, FCALL      head->next
[L860]                   head = head->next
[L860]  COND FALSE       !(&node->linkage != head)
[L861]  COND FALSE       !(!(((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))) == node))
[L861]  COND FALSE, RET  !(0)
[L939]                   inspect(&gl_list)
[L940]  CALL             gl_sort()
[L933]  CALL             gl_sort_pass()
[L916]                   _Bool any_change = 0;
[L917]  EXPR, FCALL      gl_list.next
[L917]                   struct list_head *pos0 = gl_list.next;
[L918]                   struct list_head *pos1;
[L919]  EXPR, FCALL      pos0->next
[L919]  EXPR             pos1 = pos0->next
[L919]  COND FALSE       !(&gl_list != (pos1 = pos0->next))
[L929]  RET              return any_change;
[L933]                   gl_sort_pass()
[L933]  COND FALSE, RET  !(gl_sort_pass())
[L940]                   gl_sort()
[L941]  CALL             inspect(&gl_list)
[L842]  COND FALSE       !(!(head))
[L842]  COND FALSE       !(0)
[L843]  EXPR, FCALL      head->next
[L843]  COND FALSE       !(!(head->next != head))
[L843]  COND FALSE       !(0)
[L844]  EXPR, FCALL      head->prev
[L844]  COND FALSE       !(!(head->prev != head))
[L844]  COND FALSE       !(0)
[L845]  EXPR, FCALL      head->prev
[L845]                   head = head->prev
[L846]  COND FALSE       !(!(head))
[L846]  COND FALSE       !(0)
[L847]  EXPR, FCALL      head->next
[L847]  COND FALSE       !(!(head->next != head))
[L847]  COND FALSE       !(0)
[L848]  EXPR, FCALL      head->prev
[L848]  COND FALSE       !(!(head->prev != head))
[L848]  COND FALSE       !(0)
[L849]                   const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage)));
[L850]  COND FALSE       !(!(node))
[L850]  COND FALSE       !(0)
[L851]  EXPR, FCALL      node->nested.next
[L851]  COND FALSE       !(!(node->nested.next == &node->nested))
[L851]  COND FALSE       !(0)
[L852]  EXPR, FCALL      node->nested.prev
[L852]  COND FALSE       !(!(node->nested.prev == &node->nested))
[L852]  COND FALSE       !(0)
[L853]  EXPR, FCALL      node->nested.next
[L853]  COND FALSE       !(!(node->nested.next != &node->linkage))
[L853]  COND FALSE       !(0)
[L854]  EXPR, FCALL      node->nested.prev
[L854]  COND FALSE       !(!(node->nested.prev != &node->linkage))
[L854]  COND FALSE       !(0)
[L855]  COND FALSE       !(!(node != (const struct node *)head))
[L855]  COND FALSE       !(0)
[L856]  COND FALSE       !(!(node != (const struct node *)&node->linkage))
[L856]  COND FALSE       !(0)
[L857]  COND FALSE       !(!(node == (const struct node *)&node->value))
[L857]  COND FALSE       !(0)
[L858]  EXPR, FCALL      node->linkage.next
[L858]  EXPR, FCALL      node->linkage.next->prev
[L858]  COND FALSE       !(!(head == node->linkage.next->prev))
[L858]  COND FALSE       !(0)
[L859]  EXPR, FCALL      node->linkage.prev
[L859]  EXPR, FCALL      node->linkage.prev->next
[L859]  COND FALSE       !(!(head == node->linkage.prev->next))
[L859]  COND FALSE       !(0)
[L860]  EXPR, FCALL      head->next
[L860]                   head = head->next
[L860]  COND FALSE       !(&node->linkage != head)
[L861]  COND FALSE       !(!(((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))) == node))
[L861]  COND FALSE, RET  !(0)
[L941]                   inspect(&gl_list)
[L942]  CALL             gl_destroy()
[L904]                   struct list_head *next;
[L905]  EXPR, FCALL      gl_list.next
[L905]  EXPR             next = gl_list.next
[L905]  COND TRUE        &gl_list != (next = gl_list.next)
[L906]  EXPR, FCALL      next->next
[L906]  FCALL            gl_list.next = next->next
[L907]  FCALL            free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage))))
[L905]  EXPR, FCALL      gl_list.next
[L905]  EXPR             next = gl_list.next
[L905]  COND FALSE       !(&gl_list != (next = gl_list.next))

  - UnprovableResult [Line: 936]: 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: 
[L839]  FCALL            struct list_head gl_list = { &(gl_list), &(gl_list) };
[L938]  CALL             gl_read()
[L898]  CALL             gl_insert(__VERIFIER_nondet_int())
[L888]  EXPR, FCALL      malloc(sizeof *node)
[L888]                   struct node *node = malloc(sizeof *node);
[L889]  COND FALSE       !(!node)
[L891]  FCALL            node->value = value
[L892]  CALL             list_add(&node->linkage, &gl_list)
[L879]  EXPR, FCALL      head->next
[L879]  CALL             __list_add(new, head, head->next)
[L867]  FCALL            next->prev = new
[L868]  FCALL            new->next = next
[L869]  FCALL            new->prev = prev
[L870]  RET, FCALL       prev->next = new
[L879]  RET              __list_add(new, head, head->next)
[L892]                   list_add(&node->linkage, &gl_list)
[L893]  FCALL            (&node->nested)->next = (&node->nested)
[L893]  FCALL            (&node->nested)->prev = (&node->nested)
[L893]  COND FALSE, RET  !(0)
[L898]                   gl_insert(__VERIFIER_nondet_int())
[L900]  COND FALSE, RET  !(__VERIFIER_nondet_int())
[L938]                   gl_read()
[L939]  CALL             inspect(&gl_list)
[L842]  COND FALSE       !(!(head))
[L842]  COND FALSE       !(0)
[L843]  EXPR, FCALL      head->next
[L843]  COND FALSE       !(!(head->next != head))
[L843]  COND FALSE       !(0)
[L844]  EXPR, FCALL      head->prev
[L844]  COND FALSE       !(!(head->prev != head))
[L844]  COND FALSE       !(0)
[L845]  EXPR, FCALL      head->prev
[L845]                   head = head->prev
[L846]  COND FALSE       !(!(head))
[L846]  COND FALSE       !(0)
[L847]  EXPR, FCALL      head->next
[L847]  COND FALSE       !(!(head->next != head))
[L847]  COND FALSE       !(0)
[L848]  EXPR, FCALL      head->prev
[L848]  COND FALSE       !(!(head->prev != head))
[L848]  COND FALSE       !(0)
[L849]                   const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage)));
[L850]  COND FALSE       !(!(node))
[L850]  COND FALSE       !(0)
[L851]  EXPR, FCALL      node->nested.next
[L851]  COND FALSE       !(!(node->nested.next == &node->nested))
[L851]  COND FALSE       !(0)
[L852]  EXPR, FCALL      node->nested.prev
[L852]  COND FALSE       !(!(node->nested.prev == &node->nested))
[L852]  COND FALSE       !(0)
[L853]  EXPR, FCALL      node->nested.next
[L853]  COND FALSE       !(!(node->nested.next != &node->linkage))
[L853]  COND FALSE       !(0)
[L854]  EXPR, FCALL      node->nested.prev
[L854]  COND FALSE       !(!(node->nested.prev != &node->linkage))
[L854]  COND FALSE       !(0)
[L855]  COND FALSE       !(!(node != (const struct node *)head))
[L855]  COND FALSE       !(0)
[L856]  COND FALSE       !(!(node != (const struct node *)&node->linkage))
[L856]  COND FALSE       !(0)
[L857]  COND FALSE       !(!(node == (const struct node *)&node->value))
[L857]  COND FALSE       !(0)
[L858]  EXPR, FCALL      node->linkage.next
[L858]  EXPR, FCALL      node->linkage.next->prev
[L858]  COND FALSE       !(!(head == node->linkage.next->prev))
[L858]  COND FALSE       !(0)
[L859]  EXPR, FCALL      node->linkage.prev
[L859]  EXPR, FCALL      node->linkage.prev->next
[L859]  COND FALSE       !(!(head == node->linkage.prev->next))
[L859]  COND FALSE       !(0)
[L860]  EXPR, FCALL      head->next
[L860]                   head = head->next
[L860]  COND FALSE       !(&node->linkage != head)
[L861]  COND FALSE       !(!(((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))) == node))
[L861]  COND FALSE, RET  !(0)
[L939]                   inspect(&gl_list)
[L940]  CALL             gl_sort()
[L933]  CALL             gl_sort_pass()
[L916]                   _Bool any_change = 0;
[L917]  EXPR, FCALL      gl_list.next
[L917]                   struct list_head *pos0 = gl_list.next;
[L918]                   struct list_head *pos1;
[L919]  EXPR, FCALL      pos0->next
[L919]  EXPR             pos1 = pos0->next
[L919]  COND FALSE       !(&gl_list != (pos1 = pos0->next))
[L929]  RET              return any_change;
[L933]                   gl_sort_pass()
[L933]  COND FALSE, RET  !(gl_sort_pass())
[L940]                   gl_sort()
[L941]  CALL             inspect(&gl_list)
[L842]  COND FALSE       !(!(head))
[L842]  COND FALSE       !(0)
[L843]  EXPR, FCALL      head->next
[L843]  COND FALSE       !(!(head->next != head))
[L843]  COND FALSE       !(0)
[L844]  EXPR, FCALL      head->prev
[L844]  COND FALSE       !(!(head->prev != head))
[L844]  COND FALSE       !(0)
[L845]  EXPR, FCALL      head->prev
[L845]                   head = head->prev
[L846]  COND FALSE       !(!(head))
[L846]  COND FALSE       !(0)
[L847]  EXPR, FCALL      head->next
[L847]  COND FALSE       !(!(head->next != head))
[L847]  COND FALSE       !(0)
[L848]  EXPR, FCALL      head->prev
[L848]  COND FALSE       !(!(head->prev != head))
[L848]  COND FALSE       !(0)
[L849]                   const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage)));
[L850]  COND FALSE       !(!(node))
[L850]  COND FALSE       !(0)
[L851]  EXPR, FCALL      node->nested.next
[L851]  COND FALSE       !(!(node->nested.next == &node->nested))
[L851]  COND FALSE       !(0)
[L852]  EXPR, FCALL      node->nested.prev
[L852]  COND FALSE       !(!(node->nested.prev == &node->nested))
[L852]  COND FALSE       !(0)
[L853]  EXPR, FCALL      node->nested.next
[L853]  COND FALSE       !(!(node->nested.next != &node->linkage))
[L853]  COND FALSE       !(0)
[L854]  EXPR, FCALL      node->nested.prev
[L854]  COND FALSE       !(!(node->nested.prev != &node->linkage))
[L854]  COND FALSE       !(0)
[L855]  COND FALSE       !(!(node != (const struct node *)head))
[L855]  COND FALSE       !(0)
[L856]  COND FALSE       !(!(node != (const struct node *)&node->linkage))
[L856]  COND FALSE       !(0)
[L857]  COND FALSE       !(!(node == (const struct node *)&node->value))
[L857]  COND FALSE       !(0)
[L858]  EXPR, FCALL      node->linkage.next
[L858]  EXPR, FCALL      node->linkage.next->prev
[L858]  COND FALSE       !(!(head == node->linkage.next->prev))
[L858]  COND FALSE       !(0)
[L859]  EXPR, FCALL      node->linkage.prev
[L859]  EXPR, FCALL      node->linkage.prev->next
[L859]  COND FALSE       !(!(head == node->linkage.prev->next))
[L859]  COND FALSE       !(0)
[L860]  EXPR, FCALL      head->next
[L860]                   head = head->next
[L860]  COND FALSE       !(&node->linkage != head)
[L861]  COND FALSE       !(!(((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))) == node))
[L861]  COND FALSE, RET  !(0)
[L941]                   inspect(&gl_list)
[L942]  CALL             gl_destroy()
[L904]                   struct list_head *next;
[L905]  EXPR, FCALL      gl_list.next
[L905]  EXPR             next = gl_list.next
[L905]  COND TRUE        &gl_list != (next = gl_list.next)
[L906]  EXPR, FCALL      next->next
[L906]  FCALL            gl_list.next = next->next
[L907]  FCALL            free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage))))
[L905]  EXPR, FCALL      gl_list.next
[L905]  EXPR             next = gl_list.next
[L905]  COND FALSE, RET  !(&gl_list != (next = gl_list.next))
[L942]                   gl_destroy()
[L943]                   return 0;

  - UnprovableResult [Line: 1]: 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: 
[L839]  FCALL            struct list_head gl_list = { &(gl_list), &(gl_list) };
[L938]  CALL             gl_read()
[L898]  CALL             gl_insert(__VERIFIER_nondet_int())
[L888]  EXPR, FCALL      malloc(sizeof *node)
[L888]                   struct node *node = malloc(sizeof *node);
[L889]  COND FALSE       !(!node)
[L891]  FCALL            node->value = value
[L892]  CALL             list_add(&node->linkage, &gl_list)
[L879]  EXPR, FCALL      head->next
[L879]  CALL             __list_add(new, head, head->next)
[L867]  FCALL            next->prev = new
[L868]  FCALL            new->next = next
[L869]  FCALL            new->prev = prev
[L870]  RET, FCALL       prev->next = new
[L879]  RET              __list_add(new, head, head->next)
[L892]                   list_add(&node->linkage, &gl_list)
[L893]  FCALL            (&node->nested)->next = (&node->nested)
[L893]  FCALL            (&node->nested)->prev = (&node->nested)
[L893]  COND FALSE, RET  !(0)
[L898]                   gl_insert(__VERIFIER_nondet_int())
[L900]  COND FALSE, RET  !(__VERIFIER_nondet_int())
[L938]                   gl_read()
[L939]  CALL             inspect(&gl_list)
[L842]  COND FALSE       !(!(head))
[L842]  COND FALSE       !(0)
[L843]  EXPR, FCALL      head->next
[L843]  COND FALSE       !(!(head->next != head))
[L843]  COND FALSE       !(0)
[L844]  EXPR, FCALL      head->prev
[L844]  COND FALSE       !(!(head->prev != head))
[L844]  COND FALSE       !(0)
[L845]  EXPR, FCALL      head->prev
[L845]                   head = head->prev
[L846]  COND FALSE       !(!(head))
[L846]  COND FALSE       !(0)
[L847]  EXPR, FCALL      head->next
[L847]  COND FALSE       !(!(head->next != head))
[L847]  COND FALSE       !(0)
[L848]  EXPR, FCALL      head->prev
[L848]  COND FALSE       !(!(head->prev != head))
[L848]  COND FALSE       !(0)
[L849]                   const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage)));
[L850]  COND FALSE       !(!(node))
[L850]  COND FALSE       !(0)
[L851]  EXPR, FCALL      node->nested.next
[L851]  COND FALSE       !(!(node->nested.next == &node->nested))
[L851]  COND FALSE       !(0)
[L852]  EXPR, FCALL      node->nested.prev
[L852]  COND FALSE       !(!(node->nested.prev == &node->nested))
[L852]  COND FALSE       !(0)
[L853]  EXPR, FCALL      node->nested.next
[L853]  COND FALSE       !(!(node->nested.next != &node->linkage))
[L853]  COND FALSE       !(0)
[L854]  EXPR, FCALL      node->nested.prev
[L854]  COND FALSE       !(!(node->nested.prev != &node->linkage))
[L854]  COND FALSE       !(0)
[L855]  COND FALSE       !(!(node != (const struct node *)head))
[L855]  COND FALSE       !(0)
[L856]  COND FALSE       !(!(node != (const struct node *)&node->linkage))
[L856]  COND FALSE       !(0)
[L857]  COND FALSE       !(!(node == (const struct node *)&node->value))
[L857]  COND FALSE       !(0)
[L858]  EXPR, FCALL      node->linkage.next
[L858]  EXPR, FCALL      node->linkage.next->prev
[L858]  COND FALSE       !(!(head == node->linkage.next->prev))
[L858]  COND FALSE       !(0)
[L859]  EXPR, FCALL      node->linkage.prev
[L859]  EXPR, FCALL      node->linkage.prev->next
[L859]  COND FALSE       !(!(head == node->linkage.prev->next))
[L859]  COND FALSE       !(0)
[L860]  EXPR, FCALL      head->next
[L860]                   head = head->next
[L860]  COND FALSE       !(&node->linkage != head)
[L861]  COND FALSE       !(!(((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))) == node))
[L861]  COND FALSE, RET  !(0)
[L939]                   inspect(&gl_list)
[L940]  CALL             gl_sort()
[L933]  CALL             gl_sort_pass()
[L916]                   _Bool any_change = 0;
[L917]  EXPR, FCALL      gl_list.next
[L917]                   struct list_head *pos0 = gl_list.next;
[L918]                   struct list_head *pos1;
[L919]  EXPR, FCALL      pos0->next
[L919]  EXPR             pos1 = pos0->next
[L919]  COND FALSE       !(&gl_list != (pos1 = pos0->next))
[L929]  RET              return any_change;
[L933]                   gl_sort_pass()
[L933]  COND FALSE, RET  !(gl_sort_pass())
[L940]                   gl_sort()
[L941]  CALL             inspect(&gl_list)
[L842]  COND FALSE       !(!(head))
[L842]  COND FALSE       !(0)
[L843]  EXPR, FCALL      head->next
[L843]  COND FALSE       !(!(head->next != head))
[L843]  COND FALSE       !(0)
[L844]  EXPR, FCALL      head->prev
[L844]  COND FALSE       !(!(head->prev != head))
[L844]  COND FALSE       !(0)
[L845]  EXPR, FCALL      head->prev
[L845]                   head = head->prev
[L846]  COND FALSE       !(!(head))
[L846]  COND FALSE       !(0)
[L847]  EXPR, FCALL      head->next
[L847]  COND FALSE       !(!(head->next != head))
[L847]  COND FALSE       !(0)
[L848]  EXPR, FCALL      head->prev
[L848]  COND FALSE       !(!(head->prev != head))
[L848]  COND FALSE       !(0)
[L849]                   const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage)));
[L850]  COND FALSE       !(!(node))
[L850]  COND FALSE       !(0)
[L851]  EXPR, FCALL      node->nested.next
[L851]  COND FALSE       !(!(node->nested.next == &node->nested))
[L851]  COND FALSE       !(0)
[L852]  EXPR, FCALL      node->nested.prev
[L852]  COND FALSE       !(!(node->nested.prev == &node->nested))
[L852]  COND FALSE       !(0)
[L853]  EXPR, FCALL      node->nested.next
[L853]  COND FALSE       !(!(node->nested.next != &node->linkage))
[L853]  COND FALSE       !(0)
[L854]  EXPR, FCALL      node->nested.prev
[L854]  COND FALSE       !(!(node->nested.prev != &node->linkage))
[L854]  COND FALSE       !(0)
[L855]  COND FALSE       !(!(node != (const struct node *)head))
[L855]  COND FALSE       !(0)
[L856]  COND FALSE       !(!(node != (const struct node *)&node->linkage))
[L856]  COND FALSE       !(0)
[L857]  COND FALSE       !(!(node == (const struct node *)&node->value))
[L857]  COND FALSE       !(0)
[L858]  EXPR, FCALL      node->linkage.next
[L858]  EXPR, FCALL      node->linkage.next->prev
[L858]  COND FALSE       !(!(head == node->linkage.next->prev))
[L858]  COND FALSE       !(0)
[L859]  EXPR, FCALL      node->linkage.prev
[L859]  EXPR, FCALL      node->linkage.prev->next
[L859]  COND FALSE       !(!(head == node->linkage.prev->next))
[L859]  COND FALSE       !(0)
[L860]  EXPR, FCALL      head->next
[L860]                   head = head->next
[L860]  COND FALSE       !(&node->linkage != head)
[L861]  COND FALSE       !(!(((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))) == node))
[L861]  COND FALSE, RET  !(0)
[L941]                   inspect(&gl_list)
[L942]  CALL             gl_destroy()
[L904]                   struct list_head *next;
[L905]  EXPR, FCALL      gl_list.next
[L905]  EXPR             next = gl_list.next
[L905]  COND TRUE        &gl_list != (next = gl_list.next)
[L906]  EXPR, FCALL      next->next
[L906]  FCALL            gl_list.next = next->next
[L907]  FCALL            free(((struct node *)((char *)(next)-(unsigned long)(&((struct node *)0)->linkage))))
[L905]  EXPR, FCALL      gl_list.next
[L905]  EXPR             next = gl_list.next
[L905]  COND FALSE, RET  !(&gl_list != (next = gl_list.next))
[L942]                   gl_destroy()
[L943]                   return 0;

  - PositiveResult [Line: 863]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 910]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 877]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 881]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 872]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 840]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 828]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 931]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - PositiveResult [Line: 914]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed 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)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - GenericResult: Unfinished Backtranslation
    Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
  - 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/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-31_22-28-33-840.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-31_22-28-33-840.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-31_22-28-33-840.csv
Received shutdown request...