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-Const.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:10:59,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:10:59,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:10:59,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:10:59,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:10:59,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:10:59,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:10:59,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:10:59,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:10:59,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:10:59,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:10:59,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:10:59,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:10:59,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:10:59,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:10:59,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:10:59,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:10:59,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:10:59,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:10:59,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:10:59,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:10:59,920 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:10:59,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:10:59,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:10:59,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:10:59,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:10:59,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:10:59,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:10:59,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:10:59,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:10:59,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:10:59,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:10:59,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:10:59,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:10:59,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:10:59,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:10:59,938 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:10:59,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:10:59,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:10:59,957 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:10:59,957 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:10:59,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:10:59,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:10:59,958 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:10:59,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:10:59,959 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:10:59,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:10:59,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:10:59,959 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:10:59,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:10:59,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:10:59,960 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:10:59,960 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:10:59,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:10:59,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:10:59,962 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:10:59,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:10:59,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:10:59,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:10:59,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:10:59,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:10:59,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:10:59,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:10:59,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:10:59,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:10:59,964 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:10:59,964 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:10:59,965 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:10:59,965 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:10:59,965 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:11:00,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:11:00,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:11:00,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:11:00,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:11:00,051 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:11:00,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-14 18:11:00,119 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7eb7948/5198a3062de74a319547c2ddc28f95ce/FLAG91f564039 [2018-11-14 18:11:00,714 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:11:00,715 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-14 18:11:00,728 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7eb7948/5198a3062de74a319547c2ddc28f95ce/FLAG91f564039 [2018-11-14 18:11:00,743 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7eb7948/5198a3062de74a319547c2ddc28f95ce [2018-11-14 18:11:00,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:11:00,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:11:00,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:11:00,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:11:00,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:11:00,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:11:00" (1/1) ... [2018-11-14 18:11:00,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337159d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:00, skipping insertion in model container [2018-11-14 18:11:00,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:11:00" (1/1) ... [2018-11-14 18:11:00,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:11:00,822 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:11:01,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:11:01,273 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:11:01,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:11:01,501 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:11:01,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01 WrapperNode [2018-11-14 18:11:01,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:11:01,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:11:01,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:11:01,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:11:01,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (1/1) ... [2018-11-14 18:11:01,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:11:01,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:11:01,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:11:01,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:11:01,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (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-14 18:11:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:11:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:11:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:11:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:11:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 18:11:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-14 18:11:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-14 18:11:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-14 18:11:01,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:11:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:11:01,710 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:11:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:11:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:11:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:11:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:11:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:11:01,711 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:11:01,712 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:11:01,713 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:11:01,714 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:11:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:11:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:11:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:11:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:11:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:11:01,715 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:11:01,716 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:11:01,717 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:11:01,718 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:11:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:11:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:11:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:11:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:11:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:11:01,719 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:11:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:11:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:11:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:11:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:11:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:11:01,720 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:11:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:11:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:11:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:11:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:11:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:11:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:11:01,722 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:11:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:11:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:11:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:11:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:11:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:11:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 18:11:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-14 18:11:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:11:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:11:01,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:11:01,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:11:01,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:11:01,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:11:03,398 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:11:03,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:11:03 BoogieIcfgContainer [2018-11-14 18:11:03,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:11:03,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:11:03,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:11:03,404 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:11:03,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:11:00" (1/3) ... [2018-11-14 18:11:03,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fffa757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:11:03, skipping insertion in model container [2018-11-14 18:11:03,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:11:01" (2/3) ... [2018-11-14 18:11:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fffa757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:11:03, skipping insertion in model container [2018-11-14 18:11:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:11:03" (3/3) ... [2018-11-14 18:11:03,407 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-11-14 18:11:03,415 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:11:03,423 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:11:03,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:11:03,475 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:11:03,476 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:11:03,476 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:11:03,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:11:03,477 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:11:03,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:11:03,478 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:11:03,478 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:11:03,478 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:11:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-14 18:11:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:11:03,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:03,507 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] [2018-11-14 18:11:03,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:03,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash -617820337, now seen corresponding path program 1 times [2018-11-14 18:11:03,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:03,521 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-14 18:11:03,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:03,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:03,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-14 18:11:03,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {68#true} is VALID [2018-11-14 18:11:03,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-14 18:11:03,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #208#return; {68#true} is VALID [2018-11-14 18:11:03,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret24 := main(); {68#true} is VALID [2018-11-14 18:11:03,736 INFO L256 TraceCheckUtils]: 5: Hoare triple {68#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {68#true} is VALID [2018-11-14 18:11:03,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {68#true} is VALID [2018-11-14 18:11:03,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume !true; {69#false} is VALID [2018-11-14 18:11:03,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 18:11:03,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {69#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {69#false} is VALID [2018-11-14 18:11:03,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-14 18:11:03,739 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {69#false} {68#true} #196#return; {69#false} is VALID [2018-11-14 18:11:03,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {69#false} is VALID [2018-11-14 18:11:03,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {69#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {69#false} is VALID [2018-11-14 18:11:03,740 INFO L256 TraceCheckUtils]: 14: Hoare triple {69#false} call inspect(~data~0.base, ~data~0.offset); {69#false} is VALID [2018-11-14 18:11:03,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {69#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {69#false} is VALID [2018-11-14 18:11:03,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-14 18:11:03,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {69#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {69#false} is VALID [2018-11-14 18:11:03,741 INFO L256 TraceCheckUtils]: 18: Hoare triple {69#false} call fail(); {69#false} is VALID [2018-11-14 18:11:03,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-14 18:11:03,746 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-14 18:11:03,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:03,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:03,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:11:03,758 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:11:03,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:03,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:11:03,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:03,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:11:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:11:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:11:03,948 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-11-14 18:11:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:04,772 INFO L93 Difference]: Finished difference Result 121 states and 180 transitions. [2018-11-14 18:11:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:11:04,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 18:11:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:11:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2018-11-14 18:11:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:11:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2018-11-14 18:11:04,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 180 transitions. [2018-11-14 18:11:05,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:05,608 INFO L225 Difference]: With dead ends: 121 [2018-11-14 18:11:05,608 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:11:05,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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-14 18:11:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:11:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 18:11:05,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:05,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 18:11:05,720 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:11:05,720 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:11:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:05,726 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 18:11:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:11:05,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:05,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:05,727 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:11:05,727 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:11:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:05,732 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 18:11:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:11:05,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:05,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:05,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:05,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:11:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 18:11:05,739 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2018-11-14 18:11:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:05,739 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 18:11:05,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:11:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:11:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:11:05,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:05,741 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] [2018-11-14 18:11:05,741 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:05,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1355550106, now seen corresponding path program 1 times [2018-11-14 18:11:05,742 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:05,742 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-14 18:11:05,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:05,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:06,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-14 18:11:06,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-14 18:11:06,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-14 18:11:06,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #208#return; {419#true} is VALID [2018-11-14 18:11:06,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret24 := main(); {419#true} is VALID [2018-11-14 18:11:06,056 INFO L256 TraceCheckUtils]: 5: Hoare triple {419#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {419#true} is VALID [2018-11-14 18:11:06,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {419#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:06,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume true; {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:06,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:06,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume true; {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:06,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-14 18:11:06,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {458#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:11:06,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {458#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} assume true; {458#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:11:06,063 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {458#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} {419#true} #196#return; {465#(and (= (_ bv0 32) |main_#t~ret23.offset|) (= |main_#t~ret23.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:06,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {465#(and (= (_ bv0 32) |main_#t~ret23.offset|) (= |main_#t~ret23.base| (_ bv0 32)))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {469#(and (= main_~data~0.base (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset))} is VALID [2018-11-14 18:11:06,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {469#(and (= main_~data~0.base (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {420#false} is VALID [2018-11-14 18:11:06,070 INFO L256 TraceCheckUtils]: 16: Hoare triple {420#false} call inspect(~data~0.base, ~data~0.offset); {420#false} is VALID [2018-11-14 18:11:06,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {420#false} is VALID [2018-11-14 18:11:06,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {420#false} assume true; {420#false} is VALID [2018-11-14 18:11:06,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {420#false} is VALID [2018-11-14 18:11:06,071 INFO L256 TraceCheckUtils]: 20: Hoare triple {420#false} call fail(); {420#false} is VALID [2018-11-14 18:11:06,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-14 18:11:06,074 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-14 18:11:06,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:06,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:06,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:11:06,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 18:11:06,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:06,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:11:06,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:06,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:11:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:11:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:11:06,111 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-11-14 18:11:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:07,113 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-11-14 18:11:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:11:07,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-14 18:11:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:11:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2018-11-14 18:11:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:11:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2018-11-14 18:11:07,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 107 transitions. [2018-11-14 18:11:07,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:07,311 INFO L225 Difference]: With dead ends: 92 [2018-11-14 18:11:07,311 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:11:07,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:11:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:11:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-14 18:11:07,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:07,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-14 18:11:07,332 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-14 18:11:07,332 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-14 18:11:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:07,336 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 18:11:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 18:11:07,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:07,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:07,337 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-14 18:11:07,337 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-14 18:11:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:07,341 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 18:11:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 18:11:07,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:07,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:07,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:07,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:11:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 18:11:07,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2018-11-14 18:11:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:07,346 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 18:11:07,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:11:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 18:11:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:11:07,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:07,347 INFO L375 BasicCegarLoop]: trace histogram [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-14 18:11:07,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:07,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -422924592, now seen corresponding path program 1 times [2018-11-14 18:11:07,348 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:07,349 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-14 18:11:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:07,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:07,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-14 18:11:07,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {766#true} is VALID [2018-11-14 18:11:07,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-14 18:11:07,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #208#return; {766#true} is VALID [2018-11-14 18:11:07,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret24 := main(); {766#true} is VALID [2018-11-14 18:11:07,512 INFO L256 TraceCheckUtils]: 5: Hoare triple {766#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {766#true} is VALID [2018-11-14 18:11:07,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {766#true} is VALID [2018-11-14 18:11:07,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-14 18:11:07,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#true} assume !!(#t~nondet7 != 0bv32);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16bv32);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {766#true} is VALID [2018-11-14 18:11:07,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#true} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32); {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} ~value~0 := #t~nondet9;havoc #t~nondet9;call write~intINTTYPE4(~value~0, ~node~0.base, ~bvadd32(12bv32, ~node~0.offset), 4bv32);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume true; {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume true; {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:07,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {798#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {767#false} is VALID [2018-11-14 18:11:07,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {767#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {767#false} is VALID [2018-11-14 18:11:07,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#false} assume true; {767#false} is VALID [2018-11-14 18:11:07,530 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {767#false} {766#true} #196#return; {767#false} is VALID [2018-11-14 18:11:07,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {767#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {767#false} is VALID [2018-11-14 18:11:07,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {767#false} is VALID [2018-11-14 18:11:07,532 INFO L256 TraceCheckUtils]: 22: Hoare triple {767#false} call inspect(~data~0.base, ~data~0.offset); {767#false} is VALID [2018-11-14 18:11:07,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {767#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {767#false} is VALID [2018-11-14 18:11:07,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {767#false} assume true; {767#false} is VALID [2018-11-14 18:11:07,533 INFO L273 TraceCheckUtils]: 25: Hoare triple {767#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {767#false} is VALID [2018-11-14 18:11:07,533 INFO L256 TraceCheckUtils]: 26: Hoare triple {767#false} call fail(); {767#false} is VALID [2018-11-14 18:11:07,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-14 18:11:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:11:07,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:07,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:07,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:11:07,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:11:07,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:07,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:11:07,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:07,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:11:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:11:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:11:07,589 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 3 states. [2018-11-14 18:11:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:08,022 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-14 18:11:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:11:08,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:11:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:11:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 18:11:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:11:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 18:11:08,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-14 18:11:08,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:08,223 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:11:08,223 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:11:08,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:11:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:11:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-14 18:11:08,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:08,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-14 18:11:08,253 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 18:11:08,253 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 18:11:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:08,256 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:11:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:11:08,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:08,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:08,257 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 18:11:08,257 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 18:11:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:08,260 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:11:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:11:08,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:08,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:08,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:08,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 18:11:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-14 18:11:08,265 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2018-11-14 18:11:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:08,266 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-14 18:11:08,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:11:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:11:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:11:08,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:08,267 INFO L375 BasicCegarLoop]: trace histogram [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-14 18:11:08,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:08,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1791366616, now seen corresponding path program 1 times [2018-11-14 18:11:08,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:08,269 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-14 18:11:08,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:08,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:08,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {1111#true} call ULTIMATE.init(); {1111#true} is VALID [2018-11-14 18:11:08,576 INFO L273 TraceCheckUtils]: 1: Hoare triple {1111#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1111#true} is VALID [2018-11-14 18:11:08,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {1111#true} assume true; {1111#true} is VALID [2018-11-14 18:11:08,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1111#true} {1111#true} #208#return; {1111#true} is VALID [2018-11-14 18:11:08,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {1111#true} call #t~ret24 := main(); {1111#true} is VALID [2018-11-14 18:11:08,578 INFO L256 TraceCheckUtils]: 5: Hoare triple {1111#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1111#true} is VALID [2018-11-14 18:11:08,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {1111#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {1111#true} is VALID [2018-11-14 18:11:08,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {1111#true} assume true; {1111#true} is VALID [2018-11-14 18:11:08,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {1111#true} assume !!(#t~nondet7 != 0bv32);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16bv32);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:08,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:08,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32); {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:08,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-14 18:11:08,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {1140#(not (= (_ bv0 32) create_tree_~node~0.base))} ~value~0 := #t~nondet9;havoc #t~nondet9;call write~intINTTYPE4(~value~0, ~node~0.base, ~bvadd32(12bv32, ~node~0.offset), 4bv32);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !!(~node~0.base != 0bv32 || ~node~0.offset != 0bv32);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16bv32);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4bv32); {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem12.base, ~bvadd32(4bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~intINTTYPE4(42bv32, #t~mem13.base, ~bvadd32(12bv32, #t~mem13.offset), 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, ~bvadd32(8bv32, #t~mem14.offset), 4bv32);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1181#(not (= |create_tree_#res.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {1181#(not (= |create_tree_#res.base| (_ bv0 32)))} assume true; {1181#(not (= |create_tree_#res.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,599 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1181#(not (= |create_tree_#res.base| (_ bv0 32)))} {1111#true} #196#return; {1188#(not (= |main_#t~ret23.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {1188#(not (= |main_#t~ret23.base| (_ bv0 32)))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1192#(not (= main_~data~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {1192#(not (= main_~data~0.base (_ bv0 32)))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {1192#(not (= main_~data~0.base (_ bv0 32)))} is VALID [2018-11-14 18:11:08,601 INFO L256 TraceCheckUtils]: 26: Hoare triple {1192#(not (= main_~data~0.base (_ bv0 32)))} call inspect(~data~0.base, ~data~0.offset); {1199#(not (= |inspect_#in~node.base| (_ bv0 32)))} is VALID [2018-11-14 18:11:08,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {1199#(not (= |inspect_#in~node.base| (_ bv0 32)))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1203#(not (= (_ bv0 32) inspect_~node.base))} is VALID [2018-11-14 18:11:08,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {1203#(not (= (_ bv0 32) inspect_~node.base))} assume true; {1203#(not (= (_ bv0 32) inspect_~node.base))} is VALID [2018-11-14 18:11:08,603 INFO L273 TraceCheckUtils]: 29: Hoare triple {1203#(not (= (_ bv0 32) inspect_~node.base))} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {1112#false} is VALID [2018-11-14 18:11:08,603 INFO L256 TraceCheckUtils]: 30: Hoare triple {1112#false} call fail(); {1112#false} is VALID [2018-11-14 18:11:08,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {1112#false} assume !false; {1112#false} is VALID [2018-11-14 18:11:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:11:08,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:11:08,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:11:08,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 18:11:08,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-14 18:11:08,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:11:08,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:11:08,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:08,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:11:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:11:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:11:08,660 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 9 states. [2018-11-14 18:11:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:11,304 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-11-14 18:11:11,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:11:11,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-14 18:11:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:11:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:11:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2018-11-14 18:11:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:11:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2018-11-14 18:11:11,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 113 transitions. [2018-11-14 18:11:11,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:11:11,537 INFO L225 Difference]: With dead ends: 100 [2018-11-14 18:11:11,537 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 18:11:11,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:11:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 18:11:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2018-11-14 18:11:11,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:11:11,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 48 states. [2018-11-14 18:11:11,579 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 48 states. [2018-11-14 18:11:11,579 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 48 states. [2018-11-14 18:11:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:11,583 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 18:11:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 18:11:11,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:11,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:11,584 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 63 states. [2018-11-14 18:11:11,585 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 63 states. [2018-11-14 18:11:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:11:11,589 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 18:11:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 18:11:11,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:11:11,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:11:11,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:11:11,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:11:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:11:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-14 18:11:11,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 32 [2018-11-14 18:11:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:11:11,593 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-14 18:11:11,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:11:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-14 18:11:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:11:11,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:11:11,595 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-11-14 18:11:11,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:11:11,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:11:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash -884955561, now seen corresponding path program 1 times [2018-11-14 18:11:11,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:11:11,596 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-14 18:11:11,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:11:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:11:11,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:11:11,867 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-14 18:11:11,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:11,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:11,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:11:11,893 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:12,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:12,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:12,134 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 11 treesize of output 4 [2018-11-14 18:11:12,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:12,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:11:12,199 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-14 18:11:12,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:12,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:12,258 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:11:12,274 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-14 18:11:12,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:12,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:12,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:12,307 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:25 [2018-11-14 18:11:12,327 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:21,884 WARN L179 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 148 DAG size of output: 49 [2018-11-14 18:11:22,199 INFO L303 Elim1Store]: Index analysis took 297 ms [2018-11-14 18:11:22,201 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 112 treesize of output 76 [2018-11-14 18:11:22,226 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 76 treesize of output 75 [2018-11-14 18:11:22,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:22,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:22,877 INFO L303 Elim1Store]: Index analysis took 169 ms [2018-11-14 18:11:22,879 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 423 treesize of output 311 [2018-11-14 18:11:22,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 18:11:22,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:22,979 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 28 treesize of output 47 [2018-11-14 18:11:22,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:11:23,298 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-11-14 18:11:23,300 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 281 [2018-11-14 18:11:23,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:23,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:23,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:23,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 94 [2018-11-14 18:11:23,335 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,458 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,695 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 128 [2018-11-14 18:11:23,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 18:11:23,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:23,742 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 28 treesize of output 47 [2018-11-14 18:11:23,743 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,763 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:23,987 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 132 treesize of output 116 [2018-11-14 18:11:23,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:24,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:24,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:24,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 94 [2018-11-14 18:11:24,013 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:24,050 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:24,082 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:24,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:24,124 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:1680, output treesize:134 [2018-11-14 18:11:26,133 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:27,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-14 18:11:27,314 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 25 treesize of output 5 [2018-11-14 18:11:27,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,375 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 106 treesize of output 82 [2018-11-14 18:11:27,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:27,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:27,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:11:27,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-11-14 18:11:27,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,503 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 49 treesize of output 34 [2018-11-14 18:11:27,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,581 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-11-14 18:11:27,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-14 18:11:27,591 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-14 18:11:27,609 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:11:27,612 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:5 [2018-11-14 18:11:27,622 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:11:27,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {1536#true} call ULTIMATE.init(); {1536#true} is VALID [2018-11-14 18:11:27,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {1536#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1536#true} is VALID [2018-11-14 18:11:27,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {1536#true} assume true; {1536#true} is VALID [2018-11-14 18:11:27,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1536#true} {1536#true} #208#return; {1536#true} is VALID [2018-11-14 18:11:27,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {1536#true} call #t~ret24 := main(); {1536#true} is VALID [2018-11-14 18:11:27,665 INFO L256 TraceCheckUtils]: 5: Hoare triple {1536#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1536#true} is VALID [2018-11-14 18:11:27,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {1536#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {1536#true} is VALID [2018-11-14 18:11:27,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {1536#true} assume true; {1536#true} is VALID [2018-11-14 18:11:27,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {1536#true} assume !!(#t~nondet7 != 0bv32);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16bv32);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:27,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:27,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32); {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:27,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-14 18:11:27,673 INFO L273 TraceCheckUtils]: 12: Hoare triple {1565#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} ~value~0 := #t~nondet9;havoc #t~nondet9;call write~intINTTYPE4(~value~0, ~node~0.base, ~bvadd32(12bv32, ~node~0.offset), 4bv32);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:27,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume true; {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:27,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume !(#t~nondet7 != 0bv32);havoc #t~nondet7; {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:27,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume true; {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} is VALID [2018-11-14 18:11:27,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {1578#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)) (= create_tree_~nodelast~0.base create_tree_~node~0.base))} assume !!(~node~0.base != 0bv32 || ~node~0.offset != 0bv32);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16bv32);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4bv32); {1591#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {1591#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1591#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {1591#(and (= (_ bv0 32) create_tree_~node~0.offset) (= create_tree_~node~0.offset create_tree_~nodelast~0.offset) (= create_tree_~nodelast~0.base create_tree_~node~0.base) (not (= (select (select |#memory_$Pointer$.base| create_tree_~node~0.base) create_tree_~node~0.offset) create_tree_~node~0.base)) (= (select (select |#memory_$Pointer$.offset| create_tree_~node~0.base) create_tree_~node~0.offset) (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, #t~mem12.base, ~bvadd32(4bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~intINTTYPE4(42bv32, #t~mem13.base, ~bvadd32(12bv32, #t~mem13.offset), 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4bv32);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, ~bvadd32(8bv32, #t~mem14.offset), 4bv32);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, ~bvadd32(4bv32, ~node~0.offset), 4bv32);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1598#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv12 32)))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {1598#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv12 32)))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv0 32)))} assume true; {1598#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv12 32)))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {1598#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv12 32)))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv0 32)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {1598#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv12 32)))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {1598#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv12 32)))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)))) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) (_ bv0 32)) (_ bv0 32)))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1608#(and (= (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv0 32)) (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)))) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32)))) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:11:27,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {1608#(and (= (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv0 32)) (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)))) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32)))) (= |create_tree_#res.offset| (_ bv0 32)))} assume true; {1608#(and (= (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv0 32)) (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)))) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32)))) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:11:27,713 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1608#(and (= (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv0 32)) (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) (_ bv0 32)))) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) (_ bv0 32)))) (= |create_tree_#res.offset| (_ bv0 32)))} {1536#true} #196#return; {1615#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32)))) (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) |main_#t~ret23.offset|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv0 32)) (not (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32)))))} is VALID [2018-11-14 18:11:27,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {1615#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv4 32)))) (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) |main_#t~ret23.offset|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret23.base|) (_ bv0 32)) (_ bv0 32)) (not (= |main_#t~ret23.base| (select (select |#memory_$Pointer$.base| |main_#t~ret23.base|) (_ bv0 32)))))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1619#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} is VALID [2018-11-14 18:11:27,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {1619#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {1619#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} is VALID [2018-11-14 18:11:27,725 INFO L256 TraceCheckUtils]: 26: Hoare triple {1619#(and (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv12 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~data~0.base) (_ bv0 32)) (_ bv8 32)))))} call inspect(~data~0.base, ~data~0.offset); {1626#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv0 32)) (not (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)))))} is VALID [2018-11-14 18:11:27,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {1626#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv0 32)) (not (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= |inspect_#in~node.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~node.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |inspect_#in~node.base|) (_ bv0 32)))))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true; {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume !(~node.base == 0bv32 && ~node.offset == 0bv32); {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true; {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true; {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume !!(~node.base != 0bv32 || ~node.offset != 0bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4bv32); {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume #t~mem2.base != 0bv32 || #t~mem2.offset != 0bv32;havoc #t~mem2.base, #t~mem2.offset; {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-14 18:11:27,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {1630#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) inspect_~node.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) inspect_~node.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv8 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32)) inspect_~node.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~node.base) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| inspect_~node.base) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))} assume true;call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(#t~mem3.base, ~bvadd32(12bv32, #t~mem3.offset), 4bv32); {1652#(= (_ bv42 32) |inspect_#t~mem4|)} is VALID [2018-11-14 18:11:27,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {1652#(= (_ bv42 32) |inspect_#t~mem4|)} assume !(#t~mem4 == 42bv32);havoc #t~mem4;havoc #t~mem3.base, #t~mem3.offset; {1537#false} is VALID [2018-11-14 18:11:27,744 INFO L256 TraceCheckUtils]: 36: Hoare triple {1537#false} call fail(); {1537#false} is VALID [2018-11-14 18:11:27,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {1537#false} assume !false; {1537#false} is VALID [2018-11-14 18:11:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:11:27,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:11:44,286 WARN L179 SmtUtils]: Spent 13.88 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-14 18:11:59,904 WARN L179 SmtUtils]: Spent 15.58 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-14 18:12:09,763 WARN L179 SmtUtils]: Spent 9.85 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-14 18:12:19,977 WARN L179 SmtUtils]: Spent 10.21 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-14 18:12:23,187 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-14 18:12:25,486 WARN L179 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-14 18:12:25,502 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 1281 treesize of output 643 [2018-11-14 18:12:25,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 643 treesize of output 3 [2018-11-14 18:12:25,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:25,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:25,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:12:25,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:1671, output treesize:1531 [2018-11-14 18:12:26,091 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:12:27,305 INFO L303 Elim1Store]: Index analysis took 208 ms [2018-11-14 18:12:27,306 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 892 treesize of output 773 [2018-11-14 18:12:30,182 WARN L179 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2018-11-14 18:12:30,202 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-14 18:12:30,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:30,463 INFO L303 Elim1Store]: Index analysis took 183 ms [2018-11-14 18:12:30,632 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 682 treesize of output 692 [2018-11-14 18:12:39,374 WARN L179 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-14 18:12:39,403 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 613 treesize of output 614 [2018-11-14 18:12:39,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:40,192 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 614 treesize of output 613 [2018-11-14 18:12:40,212 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:41,146 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 613 treesize of output 613 [2018-11-14 18:12:41,212 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 604 treesize of output 587 [2018-11-14 18:12:41,219 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:41,286 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:41,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:12:41,493 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-14 18:12:44,222 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 594 treesize of output 283 [2018-11-14 18:12:44,517 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-14 18:12:44,542 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-14 18:12:44,544 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 18:12:44,875 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-14 18:12:44,978 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 343 treesize of output 189