java -ea -Xmx16000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c6a52e0 [2018-11-19 15:22:22,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 15:22:22,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 15:22:22,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 15:22:22,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 15:22:22,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 15:22:22,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 15:22:22,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 15:22:22,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 15:22:22,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 15:22:22,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 15:22:22,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 15:22:22,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 15:22:22,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 15:22:22,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 15:22:22,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 15:22:22,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 15:22:22,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 15:22:22,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 15:22:22,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 15:22:22,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 15:22:22,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 15:22:22,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 15:22:22,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 15:22:22,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 15:22:22,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 15:22:22,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 15:22:22,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 15:22:22,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 15:22:22,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 15:22:22,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 15:22:22,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 15:22:22,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 15:22:22,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 15:22:22,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 15:22:22,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 15:22:22,101 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-19 15:22:22,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 15:22:22,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 15:22:22,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 15:22:22,116 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-19 15:22:22,116 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 15:22:22,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 15:22:22,117 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 15:22:22,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 15:22:22,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 15:22:22,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 15:22:22,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 15:22:22,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 15:22:22,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 15:22:22,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 15:22:22,118 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-19 15:22:22,118 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-19 15:22:22,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 15:22:22,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 15:22:22,119 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 15:22:22,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 15:22:22,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 15:22:22,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 15:22:22,119 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 15:22:22,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 15:22:22,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 15:22:22,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 15:22:22,120 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 15:22:22,120 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 15:22:22,120 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-19 15:22:22,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 15:22:22,121 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-19 15:22:22,121 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-19 15:22:22,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 15:22:22,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 15:22:22,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 15:22:22,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 15:22:22,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 15:22:22,179 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 15:22:22,180 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-19 15:22:22,233 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f59d3d2a/bc4df43092004d67858380331495a778/FLAGebecc784f [2018-11-19 15:22:22,683 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 15:22:22,684 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-19 15:22:22,698 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f59d3d2a/bc4df43092004d67858380331495a778/FLAGebecc784f [2018-11-19 15:22:23,204 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f59d3d2a/bc4df43092004d67858380331495a778 [2018-11-19 15:22:23,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 15:22:23,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 15:22:23,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 15:22:23,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 15:22:23,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 15:22:23,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29701b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23, skipping insertion in model container [2018-11-19 15:22:23,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 15:22:23,270 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 15:22:23,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:23,592 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 15:22:23,704 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:23,759 INFO L195 MainTranslator]: Completed translation [2018-11-19 15:22:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23 WrapperNode [2018-11-19 15:22:23,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 15:22:23,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 15:22:23,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 15:22:23,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 15:22:23,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (1/1) ... [2018-11-19 15:22:23,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 15:22:23,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 15:22:23,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 15:22:23,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 15:22:23,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (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-19 15:22:23,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 15:22:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 15:22:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-19 15:22:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-19 15:22:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-19 15:22:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-19 15:22:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-19 15:22:23,886 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-19 15:22:23,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 15:22:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 15:22:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-19 15:22:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-19 15:22:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-19 15:22:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-19 15:22:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-19 15:22:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-19 15:22:23,887 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-19 15:22:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-19 15:22:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-19 15:22:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-19 15:22:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-19 15:22:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-19 15:22:23,888 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-19 15:22:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-19 15:22:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-19 15:22:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-19 15:22:23,892 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-19 15:22:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-19 15:22:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-19 15:22:23,895 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-19 15:22:23,895 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-19 15:22:23,895 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-19 15:22:23,895 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-19 15:22:23,895 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-19 15:22:23,895 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-19 15:22:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-19 15:22:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-19 15:22:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-19 15:22:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-19 15:22:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-19 15:22:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-19 15:22:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-19 15:22:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-19 15:22:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-19 15:22:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-19 15:22:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-19 15:22:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-19 15:22:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-19 15:22:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 15:22:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-19 15:22:23,901 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-19 15:22:23,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-19 15:22:23,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 15:22:23,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 15:22:23,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 15:22:23,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-19 15:22:24,667 INFO L271 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 15:22:24,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:24 BoogieIcfgContainer [2018-11-19 15:22:24,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 15:22:24,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 15:22:24,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 15:22:24,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 15:22:24,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:22:23" (1/3) ... [2018-11-19 15:22:24,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa525a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:22:24, skipping insertion in model container [2018-11-19 15:22:24,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:23" (2/3) ... [2018-11-19 15:22:24,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa525a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:22:24, skipping insertion in model container [2018-11-19 15:22:24,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:24" (3/3) ... [2018-11-19 15:22:24,677 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-11-19 15:22:24,688 INFO L147 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 15:22:24,697 INFO L159 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 15:22:24,717 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 15:22:24,752 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 15:22:24,753 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 15:22:24,754 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 15:22:24,754 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 15:22:24,754 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 15:22:24,755 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 15:22:24,755 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 15:22:24,755 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 15:22:24,755 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 15:22:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-19 15:22:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-19 15:22:24,784 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:24,785 INFO L384 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-19 15:22:24,787 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:24,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -617820337, now seen corresponding path program 1 times [2018-11-19 15:22:24,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:24,800 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-19 15:22:24,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:24,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:24,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-19 15:22:24,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {68#true} is VALID [2018-11-19 15:22:24,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-19 15:22:24,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #208#return; {68#true} is VALID [2018-11-19 15:22:24,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret24 := main(); {68#true} is VALID [2018-11-19 15:22:24,956 INFO L256 TraceCheckUtils]: 5: Hoare triple {68#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {68#true} is VALID [2018-11-19 15:22:24,956 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-19 15:22:24,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} assume !true; {69#false} is VALID [2018-11-19 15:22:24,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-19 15:22:24,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {69#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {69#false} is VALID [2018-11-19 15:22:24,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-19 15:22:24,960 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {69#false} {68#true} #196#return; {69#false} is VALID [2018-11-19 15:22:24,960 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-19 15:22:24,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {69#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {69#false} is VALID [2018-11-19 15:22:24,961 INFO L256 TraceCheckUtils]: 14: Hoare triple {69#false} call inspect(~data~0.base, ~data~0.offset); {69#false} is VALID [2018-11-19 15:22:24,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {69#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {69#false} is VALID [2018-11-19 15:22:24,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-19 15:22:24,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {69#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {69#false} is VALID [2018-11-19 15:22:24,962 INFO L256 TraceCheckUtils]: 18: Hoare triple {69#false} call fail(); {69#false} is VALID [2018-11-19 15:22:24,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-19 15:22:24,968 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-19 15:22:24,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:24,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:24,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 15:22:24,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-19 15:22:24,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:24,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-19 15:22:25,028 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-19 15:22:25,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-19 15:22:25,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 15:22:25,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 15:22:25,042 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-11-19 15:22:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:25,310 INFO L93 Difference]: Finished difference Result 121 states and 180 transitions. [2018-11-19 15:22:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 15:22:25,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-19 15:22:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 15:22:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2018-11-19 15:22:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 15:22:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2018-11-19 15:22:25,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 180 transitions. [2018-11-19 15:22:25,615 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-19 15:22:25,630 INFO L225 Difference]: With dead ends: 121 [2018-11-19 15:22:25,630 INFO L226 Difference]: Without dead ends: 42 [2018-11-19 15:22:25,635 INFO L613 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-19 15:22:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-19 15:22:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-19 15:22:25,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-19 15:22:25,695 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-19 15:22:25,696 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-19 15:22:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:25,701 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-19 15:22:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-19 15:22:25,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:25,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:25,702 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-19 15:22:25,703 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-19 15:22:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:25,707 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-19 15:22:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-19 15:22:25,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:25,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:25,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:25,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-19 15:22:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-19 15:22:25,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2018-11-19 15:22:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:25,714 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-19 15:22:25,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 15:22:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-19 15:22:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-19 15:22:25,715 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:25,715 INFO L384 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-19 15:22:25,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:25,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1355550106, now seen corresponding path program 1 times [2018-11-19 15:22:25,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:25,717 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-19 15:22:25,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:25,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:25,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-19 15:22:25,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-19 15:22:25,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-19 15:22:25,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #208#return; {419#true} is VALID [2018-11-19 15:22:25,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret24 := main(); {419#true} is VALID [2018-11-19 15:22:25,932 INFO L256 TraceCheckUtils]: 5: Hoare triple {419#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {419#true} is VALID [2018-11-19 15:22:25,933 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-19 15:22:25,935 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-19 15:22:25,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(0bv32 != #t~nondet7);havoc #t~nondet7; {442#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:25,937 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-19 15:22:25,937 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-19 15:22:25,938 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-19 15:22:25,938 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-19 15:22:25,940 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-19 15:22:25,941 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-19 15:22:25,944 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-19 15:22:25,945 INFO L256 TraceCheckUtils]: 16: Hoare triple {420#false} call inspect(~data~0.base, ~data~0.offset); {420#false} is VALID [2018-11-19 15:22:25,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {420#false} is VALID [2018-11-19 15:22:25,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {420#false} assume true; {420#false} is VALID [2018-11-19 15:22:25,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {420#false} is VALID [2018-11-19 15:22:25,946 INFO L256 TraceCheckUtils]: 20: Hoare triple {420#false} call fail(); {420#false} is VALID [2018-11-19 15:22:25,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-19 15:22:25,949 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-19 15:22:25,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:25,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 15:22:25,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-19 15:22:25,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:25,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 15:22:25,992 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-19 15:22:25,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 15:22:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 15:22:25,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 15:22:25,993 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-11-19 15:22:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:26,801 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-11-19 15:22:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 15:22:26,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-19 15:22:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2018-11-19 15:22:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2018-11-19 15:22:26,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 107 transitions. [2018-11-19 15:22:26,953 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-19 15:22:26,955 INFO L225 Difference]: With dead ends: 92 [2018-11-19 15:22:26,955 INFO L226 Difference]: Without dead ends: 48 [2018-11-19 15:22:26,956 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-19 15:22:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-19 15:22:26,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:26,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-19 15:22:26,968 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-19 15:22:26,968 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-19 15:22:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:26,971 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-19 15:22:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-19 15:22:26,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:26,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:26,973 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-19 15:22:26,973 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-19 15:22:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:26,976 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-19 15:22:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-19 15:22:26,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:26,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:26,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:26,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-19 15:22:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-19 15:22:26,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2018-11-19 15:22:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:26,981 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-19 15:22:26,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 15:22:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-19 15:22:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-19 15:22:26,982 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:26,982 INFO L384 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-19 15:22:26,982 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:26,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:26,983 INFO L82 PathProgramCache]: Analyzing trace with hash -422924592, now seen corresponding path program 1 times [2018-11-19 15:22:26,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:26,983 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-19 15:22:27,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:27,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:27,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-19 15:22:27,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {766#true} is VALID [2018-11-19 15:22:27,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-19 15:22:27,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #208#return; {766#true} is VALID [2018-11-19 15:22:27,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret24 := main(); {766#true} is VALID [2018-11-19 15:22:27,092 INFO L256 TraceCheckUtils]: 5: Hoare triple {766#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {766#true} is VALID [2018-11-19 15:22:27,092 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-19 15:22:27,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-19 15:22:27,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {766#true} assume !!(0bv32 != #t~nondet7);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-19 15:22:27,094 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-19 15:22:27,096 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-19 15:22:27,096 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-19 15:22:27,097 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-19 15:22:27,097 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-19 15:22:27,098 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 !(0bv32 != #t~nondet7);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-19 15:22:27,098 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-19 15:22:27,099 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-19 15:22:27,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {767#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {767#false} is VALID [2018-11-19 15:22:27,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#false} assume true; {767#false} is VALID [2018-11-19 15:22:27,100 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {767#false} {766#true} #196#return; {767#false} is VALID [2018-11-19 15:22:27,100 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-19 15:22:27,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {767#false} is VALID [2018-11-19 15:22:27,101 INFO L256 TraceCheckUtils]: 22: Hoare triple {767#false} call inspect(~data~0.base, ~data~0.offset); {767#false} is VALID [2018-11-19 15:22:27,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {767#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {767#false} is VALID [2018-11-19 15:22:27,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {767#false} assume true; {767#false} is VALID [2018-11-19 15:22:27,102 INFO L273 TraceCheckUtils]: 25: Hoare triple {767#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {767#false} is VALID [2018-11-19 15:22:27,102 INFO L256 TraceCheckUtils]: 26: Hoare triple {767#false} call fail(); {767#false} is VALID [2018-11-19 15:22:27,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-19 15:22:27,104 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-19 15:22:27,104 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:27,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:27,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-19 15:22:27,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-19 15:22:27,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:27,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 15:22:27,138 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-19 15:22:27,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 15:22:27,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 15:22:27,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:27,139 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 3 states. [2018-11-19 15:22:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:27,551 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-19 15:22:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:27,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-19 15:22:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-19 15:22:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-19 15:22:27,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-19 15:22:27,650 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-19 15:22:27,653 INFO L225 Difference]: With dead ends: 74 [2018-11-19 15:22:27,654 INFO L226 Difference]: Without dead ends: 49 [2018-11-19 15:22:27,654 INFO L613 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-19 15:22:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-19 15:22:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-19 15:22:27,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:27,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-19 15:22:27,682 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-19 15:22:27,683 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-19 15:22:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:27,685 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-19 15:22:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-19 15:22:27,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:27,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:27,686 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-19 15:22:27,687 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-19 15:22:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:27,689 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-19 15:22:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-19 15:22:27,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:27,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:27,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:27,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-19 15:22:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-19 15:22:27,693 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2018-11-19 15:22:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:27,693 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-19 15:22:27,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 15:22:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-19 15:22:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-19 15:22:27,695 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:27,695 INFO L384 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-19 15:22:27,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:27,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1791366616, now seen corresponding path program 1 times [2018-11-19 15:22:27,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:27,696 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-19 15:22:27,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:27,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:27,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {1111#true} call ULTIMATE.init(); {1111#true} is VALID [2018-11-19 15:22:27,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {1111#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1111#true} is VALID [2018-11-19 15:22:27,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {1111#true} assume true; {1111#true} is VALID [2018-11-19 15:22:27,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1111#true} {1111#true} #208#return; {1111#true} is VALID [2018-11-19 15:22:27,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {1111#true} call #t~ret24 := main(); {1111#true} is VALID [2018-11-19 15:22:27,907 INFO L256 TraceCheckUtils]: 5: Hoare triple {1111#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1111#true} is VALID [2018-11-19 15:22:27,907 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-19 15:22:27,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {1111#true} assume true; {1111#true} is VALID [2018-11-19 15:22:27,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {1111#true} assume !!(0bv32 != #t~nondet7);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-19 15:22:27,909 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-19 15:22:27,909 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-19 15:22:27,910 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-19 15:22:27,911 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-19 15:22:27,911 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-19 15:22:27,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet7);havoc #t~nondet7; {1153#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:27,913 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-19 15:22:27,913 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-19 15:22:27,914 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-19 15:22:27,915 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-19 15:22:27,916 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-19 15:22:27,917 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-19 15:22:27,917 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-19 15:22:27,918 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-19 15:22:27,919 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-19 15:22:27,919 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-19 15:22:27,920 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-19 15:22:27,921 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-19 15:22:27,922 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-19 15:22:27,922 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-19 15:22:27,923 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-19 15:22:27,923 INFO L256 TraceCheckUtils]: 30: Hoare triple {1112#false} call fail(); {1112#false} is VALID [2018-11-19 15:22:27,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {1112#false} assume !false; {1112#false} is VALID [2018-11-19 15:22:27,927 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-19 15:22:27,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:27,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-19 15:22:27,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-19 15:22:27,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:27,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 15:22:27,981 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-19 15:22:27,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 15:22:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 15:22:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-19 15:22:27,983 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 9 states. [2018-11-19 15:22:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:30,571 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-11-19 15:22:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-19 15:22:30,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-19 15:22:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 15:22:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2018-11-19 15:22:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 15:22:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2018-11-19 15:22:30,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 113 transitions. [2018-11-19 15:22:30,705 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-19 15:22:30,708 INFO L225 Difference]: With dead ends: 100 [2018-11-19 15:22:30,708 INFO L226 Difference]: Without dead ends: 63 [2018-11-19 15:22:30,709 INFO L613 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-19 15:22:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-19 15:22:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2018-11-19 15:22:30,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:30,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 48 states. [2018-11-19 15:22:30,729 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 48 states. [2018-11-19 15:22:30,729 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 48 states. [2018-11-19 15:22:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:30,733 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-19 15:22:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-19 15:22:30,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:30,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:30,735 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 63 states. [2018-11-19 15:22:30,735 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 63 states. [2018-11-19 15:22:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:30,737 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-19 15:22:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-19 15:22:30,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:30,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:30,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:30,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-19 15:22:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-19 15:22:30,741 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 32 [2018-11-19 15:22:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:30,741 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-19 15:22:30,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 15:22:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-19 15:22:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-19 15:22:30,743 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:30,743 INFO L384 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-19 15:22:30,743 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:30,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:30,744 INFO L82 PathProgramCache]: Analyzing trace with hash -884955561, now seen corresponding path program 1 times [2018-11-19 15:22:30,744 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:30,744 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-19 15:22:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:30,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:30,920 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-19 15:22:30,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:30,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:30,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-19 15:22:30,943 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:31,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:31,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:31,037 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-19 15:22:31,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:31,084 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-19 15:22:31,092 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-19 15:22:31,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:31,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:31,137 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-19 15:22:31,145 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-19 15:22:31,146 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:31,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:31,179 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-19 15:22:31,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:25 [2018-11-19 15:22:31,198 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:41,849 WARN L180 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 148 DAG size of output: 49 [2018-11-19 15:22:42,119 INFO L303 Elim1Store]: Index analysis took 267 ms [2018-11-19 15:22:42,121 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-19 15:22:42,169 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-19 15:22:42,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:42,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:42,853 INFO L303 Elim1Store]: Index analysis took 186 ms [2018-11-19 15:22:42,856 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-19 15:22:42,878 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-19 15:22:42,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:42,913 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-19 15:22:42,915 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:22:43,358 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-11-19 15:22:43,361 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-19 15:22:43,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,402 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-19 15:22:43,405 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,621 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-19 15:22:43,805 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-19 15:22:43,816 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-19 15:22:43,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,831 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-19 15:22:43,832 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,930 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-19 15:22:43,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:43,949 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-19 15:22:43,952 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:43,992 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:44,019 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-19 15:22:44,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:44,054 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:1680, output treesize:134 [2018-11-19 15:22:46,065 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:46,900 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-19 15:22:46,909 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-19 15:22:46,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:46,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:46,960 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-19 15:22:46,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:46,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:46,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:46,977 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-19 15:22:46,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,010 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-19 15:22:47,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,050 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-19 15:22:47,057 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-19 15:22:47,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,077 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-19 15:22:47,079 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,081 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,083 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-19 15:22:47,083 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:5 [2018-11-19 15:22:47,094 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:47,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {1536#true} call ULTIMATE.init(); {1536#true} is VALID [2018-11-19 15:22:47,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {1536#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1536#true} is VALID [2018-11-19 15:22:47,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {1536#true} assume true; {1536#true} is VALID [2018-11-19 15:22:47,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1536#true} {1536#true} #208#return; {1536#true} is VALID [2018-11-19 15:22:47,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {1536#true} call #t~ret24 := main(); {1536#true} is VALID [2018-11-19 15:22:47,145 INFO L256 TraceCheckUtils]: 5: Hoare triple {1536#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1536#true} is VALID [2018-11-19 15:22:47,145 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-19 15:22:47,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {1536#true} assume true; {1536#true} is VALID [2018-11-19 15:22:47,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {1536#true} assume !!(0bv32 != #t~nondet7);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-19 15:22:47,149 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-19 15:22:47,149 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-19 15:22:47,150 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-19 15:22:47,151 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-19 15:22:47,151 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-19 15:22:47,152 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 !(0bv32 != #t~nondet7);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-19 15:22:47,152 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-19 15:22:47,155 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-19 15:22:47,156 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-19 15:22:47,166 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-19 15:22:47,168 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-19 15:22:47,170 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-19 15:22:47,172 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-19 15:22:47,174 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-19 15:22:47,177 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-19 15:22:47,183 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-19 15:22:47,185 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-19 15:22:47,191 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-19 15:22:47,194 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-19 15:22:47,196 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-19 15:22:47,198 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-19 15:22:47,199 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-19 15:22:47,201 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-19 15:22:47,204 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-19 15:22:47,206 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-19 15:22:47,208 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-19 15:22:47,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {1652#(= (_ bv42 32) |inspect_#t~mem4|)} assume !(42bv32 == #t~mem4);havoc #t~mem4;havoc #t~mem3.base, #t~mem3.offset; {1537#false} is VALID [2018-11-19 15:22:47,209 INFO L256 TraceCheckUtils]: 36: Hoare triple {1537#false} call fail(); {1537#false} is VALID [2018-11-19 15:22:47,209 INFO L273 TraceCheckUtils]: 37: Hoare triple {1537#false} assume !false; {1537#false} is VALID [2018-11-19 15:22:47,222 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-19 15:22:47,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-19 15:23:02,878 WARN L180 SmtUtils]: Spent 14.10 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-19 15:23:14,500 WARN L180 SmtUtils]: Spent 11.62 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-19 15:23:23,037 WARN L180 SmtUtils]: Spent 8.53 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-19 15:23:34,160 WARN L180 SmtUtils]: Spent 11.12 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-19 15:23:38,106 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-19 15:23:40,749 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-19 15:23:40,815 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-19 15:23:40,840 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-19 15:23:40,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:40,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:23:41,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:23:41,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:1671, output treesize:1531 [2018-11-19 15:23:41,230 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:23:42,123 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-19 15:23:42,224 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-19 15:23:47,132 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-11-19 15:23:47,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 9 treesize of output 8 [2018-11-19 15:23:47,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:47,622 INFO L303 Elim1Store]: Index analysis took 246 ms [2018-11-19 15:23:47,862 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 718 treesize of output 716 [2018-11-19 15:23:56,525 WARN L180 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-19 15:23:56,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 644 treesize of output 643 [2018-11-19 15:23:56,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:57,924 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 627 treesize of output 608 [2018-11-19 15:23:57,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:59,164 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 643 treesize of output 633 [2018-11-19 15:23:59,182 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 621 treesize of output 591 [2018-11-19 15:23:59,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:59,742 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 624 treesize of output 587 [2018-11-19 15:23:59,745 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:59,789 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:23:59,920 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-19 15:23:59,973 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-19 15:24:01,234 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-19 15:24:01,504 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-19 15:24:01,528 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-19 15:24:01,530 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:01,868 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-19 15:24:01,950 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 [2018-11-19 15:24:04,780 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2018-11-19 15:24:04,801 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 77 treesize of output 76 [2018-11-19 15:24:04,804 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:04,816 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 97 treesize of output 96 [2018-11-19 15:24:04,820 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:04,830 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 97 treesize of output 96 [2018-11-19 15:24:04,833 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:04,850 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 112 treesize of output 111 [2018-11-19 15:24:04,855 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:07,893 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 2 case distinctions, treesize of input 117 treesize of output 115 [2018-11-19 15:24:07,899 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-19 15:24:07,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:07,924 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 106 treesize of output 118 [2018-11-19 15:24:07,927 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:10,332 INFO L303 Elim1Store]: Index analysis took 164 ms [2018-11-19 15:24:10,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 122 treesize of output 101 [2018-11-19 15:24:10,865 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-19 15:24:10,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:10,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 80 [2018-11-19 15:24:10,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:11,003 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 89 [2018-11-19 15:24:11,012 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:11,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-19 15:24:11,303 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:11,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:11,535 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 79 [2018-11-19 15:24:11,545 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:11,762 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:11,809 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 86 [2018-11-19 15:24:11,821 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:11,979 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-19 15:24:11,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:11,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:12,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 77 [2018-11-19 15:24:12,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:12,109 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 86 [2018-11-19 15:24:12,123 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:12,346 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 62 treesize of output 60 [2018-11-19 15:24:12,349 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:12,466 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:12,498 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 76 [2018-11-19 15:24:12,512 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:12,624 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:12,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:12,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-11-19 15:24:12,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:12,700 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 76 [2018-11-19 15:24:12,714 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:12,793 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:13,264 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2018-11-19 15:24:13,512 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-11-19 15:24:13,520 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:13,542 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2018-11-19 15:24:13,546 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-19 15:24:13,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:13,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-19 15:24:13,628 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:13,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-19 15:24:13,682 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:13,728 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:13,735 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:13,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2018-11-19 15:24:13,954 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-19 15:24:13,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:13,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-19 15:24:13,964 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:13,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:13,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-19 15:24:13,973 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,098 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 39 treesize of output 37 [2018-11-19 15:24:14,101 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,105 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 40 treesize of output 38 [2018-11-19 15:24:14,107 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,202 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 24 treesize of output 22 [2018-11-19 15:24:14,204 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-19 15:24:14,213 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,266 INFO L267 ElimStorePlain]: Start of recursive call 35: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:14,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-19 15:24:14,346 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:14,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-19 15:24:14,348 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,369 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 5 treesize of output 3 [2018-11-19 15:24:14,370 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,383 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:14,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-11-19 15:24:14,471 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:14,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-19 15:24:14,474 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,495 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 5 treesize of output 3 [2018-11-19 15:24:14,496 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,508 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,714 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 61 treesize of output 65 [2018-11-19 15:24:14,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-11-19 15:24:14,725 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,800 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:14,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:14,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-19 15:24:14,818 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 5 treesize of output 3 [2018-11-19 15:24:14,820 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,841 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:14,969 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 53 treesize of output 49 [2018-11-19 15:24:15,204 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-19 15:24:15,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:15,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-11-19 15:24:15,226 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:15,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:15,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-11-19 15:24:15,323 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:15,362 INFO L267 ElimStorePlain]: Start of recursive call 52: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:15,372 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 43 treesize of output 33 [2018-11-19 15:24:15,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:15,385 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 26 treesize of output 13 [2018-11-19 15:24:15,387 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:15,411 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 5 treesize of output 3 [2018-11-19 15:24:15,415 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:15,425 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:15,468 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:15,736 INFO L303 Elim1Store]: Index analysis took 260 ms [2018-11-19 15:24:15,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 128 [2018-11-19 15:24:15,924 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-19 15:24:30,791 WARN L180 SmtUtils]: Spent 14.60 s on a formula simplification. DAG size of input: 623 DAG size of output: 493 [2018-11-19 15:24:30,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:24:30,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2018-11-19 15:24:30,827 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:42,882 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 72 treesize of output 80 [2018-11-19 15:24:42,891 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 69 treesize of output 67 [2018-11-19 15:24:42,898 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:42,982 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:55,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:24:55,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 53 [2018-11-19 15:24:55,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:55,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:55,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:24:55,419 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-19 15:24:55,420 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_61 term size 36 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-19 15:24:55,424 INFO L168 Benchmark]: Toolchain (without parser) took 152210.88 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 921.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -876.4 MB). Peak memory consumption was 720.8 MB. Max. memory is 14.2 GB. [2018-11-19 15:24:55,425 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 14.2 GB. [2018-11-19 15:24:55,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 14.2 GB. [2018-11-19 15:24:55,426 INFO L168 Benchmark]: Boogie Preprocessor took 76.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 14.2 GB. [2018-11-19 15:24:55,426 INFO L168 Benchmark]: RCFGBuilder took 830.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 14.2 GB. [2018-11-19 15:24:55,426 INFO L168 Benchmark]: TraceAbstraction took 150754.81 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 192.9 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -191.4 MB). Peak memory consumption was 677.0 MB. Max. memory is 14.2 GB. [2018-11-19 15:24:55,428 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 545.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 76.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 14.2 GB. * RCFGBuilder took 830.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 150754.81 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 192.9 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -191.4 MB). Peak memory consumption was 677.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_61 term size 36 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_61 term size 36: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...