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-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c6a52e0 [2018-11-19 15:22:23,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 15:22:23,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 15:22:23,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 15:22:23,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 15:22:23,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 15:22:23,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 15:22:23,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 15:22:23,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 15:22:23,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 15:22:23,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 15:22:23,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 15:22:23,558 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 15:22:23,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 15:22:23,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 15:22:23,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 15:22:23,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 15:22:23,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 15:22:23,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 15:22:23,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 15:22:23,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 15:22:23,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 15:22:23,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 15:22:23,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 15:22:23,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 15:22:23,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 15:22:23,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 15:22:23,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 15:22:23,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 15:22:23,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 15:22:23,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 15:22:23,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 15:22:23,577 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 15:22:23,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 15:22:23,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 15:22:23,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 15:22:23,579 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:23,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 15:22:23,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 15:22:23,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 15:22:23,594 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-19 15:22:23,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 15:22:23,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 15:22:23,595 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 15:22:23,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 15:22:23,596 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 15:22:23,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 15:22:23,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 15:22:23,596 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 15:22:23,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 15:22:23,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 15:22:23,597 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-19 15:22:23,597 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-19 15:22:23,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 15:22:23,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 15:22:23,597 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 15:22:23,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 15:22:23,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 15:22:23,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 15:22:23,598 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 15:22:23,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 15:22:23,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 15:22:23,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 15:22:23,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 15:22:23,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 15:22:23,599 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-19 15:22:23,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 15:22:23,599 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-19 15:22:23,599 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-19 15:22:23,600 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 15:22:23,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 15:22:23,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 15:22:23,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 15:22:23,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 15:22:23,661 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 15:22:23,662 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-memcleanup.i [2018-11-19 15:22:23,726 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb311108/40e6743369a54fa28c1ba920a8c0108f/FLAGf9c7269bc [2018-11-19 15:22:24,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 15:22:24,110 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-19 15:22:24,121 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb311108/40e6743369a54fa28c1ba920a8c0108f/FLAGf9c7269bc [2018-11-19 15:22:24,468 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb311108/40e6743369a54fa28c1ba920a8c0108f [2018-11-19 15:22:24,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 15:22:24,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 15:22:24,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 15:22:24,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 15:22:24,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 15:22:24,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:22:24" (1/1) ... [2018-11-19 15:22:24,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5954017e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:24, skipping insertion in model container [2018-11-19 15:22:24,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:22:24" (1/1) ... [2018-11-19 15:22:24,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 15:22:24,537 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 15:22:24,853 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:24,868 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 15:22:24,977 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 15:22:25,030 INFO L195 MainTranslator]: Completed translation [2018-11-19 15:22:25,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:25 WrapperNode [2018-11-19 15:22:25,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 15:22:25,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 15:22:25,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 15:22:25,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 15:22:25,043 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:25" (1/1) ... [2018-11-19 15:22:25,044 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:25" (1/1) ... [2018-11-19 15:22:25,060 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:25" (1/1) ... [2018-11-19 15:22:25,060 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:25" (1/1) ... [2018-11-19 15:22:25,089 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:25" (1/1) ... [2018-11-19 15:22:25,097 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:25" (1/1) ... [2018-11-19 15:22:25,102 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:25" (1/1) ... [2018-11-19 15:22:25,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 15:22:25,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 15:22:25,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 15:22:25,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 15:22:25,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:25" (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:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 15:22:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 15:22:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-19 15:22:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-19 15:22:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-19 15:22:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-19 15:22:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-19 15:22:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-19 15:22:25,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 15:22:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 15:22:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-19 15:22:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-19 15:22:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-19 15:22:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-19 15:22:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-19 15:22:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-19 15:22:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-19 15:22:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-19 15:22:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-19 15:22:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-19 15:22:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-19 15:22:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-19 15:22:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-19 15:22:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-19 15:22:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-19 15:22:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-19 15:22:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-19 15:22:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-19 15:22:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-19 15:22:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-19 15:22:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-19 15:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-19 15:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-19 15:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-19 15:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-19 15:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-19 15:22:25,170 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-19 15:22:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-19 15:22:25,172 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-19 15:22:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-19 15:22:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-19 15:22:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-19 15:22:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-19 15:22:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 15:22:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 15:22:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 15:22:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-19 15:22:25,904 INFO L271 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 15:22:25,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:25 BoogieIcfgContainer [2018-11-19 15:22:25,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 15:22:25,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 15:22:25,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 15:22:25,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 15:22:25,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 03:22:24" (1/3) ... [2018-11-19 15:22:25,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c9e5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:22:25, skipping insertion in model container [2018-11-19 15:22:25,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:22:25" (2/3) ... [2018-11-19 15:22:25,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c9e5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 03:22:25, skipping insertion in model container [2018-11-19 15:22:25,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:22:25" (3/3) ... [2018-11-19 15:22:25,911 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2018-11-19 15:22:25,920 INFO L147 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 15:22:25,928 INFO L159 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 15:22:25,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 15:22:25,972 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 15:22:25,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 15:22:25,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 15:22:25,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 15:22:25,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 15:22:25,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 15:22:25,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 15:22:25,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 15:22:25,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 15:22:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-19 15:22:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-19 15:22:25,999 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:26,000 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] [2018-11-19 15:22:26,002 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:26,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1385598080, now seen corresponding path program 1 times [2018-11-19 15:22:26,012 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:26,012 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:26,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:26,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:26,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {69#true} call ULTIMATE.init(); {69#true} is VALID [2018-11-19 15:22:26,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {69#true} is VALID [2018-11-19 15:22:26,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {69#true} assume true; {69#true} is VALID [2018-11-19 15:22:26,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {69#true} {69#true} #214#return; {69#true} is VALID [2018-11-19 15:22:26,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {69#true} call #t~ret24 := main(); {69#true} is VALID [2018-11-19 15:22:26,173 INFO L256 TraceCheckUtils]: 5: Hoare triple {69#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {69#true} is VALID [2018-11-19 15:22:26,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {69#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {69#true} is VALID [2018-11-19 15:22:26,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {69#true} assume !true; {70#false} is VALID [2018-11-19 15:22:26,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {70#false} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {70#false} is VALID [2018-11-19 15:22:26,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {70#false} assume !true; {70#false} is VALID [2018-11-19 15:22:26,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {70#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {70#false} is VALID [2018-11-19 15:22:26,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-19 15:22:26,177 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {70#false} {69#true} #202#return; {70#false} is VALID [2018-11-19 15:22:26,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {70#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {70#false} is VALID [2018-11-19 15:22:26,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {70#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {70#false} is VALID [2018-11-19 15:22:26,178 INFO L256 TraceCheckUtils]: 15: Hoare triple {70#false} call inspect(~data~0.base, ~data~0.offset); {70#false} is VALID [2018-11-19 15:22:26,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {70#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {70#false} is VALID [2018-11-19 15:22:26,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-19 15:22:26,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {70#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {70#false} is VALID [2018-11-19 15:22:26,180 INFO L256 TraceCheckUtils]: 19: Hoare triple {70#false} call fail(); {70#false} is VALID [2018-11-19 15:22:26,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {70#false} assume !false; {70#false} is VALID [2018-11-19 15:22:26,184 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:26,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:26,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:26,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 15:22:26,194 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-19 15:22:26,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:26,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-19 15:22:26,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:26,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-19 15:22:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 15:22:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 15:22:26,252 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-19 15:22:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:26,526 INFO L93 Difference]: Finished difference Result 123 states and 184 transitions. [2018-11-19 15:22:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 15:22:26,526 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-19 15:22:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 15:22:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2018-11-19 15:22:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 15:22:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2018-11-19 15:22:26,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 184 transitions. [2018-11-19 15:22:26,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:26,860 INFO L225 Difference]: With dead ends: 123 [2018-11-19 15:22:26,860 INFO L226 Difference]: Without dead ends: 43 [2018-11-19 15:22:26,863 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-19 15:22:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-19 15:22:26,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:26,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-19 15:22:26,905 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-19 15:22:26,905 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-19 15:22:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:26,910 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-19 15:22:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-19 15:22:26,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:26,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:26,912 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-19 15:22:26,912 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-19 15:22:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:26,916 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-19 15:22:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-19 15:22:26,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:26,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:26,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:26,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-19 15:22:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-19 15:22:26,923 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 21 [2018-11-19 15:22:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:26,923 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-19 15:22:26,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 15:22:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-19 15:22:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-19 15:22:26,924 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:26,924 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, 1] [2018-11-19 15:22:26,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:26,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -663775155, now seen corresponding path program 1 times [2018-11-19 15:22:26,926 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:26,926 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:26,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:26,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:27,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2018-11-19 15:22:27,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {428#true} is VALID [2018-11-19 15:22:27,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2018-11-19 15:22:27,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #214#return; {428#true} is VALID [2018-11-19 15:22:27,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret24 := main(); {428#true} is VALID [2018-11-19 15:22:27,130 INFO L256 TraceCheckUtils]: 5: Hoare triple {428#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {428#true} is VALID [2018-11-19 15:22:27,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:27,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume true; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:27,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(0bv32 != #t~nondet7);havoc #t~nondet7; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:27,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:27,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume true; {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:27,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {451#(and (= create_tree_~nodelast~0.base (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset))} is VALID [2018-11-19 15:22:27,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#(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; {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-19 15:22:27,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} assume true; {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} is VALID [2018-11-19 15:22:27,143 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {470#(and (= |create_tree_#res.base| (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)))} {428#true} #202#return; {477#(and (= (_ bv0 32) |main_#t~ret23.offset|) (= |main_#t~ret23.base| (_ bv0 32)))} is VALID [2018-11-19 15:22:27,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {477#(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; {481#(and (= main_~data~0.base (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset))} is VALID [2018-11-19 15:22:27,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {481#(and (= main_~data~0.base (_ bv0 32)) (= (_ bv0 32) main_~data~0.offset))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {429#false} is VALID [2018-11-19 15:22:27,145 INFO L256 TraceCheckUtils]: 17: Hoare triple {429#false} call inspect(~data~0.base, ~data~0.offset); {429#false} is VALID [2018-11-19 15:22:27,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {429#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {429#false} is VALID [2018-11-19 15:22:27,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {429#false} assume true; {429#false} is VALID [2018-11-19 15:22:27,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {429#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {429#false} is VALID [2018-11-19 15:22:27,147 INFO L256 TraceCheckUtils]: 21: Hoare triple {429#false} call fail(); {429#false} is VALID [2018-11-19 15:22:27,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {429#false} assume !false; {429#false} is VALID [2018-11-19 15:22:27,150 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:27,150 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:27,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:27,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 15:22:27,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-19 15:22:27,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:27,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 15:22:27,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:27,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 15:22:27,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 15:22:27,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 15:22:27,206 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 6 states. [2018-11-19 15:22:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:28,319 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-11-19 15:22:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 15:22:28,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-19 15:22:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2018-11-19 15:22:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 15:22:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2018-11-19 15:22:28,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2018-11-19 15:22:28,480 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:28,483 INFO L225 Difference]: With dead ends: 95 [2018-11-19 15:22:28,484 INFO L226 Difference]: Without dead ends: 49 [2018-11-19 15:22:28,485 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-19 15:22:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-19 15:22:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-19 15:22:28,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:28,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-19 15:22:28,497 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-19 15:22:28,497 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-19 15:22:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:28,501 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-19 15:22:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-19 15:22:28,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:28,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:28,502 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-19 15:22:28,503 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-19 15:22:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:28,506 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-19 15:22:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-19 15:22:28,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:28,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:28,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:28,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-19 15:22:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-19 15:22:28,510 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 23 [2018-11-19 15:22:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:28,510 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-19 15:22:28,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 15:22:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-19 15:22:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-19 15:22:28,512 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:28,512 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, 1] [2018-11-19 15:22:28,512 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:28,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1846107607, now seen corresponding path program 1 times [2018-11-19 15:22:28,513 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:28,514 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:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:28,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:28,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-19 15:22:28,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {784#true} is VALID [2018-11-19 15:22:28,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-19 15:22:28,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #214#return; {784#true} is VALID [2018-11-19 15:22:28,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret24 := main(); {784#true} is VALID [2018-11-19 15:22:28,621 INFO L256 TraceCheckUtils]: 5: Hoare triple {784#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {784#true} is VALID [2018-11-19 15:22:28,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {784#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {784#true} is VALID [2018-11-19 15:22:28,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-19 15:22:28,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {784#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; {784#true} is VALID [2018-11-19 15:22:28,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#true} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:28,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {816#(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); {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:28,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {816#(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); {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:28,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#(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; {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:28,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume true; {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:28,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} assume !(0bv32 != #t~nondet7);havoc #t~nondet7; {816#(or (not (= (_ bv0 32) create_tree_~node~0.offset)) (not (= (_ bv0 32) create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:28,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {816#(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); {785#false} is VALID [2018-11-19 15:22:28,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {785#false} assume true; {785#false} is VALID [2018-11-19 15:22:28,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {785#false} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {785#false} is VALID [2018-11-19 15:22:28,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {785#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {785#false} is VALID [2018-11-19 15:22:28,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {785#false} assume true; {785#false} is VALID [2018-11-19 15:22:28,629 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {785#false} {784#true} #202#return; {785#false} is VALID [2018-11-19 15:22:28,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {785#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {785#false} is VALID [2018-11-19 15:22:28,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {785#false} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {785#false} is VALID [2018-11-19 15:22:28,630 INFO L256 TraceCheckUtils]: 23: Hoare triple {785#false} call inspect(~data~0.base, ~data~0.offset); {785#false} is VALID [2018-11-19 15:22:28,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {785#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {785#false} is VALID [2018-11-19 15:22:28,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {785#false} assume true; {785#false} is VALID [2018-11-19 15:22:28,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {785#false} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {785#false} is VALID [2018-11-19 15:22:28,631 INFO L256 TraceCheckUtils]: 27: Hoare triple {785#false} call fail(); {785#false} is VALID [2018-11-19 15:22:28,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-19 15:22:28,633 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:28,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:28,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:28,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-19 15:22:28,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-19 15:22:28,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:28,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 15:22:28,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:28,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 15:22:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 15:22:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 15:22:28,671 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 3 states. [2018-11-19 15:22:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:29,179 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-19 15:22:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 15:22:29,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-19 15:22:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-19 15:22:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 15:22:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-19 15:22:29,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-19 15:22:29,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:29,288 INFO L225 Difference]: With dead ends: 79 [2018-11-19 15:22:29,288 INFO L226 Difference]: Without dead ends: 50 [2018-11-19 15:22:29,289 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-19 15:22:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-19 15:22:29,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:29,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-19 15:22:29,313 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-19 15:22:29,313 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-19 15:22:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:29,317 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-19 15:22:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-19 15:22:29,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:29,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:29,318 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-19 15:22:29,318 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-19 15:22:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:29,320 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-19 15:22:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-19 15:22:29,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:29,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:29,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:29,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-19 15:22:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-19 15:22:29,323 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 29 [2018-11-19 15:22:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:29,323 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-19 15:22:29,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 15:22:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-19 15:22:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-19 15:22:29,325 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:29,325 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] [2018-11-19 15:22:29,325 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:29,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1710815217, now seen corresponding path program 1 times [2018-11-19 15:22:29,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:29,326 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:29,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:29,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:29,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {1140#true} call ULTIMATE.init(); {1140#true} is VALID [2018-11-19 15:22:29,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {1140#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1140#true} is VALID [2018-11-19 15:22:29,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2018-11-19 15:22:29,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1140#true} #214#return; {1140#true} is VALID [2018-11-19 15:22:29,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {1140#true} call #t~ret24 := main(); {1140#true} is VALID [2018-11-19 15:22:29,535 INFO L256 TraceCheckUtils]: 5: Hoare triple {1140#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1140#true} is VALID [2018-11-19 15:22:29,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {1140#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {1140#true} is VALID [2018-11-19 15:22:29,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {1140#true} assume true; {1140#true} is VALID [2018-11-19 15:22:29,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {1140#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; {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-19 15:22:29,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-19 15:22:29,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {1169#(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); {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-19 15:22:29,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} assume !(~nodelast~0.base != 0bv32 || ~nodelast~0.offset != 0bv32); {1169#(not (= (_ bv0 32) create_tree_~node~0.base))} is VALID [2018-11-19 15:22:29,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {1169#(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; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(0bv32 != #t~nondet7);havoc #t~nondet7; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume ~node~0.base != 0bv32 || ~node~0.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~bvadd32(8bv32, ~node~0.offset), 4bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {1182#(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); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(~node~0.base == 0bv32 && ~node~0.offset == 0bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {1182#(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; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume true; {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {1182#(not (= create_tree_~nodelast~0.base (_ bv0 32)))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} is VALID [2018-11-19 15:22:29,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} assume true; {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} is VALID [2018-11-19 15:22:29,548 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1213#(not (= |create_tree_#res.base| (_ bv0 32)))} {1140#true} #202#return; {1220#(not (= |main_#t~ret23.base| (_ bv0 32)))} is VALID [2018-11-19 15:22:29,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {1220#(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; {1224#(not (= main_~data~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {1224#(not (= main_~data~0.base (_ bv0 32)))} assume !(~data~0.base == 0bv32 && ~data~0.offset == 0bv32); {1224#(not (= main_~data~0.base (_ bv0 32)))} is VALID [2018-11-19 15:22:29,551 INFO L256 TraceCheckUtils]: 27: Hoare triple {1224#(not (= main_~data~0.base (_ bv0 32)))} call inspect(~data~0.base, ~data~0.offset); {1231#(not (= |inspect_#in~node.base| (_ bv0 32)))} is VALID [2018-11-19 15:22:29,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {1231#(not (= |inspect_#in~node.base| (_ bv0 32)))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1235#(not (= (_ bv0 32) inspect_~node.base))} is VALID [2018-11-19 15:22:29,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {1235#(not (= (_ bv0 32) inspect_~node.base))} assume true; {1235#(not (= (_ bv0 32) inspect_~node.base))} is VALID [2018-11-19 15:22:29,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {1235#(not (= (_ bv0 32) inspect_~node.base))} assume ~node.base == 0bv32 && ~node.offset == 0bv32; {1141#false} is VALID [2018-11-19 15:22:29,553 INFO L256 TraceCheckUtils]: 31: Hoare triple {1141#false} call fail(); {1141#false} is VALID [2018-11-19 15:22:29,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2018-11-19 15:22:29,557 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:29,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-19 15:22:29,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 15:22:29,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-19 15:22:29,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-19 15:22:29,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 15:22:29,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 15:22:29,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:29,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 15:22:29,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 15:22:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-19 15:22:29,604 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-11-19 15:22:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:32,612 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-11-19 15:22:32,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-19 15:22:32,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-19 15:22:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 15:22:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 15:22:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2018-11-19 15:22:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 15:22:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2018-11-19 15:22:32,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 115 transitions. [2018-11-19 15:22:32,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 15:22:32,742 INFO L225 Difference]: With dead ends: 102 [2018-11-19 15:22:32,742 INFO L226 Difference]: Without dead ends: 64 [2018-11-19 15:22:32,743 INFO L613 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-19 15:22:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2018-11-19 15:22:32,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 15:22:32,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 49 states. [2018-11-19 15:22:32,766 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 49 states. [2018-11-19 15:22:32,766 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 49 states. [2018-11-19 15:22:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:32,769 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-19 15:22:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-19 15:22:32,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:32,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:32,770 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 64 states. [2018-11-19 15:22:32,770 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 64 states. [2018-11-19 15:22:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 15:22:32,773 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-19 15:22:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-19 15:22:32,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 15:22:32,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 15:22:32,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 15:22:32,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 15:22:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-19 15:22:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-19 15:22:32,777 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 33 [2018-11-19 15:22:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 15:22:32,777 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-19 15:22:32,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 15:22:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-19 15:22:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-19 15:22:32,778 INFO L376 BasicCegarLoop]: Found error trace [2018-11-19 15:22:32,779 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, 1] [2018-11-19 15:22:32,779 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 15:22:32,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 15:22:32,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1384140576, now seen corresponding path program 1 times [2018-11-19 15:22:32,780 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-19 15:22:32,780 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:32,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 15:22:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 15:22:32,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 15:22:32,944 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:32,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:32,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:32,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-19 15:22:32,960 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:33,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:33,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:33,070 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:33,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:33,119 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:33,127 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:33,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:33,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:33,168 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:33,176 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:33,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:33,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:33,209 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:33,210 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:25 [2018-11-19 15:22:33,232 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:46,701 WARN L180 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 149 DAG size of output: 49 [2018-11-19 15:22:47,046 INFO L303 Elim1Store]: Index analysis took 338 ms [2018-11-19 15:22:47,050 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 460 treesize of output 348 [2018-11-19 15:22:47,077 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:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:47,113 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:47,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:47,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:47,605 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:22:47,762 INFO L303 Elim1Store]: Index analysis took 190 ms [2018-11-19 15:22:47,764 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 347 treesize of output 347 [2018-11-19 15:22:47,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:47,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:47,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:47,833 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:47,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,247 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:22:48,538 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 282 treesize of output 136 [2018-11-19 15:22:48,556 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:48,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:48,571 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:48,575 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,723 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 140 treesize of output 124 [2018-11-19 15:22:48,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:48,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:48,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:48,747 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:48,749 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,796 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,847 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,907 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 25 treesize of output 18 [2018-11-19 15:22:48,914 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 18 treesize of output 17 [2018-11-19 15:22:48,915 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,921 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:48,962 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:1680, output treesize:134 [2018-11-19 15:22:50,975 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:51,859 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:51,874 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:51,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:51,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:51,922 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:51,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:51,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:51,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:22:51,938 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:51,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:51,968 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:51,969 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:51,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:52,004 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:52,008 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:52,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:52,027 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:52,028 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-19 15:22:52,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:22:52,031 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:52,032 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:5 [2018-11-19 15:22:52,042 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:22:52,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {1573#true} call ULTIMATE.init(); {1573#true} is VALID [2018-11-19 15:22:52,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {1573#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1573#true} is VALID [2018-11-19 15:22:52,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {1573#true} assume true; {1573#true} is VALID [2018-11-19 15:22:52,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1573#true} {1573#true} #214#return; {1573#true} is VALID [2018-11-19 15:22:52,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {1573#true} call #t~ret24 := main(); {1573#true} is VALID [2018-11-19 15:22:52,094 INFO L256 TraceCheckUtils]: 5: Hoare triple {1573#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1573#true} is VALID [2018-11-19 15:22:52,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {1573#true} ~nodelast~0.base, ~nodelast~0.offset := 0bv32, 0bv32;~node~0.base, ~node~0.offset := 0bv32, 0bv32; {1573#true} is VALID [2018-11-19 15:22:52,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {1573#true} assume true; {1573#true} is VALID [2018-11-19 15:22:52,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#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; {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:52,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#(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); {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:52,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#(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); {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:52,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#(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); {1602#(and (= (_ bv0 32) create_tree_~node~0.offset) (= (_ bv1 1) (select |#valid| create_tree_~node~0.base)))} is VALID [2018-11-19 15:22:52,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#(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; {1615#(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:52,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {1615#(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; {1615#(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:52,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {1615#(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; {1615#(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:52,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {1615#(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 write~$Pointer$(0bv32, 0bv32, ~node~0.base, ~bvadd32(8bv32, ~node~0.offset), 4bv32); {1615#(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:52,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {1615#(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; {1615#(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:52,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {1615#(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); {1631#(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:52,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(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); {1631#(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:52,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {1631#(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; {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} is VALID [2018-11-19 15:22:52,120 INFO L273 TraceCheckUtils]: 20: Hoare triple {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} assume true; {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} is VALID [2018-11-19 15:22:52,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} assume !(~node~0.base != 0bv32 || ~node~0.offset != 0bv32); {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} is VALID [2018-11-19 15:22:52,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {1638#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32))) create_tree_~nodelast~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (_ bv0 32)) (not (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset))) (= create_tree_~nodelast~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) create_tree_~nodelast~0.offset) (= (_ bv42 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv12 32)))) (= (select (select |#memory_$Pointer$.offset| create_tree_~nodelast~0.base) create_tree_~nodelast~0.offset) (_ bv0 32)))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} is VALID [2018-11-19 15:22:52,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} assume true; {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} is VALID [2018-11-19 15:22:52,136 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1648#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32))) |create_tree_#res.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (not (= |create_tree_#res.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|)) (_ bv0 32)) (= |create_tree_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv12 32))) (_ bv4294967254 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32))) (_ bv0 32)) (= |create_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |create_tree_#res.base|) |create_tree_#res.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |create_tree_#res.base|) |create_tree_#res.offset|) (_ bv4 32)))))} {1573#true} #202#return; {1655#(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|) (= (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)))) (= (_ bv42 32) (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)))))} is VALID [2018-11-19 15:22:52,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {1655#(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|) (= (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)))) (= (_ bv42 32) (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)))))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1659#(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)))) (= (_ 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)) (= (bvadd (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))) (_ bv4294967254 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:52,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {1659#(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)))) (= (_ 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)) (= (bvadd (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))) (_ bv4294967254 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); {1659#(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)))) (= (_ 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)) (= (bvadd (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))) (_ bv4294967254 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:52,147 INFO L256 TraceCheckUtils]: 27: Hoare triple {1659#(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)))) (= (_ 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)) (= (bvadd (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))) (_ bv4294967254 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); {1666#(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:52,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {1666#(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; {1670#(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:52,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {1670#(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; {1670#(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:52,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {1670#(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); {1670#(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:52,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {1670#(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; {1670#(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:52,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {1670#(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; {1670#(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:52,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {1670#(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); {1670#(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:52,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {1670#(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; {1670#(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:52,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {1670#(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); {1692#(= (_ bv42 32) |inspect_#t~mem4|)} is VALID [2018-11-19 15:22:52,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {1692#(= (_ bv42 32) |inspect_#t~mem4|)} assume !(42bv32 == #t~mem4);havoc #t~mem4;havoc #t~mem3.base, #t~mem3.offset; {1574#false} is VALID [2018-11-19 15:22:52,166 INFO L256 TraceCheckUtils]: 37: Hoare triple {1574#false} call fail(); {1574#false} is VALID [2018-11-19 15:22:52,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {1574#false} assume !false; {1574#false} is VALID [2018-11-19 15:22:52,183 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:52,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-19 15:23:07,409 WARN L180 SmtUtils]: Spent 12.72 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-19 15:23:16,699 WARN L180 SmtUtils]: Spent 9.28 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-19 15:23:31,598 WARN L180 SmtUtils]: Spent 14.89 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-19 15:23:51,126 WARN L180 SmtUtils]: Spent 19.53 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-19 15:23:55,174 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-19 15:23:57,523 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-19 15:23:57,541 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:57,564 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:57,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:23:57,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:23:57,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:23:57,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:1671, output treesize:1531 [2018-11-19 15:23:57,818 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-19 15:23:58,781 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-19 15:23:58,864 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:24:01,473 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2018-11-19 15:24:01,504 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,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:01,824 INFO L303 Elim1Store]: Index analysis took 203 ms [2018-11-19 15:24:01,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 682 treesize of output 692 [2018-11-19 15:24:10,231 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-19 15:24:10,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 613 treesize of output 614 [2018-11-19 15:24:10,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:10,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 613 [2018-11-19 15:24:10,836 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:11,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 613 treesize of output 613 [2018-11-19 15:24:11,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 604 treesize of output 587 [2018-11-19 15:24:11,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:11,772 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:11,890 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:24:11,936 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:13,099 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:13,366 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-19 15:24:13,385 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:13,387 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:13,735 INFO L303 Elim1Store]: Index analysis took 155 ms [2018-11-19 15:24:13,869 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:16,979 WARN L180 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2018-11-19 15:24:16,997 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:17,000 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:17,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 96 [2018-11-19 15:24:17,011 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:17,021 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:17,025 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:17,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:17,041 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:19,756 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:19,760 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-19 15:24:19,771 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:19,788 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:19,790 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:22,433 INFO L303 Elim1Store]: Index analysis took 163 ms [2018-11-19 15:24:22,541 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:23,016 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-19 15:24:23,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:23,067 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:23,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:23,140 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 66 treesize of output 87 [2018-11-19 15:24:23,152 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:23,394 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 56 treesize of output 54 [2018-11-19 15:24:23,397 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:23,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:23,644 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 65 treesize of output 86 [2018-11-19 15:24:23,659 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:23,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:23,953 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:23,965 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:24,126 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-19 15:24:24,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:24,142 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:24,162 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:24,210 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:24,258 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:24,271 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:24,467 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:24,471 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:24,592 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:24,629 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:24,643 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:24,753 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:24,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:24,765 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:24,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:24,832 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:24,845 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-19 15:24:24,928 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:25,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:25,419 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:25,590 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-11-19 15:24:25,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:25,620 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:25,625 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-11-19 15:24:25,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:25,706 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:25,708 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:25,766 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:25,768 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:25,815 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:25,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:25,842 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:26,059 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-19 15:24:26,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,068 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:26,070 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,076 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:26,079 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,209 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:26,213 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,217 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:26,219 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,321 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:26,325 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,329 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:26,331 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,383 INFO L267 ElimStorePlain]: Start of recursive call 34: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,391 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,401 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:26,480 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,481 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:26,483 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26,504 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,517 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,521 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,524 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:26,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,597 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:26,598 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,620 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:26,628 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,638 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,857 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:26,866 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:26,869 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,934 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:26,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:26,947 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:26,954 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:26,956 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:26,979 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,100 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:27,291 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-19 15:24:27,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:27,308 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:27,311 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:27,397 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:27,400 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,445 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,454 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:27,464 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:24:27,467 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:27,469 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,492 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:27,494 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,506 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:24:27,551 INFO L267 ElimStorePlain]: Start of recursive call 18: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-19 15:24:27,827 INFO L303 Elim1Store]: Index analysis took 268 ms [2018-11-19 15:24:28,281 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:28,282 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-19 15:24:43,509 WARN L180 SmtUtils]: Spent 14.95 s on a formula simplification. DAG size of input: 623 DAG size of output: 493 [2018-11-19 15:24:43,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:24:43,539 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:43,543 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:54,424 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:54,435 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:54,439 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-19 15:24:54,525 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-19 15:25:06,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:25:06,379 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:25:06,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:25:06,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-19 15:25:06,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-19 15:25:06,600 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:25:06,601 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:25:06,605 INFO L168 Benchmark]: Toolchain (without parser) took 162129.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 913.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -873.4 MB). Peak memory consumption was 706.3 MB. Max. memory is 14.2 GB. [2018-11-19 15:25:06,606 INFO L168 Benchmark]: CDTParser took 0.19 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:25:06,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 37.5 MB. Max. memory is 14.2 GB. [2018-11-19 15:25:06,607 INFO L168 Benchmark]: Boogie Preprocessor took 79.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 14.2 GB. [2018-11-19 15:25:06,608 INFO L168 Benchmark]: RCFGBuilder took 794.11 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 14.2 GB. [2018-11-19 15:25:06,608 INFO L168 Benchmark]: TraceAbstraction took 160698.75 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 196.6 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -180.8 MB). Peak memory consumption was 681.6 MB. Max. memory is 14.2 GB. [2018-11-19 15:25:06,610 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.19 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 552.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 37.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 79.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 794.11 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 160698.75 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 196.6 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -180.8 MB). Peak memory consumption was 681.6 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...