java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:59:51,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:59:51,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:59:51,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:59:51,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:59:51,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:59:51,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:59:51,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:59:51,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:59:51,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:59:51,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:59:51,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:59:51,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:59:51,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:59:51,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:59:51,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:59:51,027 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:59:51,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:59:51,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:59:51,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:59:51,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:59:51,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:59:51,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:59:51,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:59:51,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:59:51,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:59:51,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:59:51,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:59:51,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:59:51,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:59:51,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:59:51,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:59:51,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:59:51,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:59:51,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:59:51,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:59:51,046 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:59:51,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:59:51,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:59:51,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:59:51,074 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:59:51,075 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:59:51,075 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:59:51,075 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:59:51,075 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:59:51,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:59:51,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:59:51,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:59:51,076 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:59:51,076 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:59:51,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:59:51,077 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:59:51,077 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:59:51,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:59:51,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:59:51,077 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:59:51,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:59:51,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:59:51,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:59:51,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:59:51,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:59:51,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:59:51,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:59:51,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:59:51,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:59:51,079 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:59:51,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:59:51,080 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:59:51,080 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:59:51,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:59:51,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:59:51,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:59:51,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:59:51,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:59:51,179 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:59:51,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:59:51,249 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c943f95/ebb58ceb4eab4c7db177af29cc07ba7f/FLAGb79a4fdb3 [2018-11-18 21:59:51,833 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:59:51,834 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:59:51,851 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c943f95/ebb58ceb4eab4c7db177af29cc07ba7f/FLAGb79a4fdb3 [2018-11-18 21:59:52,061 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c943f95/ebb58ceb4eab4c7db177af29cc07ba7f [2018-11-18 21:59:52,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:59:52,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:59:52,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:59:52,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:59:52,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:59:52,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52, skipping insertion in model container [2018-11-18 21:59:52,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:59:52,160 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:59:52,582 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:59:52,598 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:59:52,662 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:59:52,812 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:59:52,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52 WrapperNode [2018-11-18 21:59:52,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:59:52,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:59:52,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:59:52,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:59:52,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... [2018-11-18 21:59:52,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:59:52,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:59:52,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:59:52,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:59:52,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (1/1) ... No working directory specified, using /storage/repos/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-11-18 21:59:53,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:59:53,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:59:53,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 21:59:53,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 21:59:53,040 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 21:59:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 21:59:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-18 21:59:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-11-18 21:59:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:59:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:59:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 21:59:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 21:59:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 21:59:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 21:59:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 21:59:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 21:59:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 21:59:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 21:59:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 21:59:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 21:59:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 21:59:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 21:59:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 21:59:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 21:59:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 21:59:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 21:59:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 21:59:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 21:59:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 21:59:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 21:59:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 21:59:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 21:59:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 21:59:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 21:59:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 21:59:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 21:59:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 21:59:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 21:59:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 21:59:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 21:59:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 21:59:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 21:59:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 21:59:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 21:59:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 21:59:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 21:59:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 21:59:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 21:59:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 21:59:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 21:59:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 21:59:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 21:59:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 21:59:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 21:59:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 21:59:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 21:59:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 21:59:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 21:59:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 21:59:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 21:59:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 21:59:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 21:59:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 21:59:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 21:59:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 21:59:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 21:59:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 21:59:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 21:59:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 21:59:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 21:59:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 21:59:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 21:59:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 21:59:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 21:59:53,058 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 21:59:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 21:59:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 21:59:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 21:59:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 21:59:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 21:59:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 21:59:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 21:59:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 21:59:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 21:59:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 21:59:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 21:59:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 21:59:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 21:59:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 21:59:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 21:59:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 21:59:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 21:59:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 21:59:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 21:59:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 21:59:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 21:59:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 21:59:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 21:59:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 21:59:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 21:59:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 21:59:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 21:59:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 21:59:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 21:59:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 21:59:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 21:59:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 21:59:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 21:59:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 21:59:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 21:59:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:59:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:59:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:59:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-18 21:59:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-11-18 21:59:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:59:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:59:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:59:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:59:53,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:59:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:59:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:59:54,188 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:59:54,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:54 BoogieIcfgContainer [2018-11-18 21:59:54,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:59:54,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:59:54,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:59:54,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:59:54,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:59:52" (1/3) ... [2018-11-18 21:59:54,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6e845b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:59:54, skipping insertion in model container [2018-11-18 21:59:54,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:52" (2/3) ... [2018-11-18 21:59:54,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6e845b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:59:54, skipping insertion in model container [2018-11-18 21:59:54,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:54" (3/3) ... [2018-11-18 21:59:54,197 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-18 21:59:54,206 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:59:54,215 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:59:54,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:59:54,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:59:54,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:59:54,266 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:59:54,266 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:59:54,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:59:54,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:59:54,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:59:54,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:59:54,267 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:59:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-18 21:59:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 21:59:54,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:59:54,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:59:54,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:59:54,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:59:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash -539924998, now seen corresponding path program 1 times [2018-11-18 21:59:54,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:59:54,311 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:59:54,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:59:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:54,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:59:54,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2018-11-18 21:59:54,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {47#true} is VALID [2018-11-18 21:59:54,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-18 21:59:54,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #96#return; {47#true} is VALID [2018-11-18 21:59:54,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret16 := main(); {47#true} is VALID [2018-11-18 21:59:54,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {47#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {47#true} is VALID [2018-11-18 21:59:54,645 INFO L256 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {47#true} is VALID [2018-11-18 21:59:54,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#true} ~len := #in~len;~data := #in~data; {47#true} is VALID [2018-11-18 21:59:54,646 INFO L256 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {47#true} is VALID [2018-11-18 21:59:54,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {47#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {47#true} is VALID [2018-11-18 21:59:54,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {47#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {47#true} is VALID [2018-11-18 21:59:54,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {47#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {47#true} is VALID [2018-11-18 21:59:54,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-18 21:59:54,648 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {47#true} {47#true} #86#return; {47#true} is VALID [2018-11-18 21:59:54,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {47#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {47#true} is VALID [2018-11-18 21:59:54,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {47#true} assume !true; {48#false} is VALID [2018-11-18 21:59:54,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {48#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {48#false} is VALID [2018-11-18 21:59:54,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {48#false} assume true; {48#false} is VALID [2018-11-18 21:59:54,664 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {48#false} {47#true} #92#return; {48#false} is VALID [2018-11-18 21:59:54,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {48#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {48#false} is VALID [2018-11-18 21:59:54,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {48#false} assume !true; {48#false} is VALID [2018-11-18 21:59:54,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {48#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {48#false} is VALID [2018-11-18 21:59:54,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {48#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {48#false} is VALID [2018-11-18 21:59:54,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2018-11-18 21:59:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:59:54,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:59:54,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:59:54,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:59:54,688 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-18 21:59:54,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:59:54,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:59:55,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:55,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:59:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:59:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:59:55,060 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-18 21:59:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:55,612 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-18 21:59:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:59:55,612 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-18 21:59:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:59:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:59:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-18 21:59:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:59:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-18 21:59:55,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2018-11-18 21:59:56,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:56,138 INFO L225 Difference]: With dead ends: 64 [2018-11-18 21:59:56,139 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 21:59:56,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:59:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 21:59:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 21:59:56,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:59:56,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-18 21:59:56,190 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 21:59:56,190 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 21:59:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:56,197 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-18 21:59:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 21:59:56,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:59:56,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:59:56,198 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 21:59:56,198 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 21:59:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:56,204 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-18 21:59:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 21:59:56,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:59:56,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:59:56,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:59:56,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:59:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 21:59:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 21:59:56,212 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-18 21:59:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:59:56,213 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 21:59:56,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:59:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 21:59:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 21:59:56,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:59:56,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:59:56,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:59:56,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:59:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash -718912431, now seen corresponding path program 1 times [2018-11-18 21:59:56,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:59:56,217 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:59:56,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:59:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:56,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:59:56,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2018-11-18 21:59:56,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {329#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {329#true} is VALID [2018-11-18 21:59:56,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2018-11-18 21:59:56,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {329#true} {329#true} #96#return; {329#true} is VALID [2018-11-18 21:59:56,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {329#true} call #t~ret16 := main(); {329#true} is VALID [2018-11-18 21:59:56,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {329#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {349#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:59:56,534 INFO L256 TraceCheckUtils]: 6: Hoare triple {349#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {329#true} is VALID [2018-11-18 21:59:56,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {329#true} ~len := #in~len;~data := #in~data; {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-18 21:59:56,535 INFO L256 TraceCheckUtils]: 8: Hoare triple {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {329#true} is VALID [2018-11-18 21:59:56,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {329#true} is VALID [2018-11-18 21:59:56,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {329#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {329#true} is VALID [2018-11-18 21:59:56,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {329#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {329#true} is VALID [2018-11-18 21:59:56,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#true} assume true; {329#true} is VALID [2018-11-18 21:59:56,544 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {329#true} {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #86#return; {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-18 21:59:56,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-18 21:59:56,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-18 21:59:56,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {356#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {384#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 21:59:56,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {384#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {384#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 21:59:56,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {384#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {384#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 21:59:56,565 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {384#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {349#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #92#return; {330#false} is VALID [2018-11-18 21:59:56,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {330#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {330#false} is VALID [2018-11-18 21:59:56,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-18 21:59:56,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {330#false} assume !~bvslt32(~i~0, ~len~0); {330#false} is VALID [2018-11-18 21:59:56,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {330#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {330#false} is VALID [2018-11-18 21:59:56,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {330#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {330#false} is VALID [2018-11-18 21:59:56,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {330#false} assume !false; {330#false} is VALID [2018-11-18 21:59:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:59:56,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:59:56,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:59:56,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:59:56,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-18 21:59:56,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:59:56,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:59:56,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:56,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:59:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:59:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:59:56,671 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-18 21:59:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:57,425 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-18 21:59:57,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:59:57,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-18 21:59:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:59:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:59:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-18 21:59:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:59:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-18 21:59:57,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2018-11-18 21:59:57,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:57,576 INFO L225 Difference]: With dead ends: 59 [2018-11-18 21:59:57,576 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 21:59:57,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:59:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 21:59:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-18 21:59:57,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:59:57,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2018-11-18 21:59:57,612 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2018-11-18 21:59:57,613 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2018-11-18 21:59:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:57,618 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 21:59:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 21:59:57,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:59:57,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:59:57,619 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2018-11-18 21:59:57,620 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2018-11-18 21:59:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:57,624 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 21:59:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 21:59:57,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:59:57,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:59:57,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:59:57,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:59:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 21:59:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-18 21:59:57,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-11-18 21:59:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:59:57,630 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-18 21:59:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:59:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-18 21:59:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 21:59:57,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:59:57,632 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:59:57,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:59:57,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:59:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2065185205, now seen corresponding path program 1 times [2018-11-18 21:59:57,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:59:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:59:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:59:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:57,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:59:57,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-18 21:59:57,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-18 21:59:57,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 21:59:57,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #96#return; {632#true} is VALID [2018-11-18 21:59:57,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret16 := main(); {632#true} is VALID [2018-11-18 21:59:57,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {652#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:59:57,905 INFO L256 TraceCheckUtils]: 6: Hoare triple {652#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {632#true} is VALID [2018-11-18 21:59:57,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#true} ~len := #in~len;~data := #in~data; {632#true} is VALID [2018-11-18 21:59:57,905 INFO L256 TraceCheckUtils]: 8: Hoare triple {632#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {632#true} is VALID [2018-11-18 21:59:57,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {632#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {632#true} is VALID [2018-11-18 21:59:57,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {632#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {632#true} is VALID [2018-11-18 21:59:57,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {632#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {632#true} is VALID [2018-11-18 21:59:57,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 21:59:57,907 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {632#true} {632#true} #86#return; {632#true} is VALID [2018-11-18 21:59:57,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {632#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {632#true} is VALID [2018-11-18 21:59:57,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 21:59:57,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {632#true} assume !!~bvsgt32(~len, 1bv32); {632#true} is VALID [2018-11-18 21:59:57,908 INFO L256 TraceCheckUtils]: 17: Hoare triple {632#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {632#true} is VALID [2018-11-18 21:59:57,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {632#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {632#true} is VALID [2018-11-18 21:59:57,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {632#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {632#true} is VALID [2018-11-18 21:59:57,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {632#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {632#true} is VALID [2018-11-18 21:59:57,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 21:59:57,910 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {632#true} {632#true} #88#return; {632#true} is VALID [2018-11-18 21:59:57,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {632#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {632#true} is VALID [2018-11-18 21:59:57,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {632#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {632#true} is VALID [2018-11-18 21:59:57,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {632#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {632#true} is VALID [2018-11-18 21:59:57,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 21:59:57,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#true} assume !~bvsgt32(~len, 1bv32); {632#true} is VALID [2018-11-18 21:59:57,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {632#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {632#true} is VALID [2018-11-18 21:59:57,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 21:59:57,913 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {632#true} {652#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #92#return; {652#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:59:57,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {652#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {731#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:57,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {731#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {731#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:57,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {731#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {633#false} is VALID [2018-11-18 21:59:57,915 INFO L273 TraceCheckUtils]: 34: Hoare triple {633#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {633#false} is VALID [2018-11-18 21:59:57,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {633#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {633#false} is VALID [2018-11-18 21:59:57,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-18 21:59:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 21:59:57,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:59:57,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:59:57,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:59:57,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-18 21:59:57,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:59:57,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:59:57,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:57,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:59:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:59:58,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:59:58,000 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-11-18 21:59:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:58,375 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 21:59:58,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:59:58,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-18 21:59:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:59:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:59:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-18 21:59:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:59:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-18 21:59:58,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-18 21:59:58,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:58,481 INFO L225 Difference]: With dead ends: 47 [2018-11-18 21:59:58,481 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 21:59:58,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:59:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 21:59:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-18 21:59:58,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:59:58,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-18 21:59:58,521 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-18 21:59:58,522 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-18 21:59:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:58,526 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-18 21:59:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 21:59:58,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:59:58,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:59:58,528 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-18 21:59:58,528 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-18 21:59:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:59:58,532 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-18 21:59:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 21:59:58,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:59:58,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:59:58,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:59:58,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:59:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 21:59:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-18 21:59:58,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2018-11-18 21:59:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:59:58,537 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-18 21:59:58,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:59:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-18 21:59:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 21:59:58,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:59:58,540 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:59:58,540 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:59:58,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:59:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1544650694, now seen corresponding path program 1 times [2018-11-18 21:59:58,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:59:58,541 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:59:58,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:59:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:59:58,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:59:58,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {954#true} call ULTIMATE.init(); {954#true} is VALID [2018-11-18 21:59:58,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {954#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {954#true} is VALID [2018-11-18 21:59:58,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {954#true} {954#true} #96#return; {954#true} is VALID [2018-11-18 21:59:58,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {954#true} call #t~ret16 := main(); {954#true} is VALID [2018-11-18 21:59:58,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {954#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {974#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:59:58,919 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {954#true} is VALID [2018-11-18 21:59:58,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#true} ~len := #in~len;~data := #in~data; {954#true} is VALID [2018-11-18 21:59:58,920 INFO L256 TraceCheckUtils]: 8: Hoare triple {954#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {954#true} is VALID [2018-11-18 21:59:58,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {954#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {954#true} is VALID [2018-11-18 21:59:58,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {954#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {954#true} is VALID [2018-11-18 21:59:58,920 INFO L273 TraceCheckUtils]: 11: Hoare triple {954#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {954#true} is VALID [2018-11-18 21:59:58,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,921 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {954#true} {954#true} #86#return; {954#true} is VALID [2018-11-18 21:59:58,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {954#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {954#true} is VALID [2018-11-18 21:59:58,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {954#true} assume !!~bvsgt32(~len, 1bv32); {954#true} is VALID [2018-11-18 21:59:58,922 INFO L256 TraceCheckUtils]: 17: Hoare triple {954#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {954#true} is VALID [2018-11-18 21:59:58,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {954#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {954#true} is VALID [2018-11-18 21:59:58,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {954#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {954#true} is VALID [2018-11-18 21:59:58,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {954#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {954#true} is VALID [2018-11-18 21:59:58,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,923 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {954#true} {954#true} #88#return; {954#true} is VALID [2018-11-18 21:59:58,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {954#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {954#true} is VALID [2018-11-18 21:59:58,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {954#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {954#true} is VALID [2018-11-18 21:59:58,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {954#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {954#true} is VALID [2018-11-18 21:59:58,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {954#true} assume !~bvsgt32(~len, 1bv32); {954#true} is VALID [2018-11-18 21:59:58,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {954#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {954#true} is VALID [2018-11-18 21:59:58,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,928 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {954#true} {974#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #92#return; {974#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 21:59:58,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {974#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:58,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:58,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0); {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:58,931 INFO L256 TraceCheckUtils]: 34: Hoare triple {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {954#true} is VALID [2018-11-18 21:59:58,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {954#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {954#true} is VALID [2018-11-18 21:59:58,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {954#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {954#true} is VALID [2018-11-18 21:59:58,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:58,948 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {954#true} {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #94#return; {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:58,949 INFO L273 TraceCheckUtils]: 39: Hoare triple {1053#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1078#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:58,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {1078#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1078#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:59:58,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {1078#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {955#false} is VALID [2018-11-18 21:59:58,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {955#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {955#false} is VALID [2018-11-18 21:59:58,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {955#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {955#false} is VALID [2018-11-18 21:59:58,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {955#false} assume !false; {955#false} is VALID [2018-11-18 21:59:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 21:59:58,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:59:59,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {955#false} assume !false; {955#false} is VALID [2018-11-18 21:59:59,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {955#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {955#false} is VALID [2018-11-18 21:59:59,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {955#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {955#false} is VALID [2018-11-18 21:59:59,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {1103#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {955#false} is VALID [2018-11-18 21:59:59,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {1103#(bvslt main_~i~0 main_~len~0)} assume true; {1103#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-18 21:59:59,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1103#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-18 21:59:59,251 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {954#true} {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #94#return; {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 21:59:59,251 INFO L273 TraceCheckUtils]: 37: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,251 INFO L273 TraceCheckUtils]: 36: Hoare triple {954#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {954#true} is VALID [2018-11-18 21:59:59,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {954#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {954#true} is VALID [2018-11-18 21:59:59,252 INFO L256 TraceCheckUtils]: 34: Hoare triple {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {954#true} is VALID [2018-11-18 21:59:59,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0); {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 21:59:59,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume true; {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 21:59:59,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {1135#(bvslt (_ bv1 32) main_~len~0)} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1110#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-18 21:59:59,260 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {954#true} {1135#(bvslt (_ bv1 32) main_~len~0)} #92#return; {1135#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-18 21:59:59,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {954#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {954#true} is VALID [2018-11-18 21:59:59,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {954#true} assume !~bvsgt32(~len, 1bv32); {954#true} is VALID [2018-11-18 21:59:59,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {954#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {954#true} is VALID [2018-11-18 21:59:59,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {954#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {954#true} is VALID [2018-11-18 21:59:59,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {954#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {954#true} is VALID [2018-11-18 21:59:59,262 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {954#true} {954#true} #88#return; {954#true} is VALID [2018-11-18 21:59:59,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {954#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {954#true} is VALID [2018-11-18 21:59:59,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {954#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {954#true} is VALID [2018-11-18 21:59:59,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {954#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {954#true} is VALID [2018-11-18 21:59:59,264 INFO L256 TraceCheckUtils]: 17: Hoare triple {954#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {954#true} is VALID [2018-11-18 21:59:59,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {954#true} assume !!~bvsgt32(~len, 1bv32); {954#true} is VALID [2018-11-18 21:59:59,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {954#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {954#true} is VALID [2018-11-18 21:59:59,265 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {954#true} {954#true} #86#return; {954#true} is VALID [2018-11-18 21:59:59,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {954#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {954#true} is VALID [2018-11-18 21:59:59,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {954#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {954#true} is VALID [2018-11-18 21:59:59,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {954#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {954#true} is VALID [2018-11-18 21:59:59,267 INFO L256 TraceCheckUtils]: 8: Hoare triple {954#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {954#true} is VALID [2018-11-18 21:59:59,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#true} ~len := #in~len;~data := #in~data; {954#true} is VALID [2018-11-18 21:59:59,267 INFO L256 TraceCheckUtils]: 6: Hoare triple {1135#(bvslt (_ bv1 32) main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {954#true} is VALID [2018-11-18 21:59:59,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {954#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1135#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-18 21:59:59,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {954#true} call #t~ret16 := main(); {954#true} is VALID [2018-11-18 21:59:59,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {954#true} {954#true} #96#return; {954#true} is VALID [2018-11-18 21:59:59,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-18 21:59:59,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {954#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {954#true} is VALID [2018-11-18 21:59:59,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {954#true} call ULTIMATE.init(); {954#true} is VALID [2018-11-18 21:59:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 21:59:59,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:59:59,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 21:59:59,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-18 21:59:59,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:59:59,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 21:59:59,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:59:59,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 21:59:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 21:59:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 21:59:59,395 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-18 22:00:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:00,353 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-18 22:00:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:00:00,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-18 22:00:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:00:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:00:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-18 22:00:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:00:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-18 22:00:00,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-18 22:00:00,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:00:00,475 INFO L225 Difference]: With dead ends: 51 [2018-11-18 22:00:00,476 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:00:00,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:00:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:00:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-18 22:00:00,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:00:00,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-18 22:00:00,553 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-18 22:00:00,554 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-18 22:00:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:00,558 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-18 22:00:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 22:00:00,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:00:00,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:00:00,559 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-18 22:00:00,560 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-18 22:00:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:00,563 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-18 22:00:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 22:00:00,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:00:00,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:00:00,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:00:00,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:00:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:00:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-18 22:00:00,568 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 45 [2018-11-18 22:00:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:00:00,568 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-18 22:00:00,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:00:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-18 22:00:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 22:00:00,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:00:00,571 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:00:00,571 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:00:00,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:00:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1024449321, now seen corresponding path program 2 times [2018-11-18 22:00:00,572 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:00:00,572 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:00:00,598 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:00:00,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:00:00,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:00:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:00:00,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:00:00,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:00:01,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:01,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:00:01,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:01,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-18 22:00:01,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:00:01,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:00:01,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:00:01,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 22:00:01,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:01,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 22:00:01,339 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:00:01,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {1461#true} call ULTIMATE.init(); {1461#true} is VALID [2018-11-18 22:00:01,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {1461#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1461#true} is VALID [2018-11-18 22:00:01,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1461#true} {1461#true} #96#return; {1461#true} is VALID [2018-11-18 22:00:01,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {1461#true} call #t~ret16 := main(); {1461#true} is VALID [2018-11-18 22:00:01,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {1461#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,362 INFO L256 TraceCheckUtils]: 6: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1461#true} is VALID [2018-11-18 22:00:01,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {1461#true} ~len := #in~len;~data := #in~data; {1461#true} is VALID [2018-11-18 22:00:01,363 INFO L256 TraceCheckUtils]: 8: Hoare triple {1461#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1461#true} is VALID [2018-11-18 22:00:01,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {1461#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1461#true} is VALID [2018-11-18 22:00:01,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {1461#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1461#true} is VALID [2018-11-18 22:00:01,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {1461#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1461#true} is VALID [2018-11-18 22:00:01,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,364 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1461#true} {1461#true} #86#return; {1461#true} is VALID [2018-11-18 22:00:01,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {1461#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1461#true} is VALID [2018-11-18 22:00:01,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {1461#true} assume !!~bvsgt32(~len, 1bv32); {1461#true} is VALID [2018-11-18 22:00:01,366 INFO L256 TraceCheckUtils]: 17: Hoare triple {1461#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1461#true} is VALID [2018-11-18 22:00:01,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {1461#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1461#true} is VALID [2018-11-18 22:00:01,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {1461#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1461#true} is VALID [2018-11-18 22:00:01,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {1461#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1461#true} is VALID [2018-11-18 22:00:01,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,367 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1461#true} {1461#true} #88#return; {1461#true} is VALID [2018-11-18 22:00:01,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1461#true} is VALID [2018-11-18 22:00:01,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {1461#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1461#true} is VALID [2018-11-18 22:00:01,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {1461#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1461#true} is VALID [2018-11-18 22:00:01,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {1461#true} assume !~bvsgt32(~len, 1bv32); {1461#true} is VALID [2018-11-18 22:00:01,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {1461#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1461#true} is VALID [2018-11-18 22:00:01,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,374 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1461#true} {1481#(= |main_~#s~0.offset| (_ bv0 32))} #92#return; {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} assume true; {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0); {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,376 INFO L256 TraceCheckUtils]: 34: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1461#true} is VALID [2018-11-18 22:00:01,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {1461#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1461#true} is VALID [2018-11-18 22:00:01,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {1461#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1461#true} is VALID [2018-11-18 22:00:01,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {1461#true} assume true; {1461#true} is VALID [2018-11-18 22:00:01,378 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1461#true} {1481#(= |main_~#s~0.offset| (_ bv0 32))} #94#return; {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} assume true; {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,381 INFO L273 TraceCheckUtils]: 41: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0); {1481#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:01,381 INFO L256 TraceCheckUtils]: 42: Hoare triple {1481#(= |main_~#s~0.offset| (_ bv0 32))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1461#true} is VALID [2018-11-18 22:00:01,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {1461#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1596#(and (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base))} is VALID [2018-11-18 22:00:01,386 INFO L273 TraceCheckUtils]: 44: Hoare triple {1596#(and (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1600#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:00:01,387 INFO L273 TraceCheckUtils]: 45: Hoare triple {1600#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} assume true; {1600#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:00:01,390 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1600#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} {1481#(= |main_~#s~0.offset| (_ bv0 32))} #94#return; {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 22:00:01,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 22:00:01,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume true; {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 22:00:01,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !~bvslt32(~i~0, ~len~0); {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 22:00:01,395 INFO L273 TraceCheckUtils]: 50: Hoare triple {1607#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1620#(and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32)))} is VALID [2018-11-18 22:00:01,396 INFO L273 TraceCheckUtils]: 51: Hoare triple {1620#(and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32)))} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1462#false} is VALID [2018-11-18 22:00:01,396 INFO L273 TraceCheckUtils]: 52: Hoare triple {1462#false} assume !false; {1462#false} is VALID [2018-11-18 22:00:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 22:00:01,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:00:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:00:01,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:00:01,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-18 22:00:01,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:00:01,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:00:01,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:00:01,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:00:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:00:01,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:00:01,519 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2018-11-18 22:00:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:03,091 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-18 22:00:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:00:03,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-11-18 22:00:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:00:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:00:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-18 22:00:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:00:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-18 22:00:03,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2018-11-18 22:00:03,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:00:03,249 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:00:03,249 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 22:00:03,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:00:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 22:00:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-11-18 22:00:03,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:00:03,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 47 states. [2018-11-18 22:00:03,338 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 47 states. [2018-11-18 22:00:03,338 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 47 states. [2018-11-18 22:00:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:03,342 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-18 22:00:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-18 22:00:03,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:00:03,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:00:03,343 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 56 states. [2018-11-18 22:00:03,343 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 56 states. [2018-11-18 22:00:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:03,346 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-18 22:00:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-18 22:00:03,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:00:03,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:00:03,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:00:03,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:00:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:00:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-18 22:00:03,351 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 53 [2018-11-18 22:00:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:00:03,351 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-18 22:00:03,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:00:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 22:00:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 22:00:03,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:00:03,353 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:00:03,354 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:00:03,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:00:03,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1704507691, now seen corresponding path program 1 times [2018-11-18 22:00:03,354 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:00:03,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:00:03,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:00:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:00:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:00:03,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:00:03,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:00:03,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:03,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:03,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:00:03,734 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:00:04,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:04,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:04,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 22:00:04,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:04,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:04,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-18 22:00:04,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-18 22:00:04,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:04,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:04,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 22:00:04,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 22:00:04,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:04,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:04,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:04,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:04,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-11-18 22:00:04,570 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:00:04,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 59 [2018-11-18 22:00:04,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-18 22:00:04,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:05,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:05,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:00:05,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:05,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:05,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:05,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:05,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2018-11-18 22:00:05,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2018-11-18 22:00:05,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {1890#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1890#true} is VALID [2018-11-18 22:00:05,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2018-11-18 22:00:05,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #96#return; {1890#true} is VALID [2018-11-18 22:00:05,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret16 := main(); {1890#true} is VALID [2018-11-18 22:00:05,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {1890#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1910#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:00:05,790 INFO L256 TraceCheckUtils]: 6: Hoare triple {1910#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1890#true} is VALID [2018-11-18 22:00:05,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {1890#true} ~len := #in~len;~data := #in~data; {1890#true} is VALID [2018-11-18 22:00:05,791 INFO L256 TraceCheckUtils]: 8: Hoare triple {1890#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1890#true} is VALID [2018-11-18 22:00:05,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {1890#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:05,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:05,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:00:05,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:00:05,800 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {1890#true} #86#return; {1937#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-18 22:00:05,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {1937#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:05,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} assume true; {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:05,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} assume !!~bvsgt32(~len, 1bv32); {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:05,804 INFO L256 TraceCheckUtils]: 17: Hoare triple {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1951#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:00:05,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {1951#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1955#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:00:05,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {1955#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1955#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:00:05,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {1955#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1962#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:00:05,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {1962#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1962#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:00:05,810 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1962#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} #88#return; {1969#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} is VALID [2018-11-18 22:00:05,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {1969#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:05,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:05,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:05,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} assume true; {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:05,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:05,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1990#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-18 22:00:05,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {1990#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} assume true; {1990#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-18 22:00:05,836 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1990#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} {1910#(= |main_~#s~0.offset| (_ bv0 32))} #92#return; {1997#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32))) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-18 22:00:05,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {1997#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32))) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:00:05,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume true; {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:00:05,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume !!~bvslt32(~i~0, ~len~0); {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:00:05,849 INFO L256 TraceCheckUtils]: 34: Hoare triple {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {2011#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:00:05,976 INFO L273 TraceCheckUtils]: 35: Hoare triple {2011#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2015#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} is VALID [2018-11-18 22:00:05,977 INFO L273 TraceCheckUtils]: 36: Hoare triple {2015#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-18 22:00:05,978 INFO L273 TraceCheckUtils]: 37: Hoare triple {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} assume true; {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-18 22:00:05,981 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} {2001#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #94#return; {1891#false} is VALID [2018-11-18 22:00:05,981 INFO L273 TraceCheckUtils]: 39: Hoare triple {1891#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1891#false} is VALID [2018-11-18 22:00:05,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {1891#false} assume true; {1891#false} is VALID [2018-11-18 22:00:05,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {1891#false} assume !!~bvslt32(~i~0, ~len~0); {1891#false} is VALID [2018-11-18 22:00:05,982 INFO L256 TraceCheckUtils]: 42: Hoare triple {1891#false} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1891#false} is VALID [2018-11-18 22:00:05,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {1891#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1891#false} is VALID [2018-11-18 22:00:05,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {1891#false} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {1891#false} is VALID [2018-11-18 22:00:05,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {1891#false} assume true; {1891#false} is VALID [2018-11-18 22:00:05,984 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1891#false} {1891#false} #94#return; {1891#false} is VALID [2018-11-18 22:00:05,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {1891#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1891#false} is VALID [2018-11-18 22:00:05,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {1891#false} assume true; {1891#false} is VALID [2018-11-18 22:00:05,985 INFO L273 TraceCheckUtils]: 49: Hoare triple {1891#false} assume !~bvslt32(~i~0, ~len~0); {1891#false} is VALID [2018-11-18 22:00:05,985 INFO L273 TraceCheckUtils]: 50: Hoare triple {1891#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1891#false} is VALID [2018-11-18 22:00:05,985 INFO L273 TraceCheckUtils]: 51: Hoare triple {1891#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1891#false} is VALID [2018-11-18 22:00:05,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2018-11-18 22:00:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:00:05,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:00:09,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-18 22:00:09,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-18 22:00:09,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:09,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:09,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:09,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:18 [2018-11-18 22:00:09,645 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:00:10,300 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 22:00:10,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-18 22:00:10,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:10,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2018-11-18 22:00:10,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 22:00:10,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:10,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-18 22:00:11,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 22:00:11,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-18 22:00:11,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 22:00:11,126 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 22:00:11,140 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,142 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:11,173 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:74, output treesize:6 [2018-11-18 22:00:13,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 48 [2018-11-18 22:00:13,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-18 22:00:13,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:13,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-11-18 22:00:13,963 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-11-18 22:00:13,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-18 22:00:13,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 22:00:14,124 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-18 22:00:14,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-18 22:00:14,266 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 22:00:14,292 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,306 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:14,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-18 22:00:14,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 4 [2018-11-18 22:00:14,430 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,433 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:14,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:00:14,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:00:14,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:00:14,525 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:76, output treesize:8 [2018-11-18 22:00:15,277 INFO L273 TraceCheckUtils]: 52: Hoare triple {1891#false} assume !false; {1891#false} is VALID [2018-11-18 22:00:15,277 INFO L273 TraceCheckUtils]: 51: Hoare triple {1891#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1891#false} is VALID [2018-11-18 22:00:15,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {1891#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1891#false} is VALID [2018-11-18 22:00:15,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {1891#false} assume !~bvslt32(~i~0, ~len~0); {1891#false} is VALID [2018-11-18 22:00:15,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {1891#false} assume true; {1891#false} is VALID [2018-11-18 22:00:15,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {1891#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1891#false} is VALID [2018-11-18 22:00:15,279 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1890#true} {1891#false} #94#return; {1891#false} is VALID [2018-11-18 22:00:15,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {1890#true} assume true; {1890#true} is VALID [2018-11-18 22:00:15,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {1890#true} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {1890#true} is VALID [2018-11-18 22:00:15,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {1890#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1890#true} is VALID [2018-11-18 22:00:15,280 INFO L256 TraceCheckUtils]: 42: Hoare triple {1891#false} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1890#true} is VALID [2018-11-18 22:00:15,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {1891#false} assume !!~bvslt32(~i~0, ~len~0); {1891#false} is VALID [2018-11-18 22:00:15,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {1891#false} assume true; {1891#false} is VALID [2018-11-18 22:00:15,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {1891#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1891#false} is VALID [2018-11-18 22:00:15,282 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} #94#return; {1891#false} is VALID [2018-11-18 22:00:15,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} assume true; {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-18 22:00:15,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {2120#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= |dll_circular_remove_last_#t~mem8.base| dll_circular_remove_last_~last~1.base)) (not (= |dll_circular_remove_last_#t~mem8.offset| dll_circular_remove_last_~last~1.offset)))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {2019#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-18 22:00:15,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {2124#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2120#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= |dll_circular_remove_last_#t~mem8.base| dll_circular_remove_last_~last~1.base)) (not (= |dll_circular_remove_last_#t~mem8.offset| dll_circular_remove_last_~last~1.offset)))} is VALID [2018-11-18 22:00:15,289 INFO L256 TraceCheckUtils]: 34: Hoare triple {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {2124#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} is VALID [2018-11-18 22:00:15,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} assume !!~bvslt32(~i~0, ~len~0); {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} is VALID [2018-11-18 22:00:15,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} assume true; {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} is VALID [2018-11-18 22:00:15,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {2134#(forall ((|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret13.base|)) |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32))) |main_#t~ret13.base|)))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {2110#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} is VALID [2018-11-18 22:00:15,341 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2142#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (bvadd |v_main_~#s~0.offset_BEFORE_CALL_8| (_ bv4294967292 32)) (_ bv0 32)) (not (= |dll_circular_create_#res.base| (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8| |dll_circular_create_#res.base|)) |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))))))} {2138#(not (= (bvadd |main_~#s~0.offset| (_ bv4294967292 32)) (_ bv0 32)))} #92#return; {2134#(forall ((|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret13.base|)) |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32))) |main_#t~ret13.base|)))} is VALID [2018-11-18 22:00:15,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {2142#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (bvadd |v_main_~#s~0.offset_BEFORE_CALL_8| (_ bv4294967292 32)) (_ bv0 32)) (not (= |dll_circular_create_#res.base| (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8| |dll_circular_create_#res.base|)) |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))))))} assume true; {2142#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (bvadd |v_main_~#s~0.offset_BEFORE_CALL_8| (_ bv4294967292 32)) (_ bv0 32)) (not (= |dll_circular_create_#res.base| (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8| |dll_circular_create_#res.base|)) |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))))))} is VALID [2018-11-18 22:00:15,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2142#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_8| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (bvadd |v_main_~#s~0.offset_BEFORE_CALL_8| (_ bv4294967292 32)) (_ bv0 32)) (not (= |dll_circular_create_#res.base| (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_8| |dll_circular_create_#res.base|)) |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))))))} is VALID [2018-11-18 22:00:15,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:15,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} assume true; {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:15,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1980#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:15,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:15,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {1969#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1973#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:00:15,353 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2170#(and (not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|))) (or (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2)))) (= |node_create_#res.offset| (_ bv0 32))))} {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} #88#return; {1969#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} is VALID [2018-11-18 22:00:15,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {2170#(and (not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|))) (or (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2)))) (= |node_create_#res.offset| (_ bv0 32))))} assume true; {2170#(and (not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|))) (or (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2)))) (= |node_create_#res.offset| (_ bv0 32))))} is VALID [2018-11-18 22:00:15,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {2177#(and (not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base))) (or (= node_create_~temp~0.offset (_ bv0 32)) (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2))))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2170#(and (not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|))) (or (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2)))) (= |node_create_#res.offset| (_ bv0 32))))} is VALID [2018-11-18 22:00:15,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {2177#(and (not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base))) (or (= node_create_~temp~0.offset (_ bv0 32)) (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2))))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2177#(and (not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base))) (or (= node_create_~temp~0.offset (_ bv0 32)) (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2))))))} is VALID [2018-11-18 22:00:15,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {2184#(forall ((|v_node_create_#t~malloc2.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_25|))) (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#t~malloc2.base_25|)))))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2177#(and (not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base))) (or (= node_create_~temp~0.offset (_ bv0 32)) (forall ((v_dll_circular_create_~last~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv1 1) (select |old(#valid)| v_dll_circular_create_~last~0.base_BEFORE_CALL_2))))))} is VALID [2018-11-18 22:00:15,360 INFO L256 TraceCheckUtils]: 17: Hoare triple {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2184#(forall ((|v_node_create_#t~malloc2.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_25|))) (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#t~malloc2.base_25|)))))} is VALID [2018-11-18 22:00:15,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} assume !!~bvsgt32(~len, 1bv32); {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:15,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} assume true; {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:15,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {1937#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1941#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:15,363 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {1890#true} #86#return; {1937#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-18 22:00:15,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:00:15,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1930#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-18 22:00:15,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:15,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {1890#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1923#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:00:15,367 INFO L256 TraceCheckUtils]: 8: Hoare triple {1890#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1890#true} is VALID [2018-11-18 22:00:15,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {1890#true} ~len := #in~len;~data := #in~data; {1890#true} is VALID [2018-11-18 22:00:15,368 INFO L256 TraceCheckUtils]: 6: Hoare triple {2138#(not (= (bvadd |main_~#s~0.offset| (_ bv4294967292 32)) (_ bv0 32)))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1890#true} is VALID [2018-11-18 22:00:15,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {1890#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2138#(not (= (bvadd |main_~#s~0.offset| (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-18 22:00:15,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret16 := main(); {1890#true} is VALID [2018-11-18 22:00:15,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #96#return; {1890#true} is VALID [2018-11-18 22:00:15,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2018-11-18 22:00:15,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {1890#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1890#true} is VALID [2018-11-18 22:00:15,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1890#true} is VALID [2018-11-18 22:00:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:00:15,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:00:15,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-11-18 22:00:15,384 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-11-18 22:00:15,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:00:15,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:00:15,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:00:15,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:00:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:00:15,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=680, Unknown=8, NotChecked=0, Total=756 [2018-11-18 22:00:15,964 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 28 states. [2018-11-18 22:00:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:27,666 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2018-11-18 22:00:27,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:00:27,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-11-18 22:00:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:00:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:00:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 69 transitions. [2018-11-18 22:00:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:00:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 69 transitions. [2018-11-18 22:00:27,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 69 transitions. [2018-11-18 22:00:28,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:00:28,169 INFO L225 Difference]: With dead ends: 68 [2018-11-18 22:00:28,170 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:00:28,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=171, Invalid=1498, Unknown=53, NotChecked=0, Total=1722 [2018-11-18 22:00:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:00:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-18 22:00:28,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:00:28,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-18 22:00:28,251 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-18 22:00:28,251 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-18 22:00:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:28,253 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-18 22:00:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 22:00:28,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:00:28,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:00:28,254 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-18 22:00:28,254 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-18 22:00:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:00:28,257 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-18 22:00:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 22:00:28,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:00:28,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:00:28,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:00:28,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:00:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:00:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-18 22:00:28,260 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 53 [2018-11-18 22:00:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:00:28,261 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-18 22:00:28,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:00:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:00:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 22:00:28,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:00:28,263 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:00:28,263 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:00:28,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:00:28,263 INFO L82 PathProgramCache]: Analyzing trace with hash 116159789, now seen corresponding path program 1 times [2018-11-18 22:00:28,264 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:00:28,264 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:00:28,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:00:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:00:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:00:28,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:00:28,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:00:28,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:28,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:28,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:00:28,662 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:00:29,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:00:29,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:29,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:00:29,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:29,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-18 22:00:29,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-18 22:00:29,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-18 22:00:29,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:29,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:29,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2018-11-18 22:00:29,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-18 22:00:29,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-18 22:00:29,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-18 22:00:29,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:29,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 51 [2018-11-18 22:00:29,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 22:00:29,849 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,868 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:29,932 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:89, output treesize:100 [2018-11-18 22:00:30,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:30,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:30,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:30,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-18 22:00:30,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:86 [2018-11-18 22:00:30,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:30,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2018-11-18 22:00:30,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:30,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 82 [2018-11-18 22:00:30,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:00:30,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:30,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:134 [2018-11-18 22:00:32,392 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:00:33,581 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2018-11-18 22:00:33,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:33,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:33,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:00:33,985 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:00:34,225 INFO L303 Elim1Store]: Index analysis took 465 ms [2018-11-18 22:00:34,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 554 [2018-11-18 22:00:34,243 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:00:34,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 268 [2018-11-18 22:00:34,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:34,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:00:34,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:34,580 INFO L303 Elim1Store]: Index analysis took 157 ms [2018-11-18 22:00:34,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 339 [2018-11-18 22:00:34,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:34,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 95 [2018-11-18 22:00:34,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:00:34,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:34,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:00:34,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:34,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:34,917 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:00:34,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:34,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:34,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 231 [2018-11-18 22:00:35,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:00:35,131 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 233 treesize of output 197 [2018-11-18 22:00:35,189 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-18 22:00:36,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:36,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:36,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 163 [2018-11-18 22:00:36,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:36,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:36,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:37,082 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 156 [2018-11-18 22:00:37,156 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:37,769 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:38,266 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:38,754 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:39,315 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:39,816 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:40,335 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:40,900 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-11-18 22:00:41,583 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-11-18 22:00:41,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 155 [2018-11-18 22:00:41,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:41,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2018-11-18 22:00:41,727 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:41,755 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:41,822 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:41,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:41,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:41,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 182 [2018-11-18 22:00:41,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:41,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:41,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:42,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:00:42,093 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-18 22:00:42,175 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 184 treesize of output 222 [2018-11-18 22:00:42,972 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:44,752 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:46,329 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:47,788 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:49,197 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:50,696 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:52,209 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:00:53,738 INFO L267 ElimStorePlain]: Start of recursive call 21: 6 dim-0 vars, 7 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-18 22:00:55,311 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-18 22:01:01,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 41 dim-0 vars, and 15 xjuncts. [2018-11-18 22:01:09,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 41 dim-0 vars, and 15 xjuncts. [2018-11-18 22:01:09,830 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 2 variables, input treesize:704, output treesize:2769 [2018-11-18 22:01:11,840 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:01:15,742 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 529 DAG size of output: 45 [2018-11-18 22:01:16,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {2523#true} call ULTIMATE.init(); {2523#true} is VALID [2018-11-18 22:01:16,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {2523#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2523#true} is VALID [2018-11-18 22:01:16,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {2523#true} assume true; {2523#true} is VALID [2018-11-18 22:01:16,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2523#true} {2523#true} #96#return; {2523#true} is VALID [2018-11-18 22:01:16,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {2523#true} call #t~ret16 := main(); {2523#true} is VALID [2018-11-18 22:01:16,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {2523#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2543#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:16,369 INFO L256 TraceCheckUtils]: 6: Hoare triple {2543#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {2547#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:01:16,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {2547#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {2547#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:01:16,374 INFO L256 TraceCheckUtils]: 8: Hoare triple {2547#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2547#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:01:16,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {2547#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2557#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:01:16,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {2557#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2557#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:01:16,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {2557#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2564#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:16,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {2564#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2564#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:16,380 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2564#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2547#(= |#valid| |old(#valid)|)} #86#return; {2571#(and (= (_ bv0 1) (select |old(#valid)| |dll_circular_create_#t~ret3.base|)) (= |dll_circular_create_#t~ret3.offset| (_ bv0 32)) (= |#valid| (store |old(#valid)| |dll_circular_create_#t~ret3.base| (_ bv1 1))))} is VALID [2018-11-18 22:01:16,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {2571#(and (= (_ bv0 1) (select |old(#valid)| |dll_circular_create_#t~ret3.base|)) (= |dll_circular_create_#t~ret3.offset| (_ bv0 32)) (= |#valid| (store |old(#valid)| |dll_circular_create_#t~ret3.base| (_ bv1 1))))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-18 22:01:16,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume true; {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-18 22:01:16,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume !!~bvsgt32(~len, 1bv32); {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-18 22:01:16,385 INFO L256 TraceCheckUtils]: 17: Hoare triple {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2547#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:01:16,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2588#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:01:16,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {2588#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2588#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:01:16,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {2588#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2595#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:16,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {2595#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2595#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:16,393 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2595#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2575#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} #88#return; {2602#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |dll_circular_create_#t~ret4.base|) (_ bv0 1)) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-18 22:01:16,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {2602#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |dll_circular_create_#t~ret4.base|) (_ bv0 1)) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {2606#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-18 22:01:16,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {2606#(and (= (select |old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {2610#(and (= dll_circular_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)) (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:01:16,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {2610#(and (= dll_circular_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)) (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2614#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:01:16,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {2614#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)))} assume true; {2614#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:01:16,400 INFO L273 TraceCheckUtils]: 27: Hoare triple {2614#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {2614#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)))} is VALID [2018-11-18 22:01:16,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {2614#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| dll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2624#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 1)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} is VALID [2018-11-18 22:01:16,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {2624#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 1)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} assume true; {2624#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 1)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} is VALID [2018-11-18 22:01:16,411 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2624#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 1)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} {2543#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #92#return; {2631#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32)) |main_#t~ret13.base|) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32)) |main_#t~ret13.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:16,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {2631#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32)) |main_#t~ret13.base|) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32)) |main_#t~ret13.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-18 22:01:16,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} assume true; {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-18 22:01:16,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} assume !!~bvslt32(~i~0, ~len~0); {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-18 22:01:16,417 INFO L256 TraceCheckUtils]: 34: Hoare triple {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {2645#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:01:16,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {2645#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2649#(and (= dll_circular_remove_last_~last~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_circular_remove_last_~last~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))))} is VALID [2018-11-18 22:01:18,428 INFO L273 TraceCheckUtils]: 36: Hoare triple {2649#(and (= dll_circular_remove_last_~last~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_circular_remove_last_~last~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))))} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {2653#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} is UNKNOWN [2018-11-18 22:01:18,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {2653#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} assume true; {2653#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} is VALID [2018-11-18 22:01:18,481 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2653#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} {2635#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} #94#return; {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:01:18,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:01:18,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume true; {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:01:18,495 INFO L273 TraceCheckUtils]: 41: Hoare triple {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume !!~bvslt32(~i~0, ~len~0); {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:01:18,497 INFO L256 TraceCheckUtils]: 42: Hoare triple {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {2645#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:01:18,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {2645#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2676#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} is VALID [2018-11-18 22:01:18,625 INFO L273 TraceCheckUtils]: 44: Hoare triple {2676#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {2680#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} is VALID [2018-11-18 22:01:18,629 INFO L273 TraceCheckUtils]: 45: Hoare triple {2680#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} assume true; {2680#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} is VALID [2018-11-18 22:01:18,633 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2680#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} {2660#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_DerPreprocessor_14 (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv0 32))) (= v_DerPreprocessor_14 (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_14) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32)) v_arrayElimCell_41)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_41) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_41) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_41)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #94#return; {2524#false} is VALID [2018-11-18 22:01:18,633 INFO L273 TraceCheckUtils]: 47: Hoare triple {2524#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2524#false} is VALID [2018-11-18 22:01:18,633 INFO L273 TraceCheckUtils]: 48: Hoare triple {2524#false} assume true; {2524#false} is VALID [2018-11-18 22:01:18,633 INFO L273 TraceCheckUtils]: 49: Hoare triple {2524#false} assume !~bvslt32(~i~0, ~len~0); {2524#false} is VALID [2018-11-18 22:01:18,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {2524#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2524#false} is VALID [2018-11-18 22:01:18,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {2524#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {2524#false} is VALID [2018-11-18 22:01:18,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {2524#false} assume !false; {2524#false} is VALID [2018-11-18 22:01:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:01:18,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:01:23,494 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-18 22:01:23,954 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-18 22:01:24,776 WARN L180 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-18 22:01:25,354 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-18 22:01:29,847 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-18 22:01:33,536 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-18 22:01:39,126 WARN L180 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-18 22:01:48,385 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 89 [2018-11-18 22:01:52,138 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-18 22:01:54,327 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 97 [2018-11-18 22:01:54,742 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-18 22:01:55,221 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 22:01:55,744 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-18 22:01:57,186 WARN L180 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 1 [2018-11-18 22:01:57,187 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,187 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:14091, output treesize:1 [2018-11-18 22:02:08,158 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-18 22:02:32,923 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 101 [2018-11-18 22:02:49,288 WARN L180 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-18 22:02:51,872 INFO L303 Elim1Store]: Index analysis took 536 ms [2018-11-18 22:02:51,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14061 treesize of output 10793 [2018-11-18 22:02:51,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 22:02:51,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:54,363 INFO L303 Elim1Store]: Index analysis took 1545 ms [2018-11-18 22:02:56,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10792 treesize of output 9506 [2018-11-18 22:02:57,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9492 treesize of output 9491 [2018-11-18 22:02:57,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:27,477 INFO L303 Elim1Store]: Index analysis took 340 ms [2018-11-18 22:03:27,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9491 treesize of output 9492 [2018-11-18 22:03:27,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.