Jump to content
×
×
  • Create New...
  • 0

Vanilla core db crash


Eptun

Question

So i compiled the vanilla core in debug mode and it crashes on start.

db.core bt full:

Spoiler
#0  0x0000000801f3669a in thr_kill () from /lib/libc.so.7
No symbol table info available.
#1  0x0000000801f36686 in raise () from /lib/libc.so.7
No symbol table info available.
#2  0x0000000801f36609 in abort () from /lib/libc.so.7
No symbol table info available.
#3  0x00000000004e995e in emergency_sig (sig=11) at Main.cpp:57
No locals.
#4  0x0000000801c5fa3a in pthread_sigmask () from /lib/libthr.so.3
No symbol table info available.
#5  0x0000000801c5f11c in pthread_getspecific () from /lib/libthr.so.3
No symbol table info available.
#6  <signal handler called>
No symbol table info available.
#7  0x0000000800e63664 in free_root () from /usr/local/lib/mysql/libmysqlclient.so.18
No symbol table info available.
#8  0x0000000800e3910e in mysql_free_result () from /usr/local/lib/mysql/libmysqlclient.so.18
No symbol table info available.
#9  0x000000000040664a in _SQLResult::~_SQLResult (this=0x803421180) at AsyncSQL.h:30
No locals.
#10 0x0000000000406493 in _SQLMsg::~_SQLMsg (this=0x80351e200) at AsyncSQL.h:53
        first = {__i = 0x803424218}
        past = {__i = 0x803424218}
#11 0x00000000004b3b41 in CGuildManager::Initialize (this=0x7fffffffe640) at memory:2431
        szQuery = 0x7fffffffdb50 "SELECT id, name, ladder_point, win, draw, loss, gold, level FROM guild"
        pmsg = {
  __ptr_ = {<std::__1::__libcpp_compressed_pair_imp<_SQLMsg *, std::__1::default_delete<_SQLMsg>, 2>> = {<std::__1::default_delete<_SQLMsg>> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}
        str = 0x7fffffffdab0 ""
#12 0x00000000004e9b5c in main () at Main.cpp:83
        Config = {<singleton<CConfig>> = {_vptr$singleton = 0x52e340, static ms_singleton = <optimized out>},
  m_valueMap = {__tree_ = {__begin_node_ = 0x803417420,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::basic_string<char>, std::__1::basic_string<char> >, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::basic_string<char>, std::__1::basic_string<char> >, void *> >> = {<No data fields>}, __first_ = {
            __left_ = 0x803417100}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<std::__1::basic_string<char>, std::__1::__value_type<std::__1::basic_string<char>, std::__1::basic_string<char> >, std::__1::less<std::__1::basic_string<char> >, true>, 2>> = {<std::__1::__map_value_compare<std::__1::basic_string<char>, std::__1::__value_type<std::__1::basic_string<char>, std::__1::basic_string<char> >, std::__1::less<std::__1::basic_string<char> >, true>> = {<std::__1::less<std::__1::basic_string<char> >> = {<std::__1::binary_function<std::__1::basic_string<char>, std::__1::basic_string<char>, bool>> = {<No data fields>}, <No data fields>}, <No data fields>},
---Type <return> to continue, or q <return> to quit---
          __first_ = 15}, <No data fields>}}}}
        poller = {<CNetBase> = {_vptr$CNetBase = 0x533de0,
    static m_fdWatcher = <optimized out>}, <singleton<CNetPoller>> = {_vptr$singleton = 0x533e00,
    static ms_singleton = <optimized out>}, <No data fields>}
        DBManager = {<singleton<CDBManager>> = {_vptr$singleton = 0x52e1f0,
    static ms_singleton = <optimized out>}, m_mainSQL = 0x7fffffffecb8, m_directSQL = 0x7fffffffecd8,
  m_asyncSQL = 0x7fffffffecf8}
        ClientManager = {<CNetBase> = {_vptr$CNetBase = 0x52b6c8,
    static m_fdWatcher = <optimized out>}, <singleton<CClientManager>> = {_vptr$singleton = 0x52b6e8,
    static ms_singleton = <optimized out>}, m_looping = 1, m_fdAccept = 19,
  m_peerList = {<std::__1::__list_imp<CPeer *, std::__1::allocator<CPeer *> >> = {__end_ = {
        __prev_ = 0x7fffffffe8f8, __next_ = 0x7fffffffe8f8},
      __size_alloc_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::allocator<std::__1::__list_node<CPeer *, void *> >, 2>> = {<std::__1::allocator<std::__1::__list_node<CPeer *, void *> >> = {<No data fields>}, __first_ = 0}, <No data fields>}}, <No data fields>}, m_pkAuthPeer = 0x0, m_map_pkLoginData = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, CLoginData *> >, unsigned int, CLoginData *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> = {static nothrow_move_assignable = <optimized out>, static nothrow_move_constructible = <optimized out>,
          current_ = false, funcs_ = 0x7fffffffe919},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CLoginData *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CLoginData *> > >> = {<No data fields>}, <No data fields>}, <No data fields>},
        bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_map_pkLoginDataByLogin = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const std::__1::basic_string<char>, CLoginData *> >, std::__1::basic_string<char>, CLoginData *, boost::hash<std::string>, std::__1::equal_to<std::__1::basic_string<char> > > >> = {<boost::unordered::detail::functions<boost::hash<std::string>, std::__1::equal_to<std::__1::basic_string<char> > >> = {
          static nothrow_move_assignable = <optimized out>, static nothrow_move_constructible = <optimized out>,
          current_ = false, funcs_ = 0x7fffffffe949},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const std::__1::basic_string<char>, CLoginData *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const std::__1::basic_string<char>, CLoginData *> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 16, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_map_pkLoginDataByAID = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, CLoginData *> >, unsigned int, CLoginData *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> ---Type <return> to continue, or q <return> to quit---
= {static nothrow_move_assignable = <optimized out>, static nothrow_move_constructible = <optimized out>,
          current_ = false, funcs_ = 0x7fffffffe979},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CLoginData *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CLoginData *> > >> = {<No data fields>}, <No data fields>}, <No data fields>},
        bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_map_kLogonAccount = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const std::__1::basic_string<char>, CLoginData *> >, std::__1::basic_string<char>, CLoginData *, boost::hash<std::string>, std::__1::equal_to<std::__1::basic_string<char> > > >> = {<boost::unordered::detail::functions<boost::hash<std::string>, std::__1::equal_to<std::__1::basic_string<char> > >> = {
          static nothrow_move_assignable = <optimized out>, static nothrow_move_constructible = <optimized out>,
          current_ = false, funcs_ = 0x7fffffffe9a9},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const std::__1::basic_string<char>, CLoginData *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const std::__1::basic_string<char>, CLoginData *> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 16, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_iPlayerIDStart = 3, m_iPlayerDeleteLevelLimit = 70, m_iPlayerDeleteLevelLimitLower = 0,
  m_bChinaEventServer = false,
  m_vec_mobTable = {<std::__1::__vector_base<SMobTable, std::__1::allocator<SMobTable> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x80370a000, __end_ = 0x80375fb9f,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<SMobTable *, std::__1::allocator<SMobTable>, 2>> = {<std::__1::allocator<SMobTable>> = {<No data fields>},
          __first_ = 0x803789800}, <No data fields>}}, <No data fields>},
  m_vec_itemTable = {<std::__1::__vector_base<SItemTable, std::__1::allocator<SItemTable> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x805806000, __end_ = 0x80593ca88,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<SItemTable *, std::__1::allocator<SItemTable>, 2>> = {<std::__1::allocator<SItemTable>> = {<No data fields>},
          __first_ = 0x8059b6000}, <No data fields>}}, <No data fields>}, m_map_itemTableByVnum = {__tree_ = {
      __begin_node_ = 0x803420b50,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, SItemTable *>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, SItemTable *>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x8054ed160}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, SItemTable *>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, SItemTable *>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 5891}, <No data fields>}}}, m_iShopTableSize = 30,
---Type <return> to continue, or q <return> to quit---
  m_pShopTable = 0x803583000, m_iRefineTableSize = 432, m_pRefineTable = 0x803593000,
  m_vec_skillTable = {<std::__1::__vector_base<SSkillTable, std::__1::allocator<SSkillTable> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x8036ce000, __end_ = 0x8036e5787,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<SSkillTable *, std::__1::allocator<SSkillTable>, 2>> = {<std::__1::allocator<SSkillTable>> = {<No data fields>},
          __first_ = 0x8036e5787}, <No data fields>}}, <No data fields>},
  m_vec_banwordTable = {<std::__1::__vector_base<SBanwordTable, std::__1::allocator<SBanwordTable> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<SBanwordTable *, std::__1::allocator<SBanwordTable>, 2>> = {<std::__1::allocator<SBanwordTable>> = {<No data fields>},
          __first_ = 0x0}, <No data fields>}}, <No data fields>},
  m_vec_itemAttrTable = {<std::__1::__vector_base<TItemAttrTable, std::__1::allocator<TItemAttrTable> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x80368b000, __end_ = 0x80368bfa5,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<TItemAttrTable *, std::__1::allocator<TItemAttrTable>, 2>> = {<std::__1::allocator<TItemAttrTable>> = {<No data fields>},
          __first_ = 0x80368bfa5}, <No data fields>}}, <No data fields>},
  m_vec_itemRareTable = {<std::__1::__vector_base<TItemAttrTable, std::__1::allocator<TItemAttrTable> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x803553300, __end_ = 0x8035535c8,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<TItemAttrTable *, std::__1::allocator<TItemAttrTable>, 2>> = {<std::__1::allocator<TItemAttrTable>> = {<No data fields>},
          __first_ = 0x8035535c8}, <No data fields>}}, <No data fields>},
  m_vec_kLandTable = {<std::__1::__vector_base<building::SLand, std::__1::allocator<building::SLand> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x80357d000, __end_ = 0x80357eb00,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<building::SLand *, std::__1::allocator<building::SLand>, 2>> = {<std::__1::allocator<building::SLand>> = {<No data fields>},
          __first_ = 0x80357eb00}, <No data fields>}}, <No data fields>},
  m_vec_kObjectProto = {<std::__1::__vector_base<building::SObjectProto, std::__1::allocator<building::SObjectProto> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x80357f000,
      __end_ = 0x803580480,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<building::SObjectProto *, std::__1::allocator<building::SObjectProto>, 2>> = {<std::__1::allocator<building::SObjectProto>> = {<No data fields>},
          __first_ = 0x803580480}, <No data fields>}}, <No data fields>}, m_map_pkObjectTable = {__tree_ = {
      __begin_node_ = 0x7fffffffeae8,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, building::SObject *>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, building::SObject *>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, building::SObject *>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, building::SObject *>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, m_queue_vcard = {
    c = {<std::__1::__deque_base<SPacketGDVCard, std::__1::allocator<SPacketGDVCard> >> = {<std::__1::__deque_base_---Type <return> to continue, or q <return> to quit---
common<true>> = {<No data fields>}, static __block_size = <optimized out>,
        __map_ = {<std::__1::__split_buffer_common<true>> = {<No data fields>}, __first_ = 0x0, __begin_ = 0x0,
          __end_ = 0x0,
          __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<SPacketGDVCard **, std::__1::allocator<SPacketGDVCard *>, 2>> = {<std::__1::allocator<SPacketGDVCard *>> = {<No data fields>}, __first_ = 0x0}, <No data fields>}},
        __start_ = 0,
        __size_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::allocator<SPacketGDVCard>, 2>> = {<std::__1::allocator<SPacketGDVCard>> = {<No data fields>},
            __first_ = 0}, <No data fields>}}, <No data fields>}}, m_bShutdowned = false, m_map_playerCache = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, CPlayerTableCache *> >, unsigned int, CPlayerTableCache *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> = {static nothrow_move_assignable = <optimized out>,
          static nothrow_move_constructible = <optimized out>, current_ = false, funcs_ = 0x7fffffffeb31},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CPlayerTableCache *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CPlayerTableCache *> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}}, m_map_itemCache = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, CItemCache *> >, unsigned int, CItemCache *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> = {static nothrow_move_assignable = <optimized out>, static nothrow_move_constructible = <optimized out>,
          current_ = false, funcs_ = 0x7fffffffeb61},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CItemCache *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CItemCache *> > >> = {<No data fields>}, <No data fields>}, <No data fields>},
        bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_map_pkItemCacheSetPtr = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, boost::unordered::unordered_set<CItemCache *, boost::hash<CItemCache *>, std::__1::equal_to<CItemCache *>, std::__1::allocator<CItemCache *> > *> >, unsigned int, boost::unordered::unordered_set<CItemCache *, boost::hash<CItemCache *>, std::__1::equal_to<CItemCache *>, std::__1::allocator<CItemCache *> > *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> = {static nothrow_move_assignable = <optimized out>,
          static nothrow_move_constructible = <optimized out>, current_ = false, funcs_ = 0x7fffffffeb91},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, boost::unordered::unordered_set<CItemCache *, boost::hash<CItemCache *>, std::__1::equal_to<CI---Type <return> to continue, or q <return> to quit---
temCache *>, std::__1::allocator<CItemCache *> > *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, boost::unordered::unordered_set<CItemCache *, boost::hash<CItemCache *>, std::__1::equal_to<CItemCache *>, std::__1::allocator<CItemCache *> > *> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_mapItemPriceListCache = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, CItemPriceListTableCache *> >, unsigned int, CItemPriceListTableCache *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> = {static nothrow_move_assignable = <optimized out>,
          static nothrow_move_constructible = <optimized out>, current_ = false, funcs_ = 0x7fffffffebc1},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CItemPriceListTableCache *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CItemPriceListTableCache *> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  m_mChannelStatus = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const short, unsigned char> >, short, unsigned char, boost::hash<short>, std::__1::equal_to<short> > >> = {<boost::unordered::detail::functions<boost::hash<short>, std::__1::equal_to<short> >> = {
          static nothrow_move_assignable = <optimized out>, static nothrow_move_constructible = <optimized out>,
          current_ = false, funcs_ = 0x7fffffffebf1},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const short, unsigned char> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const short, unsigned char> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 16,
        size_ = 0, mlf_ = 1, max_load_ = 0, buckets_ = 0x0}, <No data fields>}}, m_map_pkChannelParty = {
    __tree_ = {__begin_node_ = 0x7fffffffec28,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned char, std::__1::map<unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > >, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > > > > > >, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned char, std::__1::map<unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > >, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > > > > > >, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned char, std::__1::__value_type<unsigned char, std::__1::map<unsigned int, std::__1::map<unsigned int, CClientManager::TP---Type <return> to continue, or q <return> to quit---
artyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > >, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > > > > > >, std::__1::less<unsigned char>, true>, 2>> = {<std::__1::__map_value_compare<unsigned char, std::__1::__value_type<unsigned char, std::__1::map<unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > >, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, std::__1::map<unsigned int, CClientManager::TPartyInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TPartyInfo> > > > > > >, std::__1::less<unsigned char>, true>> = {<std::__1::less<unsigned char>> = {<std::__1::binary_function<unsigned char, unsigned char, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, m_map_lEventFlag = {__tree_ = {
      __begin_node_ = 0x803416840,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::basic_string<char>, long>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::basic_string<char>, long>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x803416940}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<std::__1::basic_string<char>, std::__1::__value_type<std::__1::basic_string<char>, long>, std::__1::less<std::__1::basic_string<char> >, true>, 2>> = {<std::__1::__map_value_compare<std::__1::basic_string<char>, std::__1::__value_type<std::__1::basic_string<char>, long>, std::__1::less<std::__1::basic_string<char> >, true>> = {<std::__1::less<std::__1::basic_string<char> >> = {<std::__1::binary_function<std::__1::basic_string<char>, std::__1::basic_string<char>, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 21}, <No data fields>}}},
  m_bLastHeader = 0 '\0', m_iCacheFlushCount = 0, m_iCacheFlushCountLimit = 200, m_itemRange = {dwMin = 10000001,
    dwMax = 20000000, dwUsableItemIDMin = 10002002},
  m_vec_Locale = {<std::__1::__vector_base<tLocale, std::__1::allocator<tLocale> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x803408c00, __end_ = 0x803408f40,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<tLocale *, std::__1::allocator<tLocale>, 2>> = {<std::__1::allocator<tLocale>> = {<No data fields>}, __first_ = 0x803409000}, <No data fields>}}, <No data fields>},
  m_map_logout = {
    table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::__1::allocator<std::__1::pair<const unsigned int, CClientManager::TLogoutPlayer *> >, unsigned int, CClientManager::TLogoutPlayer *, boost::hash<unsigned int>, std::__1::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::__1::equal_to<unsigned int> >> = {static nothrow_move_assignable = <optimized out>,
          static nothrow_move_constructible = <optimized out>, current_ = false, funcs_ = 0x7fffffffec81},
        allocators_ = {<boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::__1::allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CClientManager::TLogoutPlayer *> > >, 2>> = {<std::__1::allocator<boost::unordered::detail::ptr_node<std::__1::pair<const unsigned int, CClientManager::TLogoutPlayer *> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0,
        buckets_ = 0x0}, <No data fields>}}}
        player_hb = {<singleton<PlayerHB>> = {_vptr$singleton = 0x52dfc0, static ms_singleton = <optimized out>},
  m_map_data = {__tree_ = {__begin_node_ = 0x7fffffffe898,
---Type <return> to continue, or q <return> to quit---
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, long>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, long>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, long>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, long>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}},
  m_stCreateTableQuery = {<std::__1::__basic_string_common<true>> = {<No data fields>},
    __r_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep, std::__1::allocator<char>, 2u>> = {<std::__1::allocator<char>> = {<No data fields>}, __first_ = {{__l = {__cap_ = 2417, __size_ = 2400,
              __data_ = 0x80378a800 "CREATE TABLE `player` (\n  `id` int(11) NOT NULL AUTO_INCREMENT,\n  `account_id` int(11) NOT NULL DEFAULT '0',\n  `name` varchar(24) NOT NULL DEFAULT 'NONAME',\n  `job` tinyint(2) unsigned NOT NULL DEFAUL"...}, __s = {{__size_ = 113 'q', __lx = 113 'q'}, __data_ = 0x7fffffffe8a9 "\t"}, __r = {
              __words = 0x7fffffffe8a8}}}}, <No data fields>}, static npos = <optimized out>},
  m_stTableName = {<std::__1::__basic_string_common<true>> = {<No data fields>},
    __r_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep, std::__1::allocator<char>, 2u>> = {<std::__1::allocator<char>> = {<No data fields>}, __first_ = {{__l = {__cap_ = 0, __size_ = 0, __data_ = 0x0}, __s = {{__size_ = 0 '\0', __lx = 0 '\0'},
              __data_ = 0x7fffffffe8c1 ""}, __r = {__words = 0x7fffffffe8c0}}}}, <No data fields>},
    static npos = <optimized out>}, m_iExpireTime = 3600}
        GuildManager = {<singleton<CGuildManager>> = {_vptr$singleton = 0x52f5b0,
    static ms_singleton = <optimized out>}, m_map_kGuild = {__tree_ = {__begin_node_ = 0x803417fb0,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, SGuild>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, SGuild>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x803417fb0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, SGuild>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, SGuild>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 1}, <No data fields>}}}, m_mapGuildWarEndTime = {__tree_ = {
      __begin_node_ = 0x7fffffffe668,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, std::__1::map<unsigned int, long, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, long> > > >, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, std::__1::map<unsigned int, long, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, long> > > >, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, std::__1::map<unsigned int, long, std::__1::less<unsigned int>, std::__1::al---Type <return> to continue, or q <return> to quit---
locator<std::__1::pair<const unsigned int, long> > > >, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, std::__1::map<unsigned int, long, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, long> > > >, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, m_DeclareMap = {__tree_ = {
      __begin_node_ = 0x7fffffffe680,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<TGuildDeclareInfo, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<TGuildDeclareInfo, void *> >> = {<No data fields>}, __first_ = {
            __left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::less<TGuildDeclareInfo>, 2>> = {<std::__1::less<TGuildDeclareInfo>> = {<std::__1::binary_function<TGuildDeclareInfo, TGuildDeclareInfo, bool>> = {<No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, m_WarMap = {__tree_ = {
      __begin_node_ = 0x7fffffffe698,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, std::__1::map<unsigned int, SGuildWarInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, SGuildWarInfo> > > >, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, std::__1::map<unsigned int, SGuildWarInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, SGuildWarInfo> > > >, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, std::__1::map<unsigned int, SGuildWarInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, SGuildWarInfo> > > >, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, std::__1::map<unsigned int, SGuildWarInfo, std::__1::less<unsigned int>, std::__1::allocator<std::__1::pair<const unsigned int, SGuildWarInfo> > > >, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>},
          __first_ = 0}, <No data fields>}}}, m_pqOnWar = {
    c = {<std::__1::__vector_base<std::__1::pair<long, TGuildWarPQElement *>, std::__1::allocator<std::__1::pair<long, TGuildWarPQElement *> > >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0,
        __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::pair<long, TGuildWarPQElement *> *, std::__1::allocator<std::__1::pair<long, TGuildWarPQElement *> >, 2>> = {<std::__1::allocator<std::__1::pair<long, TGuildWarPQElement *> >> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<std::__1::pair<long, TGuildWarPQElement *>, std::__1::pair<long, TGuildWarPQElement *>, bool>> = {<No data fields>}, <No data fields>}}, m_pqWaitStart = {
    c = {<std::__1::__vector_base<std::__1::pair<long, TGuildWaitStartInfo>, std::__1::allocator<std::__1::pair<long, TGuildWaitStartInfo> > >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0,
        __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::pair<long, TGuildWaitStartInfo> *, std::__1::allocator<std::__1::pair<long, TGuildWaitStartInfo> >, 2>> = {<std::__1::allocator<std::__1::pair<long, TGuildWaitStartInfo> >> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<std::__1::pair<long, TGuildWaitStartInfo>, std::__1::pair<long, TGuildWaitSt---Type <return> to continue, or q <return> to quit---
artInfo>, bool>> = {<No data fields>}, <No data fields>}}, m_pqSkill = {
    c = {<std::__1::__vector_base<std::__1::pair<long, TGuildSkillUsed>, std::__1::allocator<std::__1::pair<long, TGuildSkillUsed> > >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0,
        __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::pair<long, TGuildSkillUsed> *, std::__1::allocator<std::__1::pair<long, TGuildSkillUsed> >, 2>> = {<std::__1::allocator<std::__1::pair<long, TGuildSkillUsed> >> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<std::__1::pair<long, TGuildSkillUsed>, std::__1::pair<long, TGuildSkillUsed>, bool>> = {<No data fields>}, <No data fields>}}, m_map_kWarReserve = {__tree_ = {
      __begin_node_ = 0x7fffffffe710,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, CGuildWarReserve *>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, CGuildWarReserve *>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, CGuildWarReserve *>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, CGuildWarReserve *>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, polyPower = {
    _vptr$CPoly = 0x535930, iToken = 0, iNumToken = 0, iLookAhead = 0, iErrorPos = 0, ErrorOccur = true,
    uiLookPos = 0,
    tokenBase = {<std::__1::__vector_base<int, std::__1::allocator<int> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<int *, std::__1::allocator<int>, 2>> = {<std::__1::allocator<int>> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    numBase = {<std::__1::__vector_base<double, std::__1::allocator<double> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<double *, std::__1::allocator<double>, 2>> = {<std::__1::allocator<double>> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    lSymbol = {<std::__1::__vector_base<CSymTable *, std::__1::allocator<CSymTable *> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x8034191c0, __end_ = 0x803419288,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<CSymTable **, std::__1::allocator<CSymTable *>, 2>> = {<std::__1::allocator<CSymTable *>> = {<No data fields>},
            __first_ = 0x803419350}, <No data fields>}}, <No data fields>},
    SymbolIndex = {<std::__1::__vector_base<int, std::__1::allocator<int> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x803422080, __end_ = 0x8034220e4,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<int *, std::__1::allocator<int>, 2>> = {<std::__1::allocator<int>> = {<No data fields>}, __first_ = 0x803422100}, <No data fields>}}, <No data fields>}, STSize = 25,
    strData = {<std::__1::__basic_string_common<true>> = {<No data fields>},
      __r_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep, std::__1::allocator<char>, 2u>> = {<std::__1::allocator<char>> = {<No data fields>}, __first_ = {{__l = {__cap_ = 0, __size_ = 0, __data_ = 0x0}, __s = {{__size_ = 0 '\0', __lx = 0 '\0'},
                __data_ = 0x7fffffffe7b1 ""}, __r = {__words = 0x7fffffffe7b0}}}}, <No data fields>},
---Type <return> to continue, or q <return> to quit---
      static npos = <optimized out>}}, polyHandicap = {_vptr$CPoly = 0x535930, iToken = 0, iNumToken = 0,
    iLookAhead = 0, iErrorPos = 0, ErrorOccur = true, uiLookPos = 0,
    tokenBase = {<std::__1::__vector_base<int, std::__1::allocator<int> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<int *, std::__1::allocator<int>, 2>> = {<std::__1::allocator<int>> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    numBase = {<std::__1::__vector_base<double, std::__1::allocator<double> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<double *, std::__1::allocator<double>, 2>> = {<std::__1::allocator<double>> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    lSymbol = {<std::__1::__vector_base<CSymTable *, std::__1::allocator<CSymTable *> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x803419380, __end_ = 0x803419448,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<CSymTable **, std::__1::allocator<CSymTable *>, 2>> = {<std::__1::allocator<CSymTable *>> = {<No data fields>},
            __first_ = 0x803419510}, <No data fields>}}, <No data fields>},
    SymbolIndex = {<std::__1::__vector_base<int, std::__1::allocator<int> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x803422100, __end_ = 0x803422164,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<int *, std::__1::allocator<int>, 2>> = {<std::__1::allocator<int>> = {<No data fields>}, __first_ = 0x803422180}, <No data fields>}}, <No data fields>}, STSize = 25,
    strData = {<std::__1::__basic_string_common<true>> = {<No data fields>},
      __r_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >::__rep, std::__1::allocator<char>, 2u>> = {<std::__1::allocator<char>> = {<No data fields>}, __first_ = {{__l = {__cap_ = 0, __size_ = 0, __data_ = 0x0}, __s = {{__size_ = 0 '\0', __lx = 0 '\0'},
                __data_ = 0x7fffffffe859 ""}, __r = {__words = 0x7fffffffe858}}}}, <No data fields>},
      static npos = <optimized out>}}, map_kLadderPointRankingByGID = {__tree_ = {__begin_node_ = 0x7fffffffe878,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, int>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, int>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, int>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, int>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}}
        PrivManager = {<singleton<CPrivManager>> = {_vptr$singleton = 0x52da10,
    static ms_singleton = <optimized out>}, m_pqPrivChar = {
    c = {<std::__1::__vector_base<std::__1::pair<long, TPrivCharData *>, std::__1::allocator<std::__1::pair<long, TPrivCharData *> > >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0,
        __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::pair<long, TPrivCharData *> *, std::__1::allocator<std::__1::pair<long, TPrivCharData *> >, 2>> = {<std::__1::allocator<std::__1::pair<long, TPrivCharData *> >> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<std::__1::pair<long, TPrivCharData *>, std::__1::pair<long, TPrivCharData *>---Type <return> to continue, or q <return> to quit---
, bool>> = {<No data fields>}, <No data fields>}}, m_pqPrivGuild = {
    c = {<std::__1::__vector_base<std::__1::pair<long, TPrivGuildData *>, std::__1::allocator<std::__1::pair<long, TPrivGuildData *> > >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0,
        __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::pair<long, TPrivGuildData *> *, std::__1::allocator<std::__1::pair<long, TPrivGuildData *> >, 2>> = {<std::__1::allocator<std::__1::pair<long, TPrivGuildData *> >> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<std::__1::pair<long, TPrivGuildData *>, std::__1::pair<long, TPrivGuildData *>, bool>> = {<No data fields>}, <No data fields>}}, m_pqPrivEmpire = {
    c = {<std::__1::__vector_base<std::__1::pair<long, TPrivEmpireData *>, std::__1::allocator<std::__1::pair<long, TPrivEmpireData *> > >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0,
        __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::pair<long, TPrivEmpireData *> *, std::__1::allocator<std::__1::pair<long, TPrivEmpireData *> >, 2>> = {<std::__1::allocator<std::__1::pair<long, TPrivEmpireData *> >> = {<No data fields>}, __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<std::__1::pair<long, TPrivEmpireData *>, std::__1::pair<long, TPrivEmpireData *>, bool>> = {<No data fields>}, <No data fields>}}, m_aaPrivEmpire = 0x7fffffffe4b0,
  m_aPrivGuild = 0x7fffffffe550, m_aPrivChar = 0x7fffffffe5c8}
        MoneyLog = {<singleton<CMoneyLog>> = {_vptr$singleton = 0x533d00, static ms_singleton = <optimized out>},
  m_MoneyLogContainer = 0x7fffffffe370}
        ItemAwardManager = {<singleton<ItemAwardManager>> = {_vptr$singleton = 0x528440,
    static ms_singleton = <optimized out>}, m_map_award = {__tree_ = {__begin_node_ = 0x7fffffffe340,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, SItemAward *>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, SItemAward *>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, SItemAward *>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, SItemAward *>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, m_map_kSetAwardByLogin = {
    __tree_ = {__begin_node_ = 0x7fffffffe358,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::basic_string<char>, std::__1::set<SItemAward *, std::__1::less<SItemAward *>, std::__1::allocator<SItemAward *> > >, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::basic_string<char>, std::__1::set<SItemAward *, std::__1::less<SItemAward *>, std::__1::allocator<SItemAward *> > >, void *> >> = {<No data fields>}, __first_ = {
            __left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<std::__1::basic_string<char>, std::__1::__value_type<std::__1::basic_string<char>, std::__1::set<SItemAward *, std::__1::less<SItemAward *>, std::__1::allocator<SItemAward *> > >, std::__1::less<std::__1::basic_string<char> >, true>, 2>> = {<std::__1::__map_value_compare<std::__1::basic_string<char>, std::__1::__value_type<std::__1::basic_string<char>, std::__1::set<SItemAward *, std::__1::less<SItemAward *>, std::__1::allocator<SItemAward *> > >, std::__1::less<std::---Type <return> to continue, or q <return> to quit---
__1::basic_string<char> >, true>> = {<std::__1::less<std::__1::basic_string<char> >> = {<std::__1::binary_function<std::__1::basic_string<char>, std::__1::basic_string<char>, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}}
        MarriageManager = {<singleton<marriage::CManager>> = {_vptr$singleton = 0x530610,
    static ms_singleton = <optimized out>}, m_Marriages = {__tree_ = {__begin_node_ = 0x7fffffffe2b0,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<marriage::TMarriage *, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<marriage::TMarriage *, void *> >> = {<No data fields>}, __first_ = {
            __left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::less<marriage::TMarriage *>, 2>> = {<std::__1::less<marriage::TMarriage *>> = {<std::__1::binary_function<marriage::TMarriage *, marriage::TMarriage *, bool>> = {<No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}}, m_MarriageByPID = {
    __tree_ = {__begin_node_ = 0x7fffffffe2c8,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, marriage::TMarriage *>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, marriage::TMarriage *>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, marriage::TMarriage *>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, marriage::TMarriage *>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}},
  m_pqWeddingStart = {
    c = {<std::__1::__vector_base<marriage::TWedding, std::__1::allocator<marriage::TWedding> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<marriage::TWedding *, std::__1::allocator<marriage::TWedding>, 2>> = {<std::__1::allocator<marriage::TWedding>> = {<No data fields>},
            __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<marriage::TWedding, marriage::TWedding, bool>> = {<No data fields>}, <No data fields>}}, m_pqWeddingEnd = {
    c = {<std::__1::__vector_base<marriage::TWeddingInfo, std::__1::allocator<marriage::TWeddingInfo> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
        __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<marriage::TWeddingInfo *, std::__1::allocator<marriage::TWeddingInfo>, 2>> = {<std::__1::allocator<marriage::TWeddingInfo>> = {<No data fields>},
            __first_ = 0x0}, <No data fields>}}, <No data fields>},
    comp = {<std::__1::binary_function<marriage::TWeddingInfo, marriage::TWeddingInfo, bool>> = {<No data fields>}, <No data fields>}}, m_mapRunningWedding = {__tree_ = {__begin_node_ = 0x7fffffffe320,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::pair<unsigned int, unsigned int>, marriage::TWedding>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<std::__1::pair<unsigned int, unsigned int>, marriage::TWedding>, void *> >> = {<No data fields>}, __first_ = {
            __left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<std::__1::pa---Type <return> to continue, or q <return> to quit---
ir<unsigned int, unsigned int>, std::__1::__value_type<std::__1::pair<unsigned int, unsigned int>, marriage::TWedding>, std::__1::less<std::__1::pair<unsigned int, unsigned int> >, true>, 2>> = {<std::__1::__map_value_compare<std::__1::pair<unsigned int, unsigned int>, std::__1::__value_type<std::__1::pair<unsigned int, unsigned int>, marriage::TWedding>, std::__1::less<std::__1::pair<unsigned int, unsigned int> >, true>> = {<std::__1::less<std::__1::pair<unsigned int, unsigned int> >> = {<std::__1::binary_function<std::__1::pair<unsigned int, unsigned int>, std::__1::pair<unsigned int, unsigned int>, bool>> = {<No data fields>}, <No data fields>}, <No data fields>},
          __first_ = 0}, <No data fields>}}}}
        Monarch = {<singleton<CMonarch>> = {_vptr$singleton = 0x52dc10, static ms_singleton = <optimized out>},
  m_map_MonarchElection = {__tree_ = {__begin_node_ = 0x7fffffffe148,
      __pair1_ = {<std::__1::__libcpp_compressed_pair_imp<std::__1::__tree_end_node<std::__1::__tree_node_base<void *> *>, std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, TMonarchElectionInfo *>, void *> >, 2>> = {<std::__1::allocator<std::__1::__tree_node<std::__1::__value_type<unsigned int, TMonarchElectionInfo *>, void *> >> = {<No data fields>}, __first_ = {__left_ = 0x0}}, <No data fields>},
      __pair3_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, TMonarchElectionInfo *>, std::__1::less<unsigned int>, true>, 2>> = {<std::__1::__map_value_compare<unsigned int, std::__1::__value_type<unsigned int, TMonarchElectionInfo *>, std::__1::less<unsigned int>, true>> = {<std::__1::less<unsigned int>> = {<std::__1::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}, <No data fields>}, __first_ = 0}, <No data fields>}}},
  m_vec_MonarchCandidacy = {<std::__1::__vector_base<tMonarchCandidacy, std::__1::allocator<tMonarchCandidacy> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<tMonarchCandidacy *, std::__1::allocator<tMonarchCandidacy>, 2>> = {<std::__1::allocator<tMonarchCandidacy>> = {<No data fields>},
          __first_ = 0x0}, <No data fields>}}, <No data fields>}, m_MonarchInfo = {pid = 0x7fffffffe170,
    money = 0x7fffffffe180, name = 0x7fffffffe1a0, date = 0x7fffffffe220}}
        BlockCountry = {<singleton<CBlockCountry>> = {_vptr$singleton = 0x528260,
    static ms_singleton = <optimized out>},
  m_block_ip = {<std::__1::__vector_base<CBlockCountry::BLOCK_IP *, std::__1::allocator<CBlockCountry::BLOCK_IP *> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<CBlockCountry::BLOCK_IP **, std::__1::allocator<CBlockCountry::BLOCK_IP *>, 2>> = {<std::__1::allocator<CBlockCountry::BLOCK_IP *>> = {<No data fields>},
          __first_ = 0x0}, <No data fields>}}, <No data fields>},
  m_block_exception = {<std::__1::__vector_base<const char *, std::__1::allocator<const char *> >> = {<std::__1::__vector_base_common<true>> = {<No data fields>}, __begin_ = 0x0, __end_ = 0x0,
      __end_cap_ = {<std::__1::__libcpp_compressed_pair_imp<const char **, std::__1::allocator<const char *>, 2>> = {<std::__1::allocator<const char *>> = {<No data fields>},
          __first_ = 0x0}, <No data fields>}}, <No data fields>}}
        ItemIDRangeManager = {<singleton<CItemIDRangeManager>> = {_vptr$singleton = 0x530fd8,
    static ms_singleton = <optimized out>}, static cs_dwMaxItemID = <optimized out>,
  static cs_dwMinimumRange = <optimized out>, static cs_dwMinimumRemainCount = <optimized out>,
  m_listData = {<std::__1::__list_imp<tItemIDRange, std::__1::allocator<tItemIDRange> >> = {__end_ = {
        __prev_ = 0x7fffffffe0e8, __next_ = 0x7fffffffe0e8},
      __size_alloc_ = {<std::__1::__libcpp_compressed_pair_imp<unsigned long, std::__1::allocator<std::__1::__list_node<tItemIDRange, void *> >, 2>> = {<std::__1::allocator<std::__1::__list_node<tItemIDRange, void *> >> = {<No dat---Type <return> to continue, or q <return> to quit---
a fields>}, __first_ = 0}, <No data fields>}}, <No data fields>}}
        iCount = 7860704

 

Log:

Spoiler

SYSERR: Aug 11 12:36:36 :: Start: TABLE_POSTFIX not configured use default
Aug 11 12:36:36 :: connecting to MySQL server (player)
Aug 11 12:36:36 :: CREATING DIRECT_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING MAIN_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING ASYNC_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 ::    OK
Aug 11 12:36:36 :: connecting to MySQL server (account)
Aug 11 12:36:36 :: CREATING DIRECT_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING MAIN_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING ASYNC_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 ::    OK
Aug 11 12:36:36 :: connecting to MySQL server (common)
Aug 11 12:36:36 :: CREATING DIRECT_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING MAIN_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING ASYNC_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 ::    OK
Aug 11 12:36:36 :: connecting to MySQL server (hotbackup)
Aug 11 12:36:36 :: CREATING DIRECT_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING MAIN_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 :: CREATING ASYNC_SQL
Aug 11 12:36:36 :: AsyncSQL: locale latin1
Aug 11 12:36:36 ::    OK
Aug 11 12:36:36 :: ClientManager initialization.. 
Aug 11 12:36:36 :: InitializeLocalization() - LoadLocaleTable(count:13)
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE0)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE1)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE2)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE3)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE4)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE5)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE6)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL_TYPE7)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: locale[LOCALE] = singapore
Aug 11 12:36:36 :: Changed g_stLocale latin1 to latin1
Aug 11 12:36:36 :: SetLocale start
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 ::     --mysql_set_character_set(latin1)
Aug 11 12:36:36 :: End setlocale latin1
Aug 11 12:36:36 :: locale[DB_NAME_COLUMN] = locale_name
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_DAMAGE_BY_LEVEL_UNDER_90)] = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_DAMAGE_BY_LEVEL_UNDER_45)] = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Aug 11 12:36:36 :: locale[UNKNOWN_KEY(SKILL_POWER_BY_LEVEL)] = 0 5 6 8 10 12 14 16 18 20 22 24
Aug 11 12:36:36 :: GetParam 10000001
Aug 11 12:36:36 :: GetParam 20000000
Aug 11 12:36:36 :: ItemRange From File 10000001 ~ 20000000 
Aug 11 12:36:36 :: ItemIDRange: Build: 10000001 ~ 20000000 start:10002002
Aug 11 12:36:36 ::  Init Success Start 10000001 End 20000000 Now 10002002

Aug 11 12:36:36 :: libdb::CheckItemTable: Sanity check for vnum_range is OK!
Aug 11 12:36:36 :: SHOP: #1 items: 8
Aug 11 12:36:36 :: SHOP: #2 items: 7
Aug 11 12:36:36 :: SHOP: #3 items: 25
Aug 11 12:36:36 :: SHOP: #4 items: 17
Aug 11 12:36:36 :: SHOP: #5 items: 12
Aug 11 12:36:36 :: SHOP: #6 items: 24
Aug 11 12:36:36 :: SHOP: #7 items: 5
Aug 11 12:36:36 :: SHOP: #8 items: 6
Aug 11 12:36:36 :: SHOP: #9 items: 8
Aug 11 12:36:36 :: SHOP: #10 items: 1
Aug 11 12:36:36 :: SHOP: #11 items: 3
Aug 11 12:36:36 :: SHOP: #1001 items: 13
Aug 11 12:36:36 :: SHOP: #1002 items: 13
Aug 11 12:36:36 :: SHOP: #1003 items: 15
Aug 11 12:36:36 :: SHOP: #1004 items: 13
Aug 11 12:36:36 :: SHOP: #1005 items: 9
Aug 11 12:36:36 :: SHOP: #1006 items: 13
Aug 11 12:36:36 :: SHOP: #1007 items: 7
Aug 11 12:36:36 :: SHOP: #1008 items: 7
Aug 11 12:36:36 :: SHOP: #1009 items: 7
Aug 11 12:36:36 :: SHOP: #1010 items: 7
Aug 11 12:36:36 :: SHOP: #1011 items: 3
Aug 11 12:36:36 :: SHOP: #1012 items: 3
Aug 11 12:36:36 :: SHOP: #1013 items: 3
Aug 11 12:36:36 :: SHOP: #1014 items: 3
Aug 11 12:36:36 :: SHOP: #1015 items: 2
Aug 11 12:36:36 :: SHOP: #1016 items: 11
Aug 11 12:36:36 :: SHOP: #1017 items: 12
Aug 11 12:36:36 :: SHOP: #1018 items: 11
Aug 11 12:36:36 :: SHOP: #1019 items: 11
Aug 11 12:36:36 :: SKILL: #1 »ï¿¬Âü flag 3 point HP affect 0 cooldown 12
Aug 11 12:36:36 :: SKILL: #2 Æȹædz¿ì flag 3 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #3 Àü±ÍÈ¥ flag 8 point ATT_SPEED affect 15 cooldown 63+90*k
Aug 11 12:36:36 :: SKILL: #4 °Ë°æ flag 8 point ATT_GRADE affect 16 cooldown 33+50*k
Aug 11 12:36:36 :: SKILL: #5 źȯ°Ý flag 524419 point HP affect 0 cooldown 12
Aug 11 12:36:36 :: SKILL: #16 ±â°øÂü flag 3 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #17 °Ý»êŸ¿ì flag 3 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #18 ´ëÁø°¢ flag 8331 point HP affect 0 cooldown 25
Aug 11 12:36:36 :: SKILL: #19 õ±ÙÃß flag 8 point DEF_GRADE affect 17 cooldown 63+90*k
Aug 11 12:36:36 :: SKILL: #20 °Ëdz flag 524419 point HP affect 0 cooldown 20
Aug 11 12:36:36 :: SKILL: #31 ¾Ï½À flag 3 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #32 ±Ã½Åź¿µ flag 3 point HP affect 0 cooldown 20
Aug 11 12:36:36 :: SKILL: #33 Â÷·û»ì flag 1048579 point HP affect 0 cooldown 25
Aug 11 12:36:36 :: SKILL: #34 ÀºÇü¹ý flag 8 point NONE affect 19 cooldown 60
Aug 11 12:36:36 :: SKILL: #35 »ê°øºÐ flag 1048707 point HP affect 0 cooldown 25
Aug 11 12:36:36 :: SKILL: #46 ¿¬»ç flag 513 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #47 °ü°Ý¼ú flag 513 point HP affect 0 cooldown 12
Aug 11 12:36:36 :: SKILL: #48 È­Á¶ÆÄ flag 641 point HP affect 0 cooldown 25
Aug 11 12:36:36 :: SKILL: #49 °æ°ø¼ú flag 8 point MOV_SPEED affect 18 cooldown 30+30*k
Aug 11 12:36:36 :: SKILL: #50 µ¶±â±Ã flag 1573505 point HP affect 0 cooldown 25
Aug 11 12:36:36 :: SKILL: #61 ¼â·ÉÁö flag 1027 point HP affect 0 cooldown 10
Aug 11 12:36:36 :: SKILL: #62 ¿ë±ÇÆÄ flag 2187 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #63 ±Í°Ë flag 2097160 point ATT_GRADE affect 20 cooldown 0
Aug 11 12:36:36 :: SKILL: #64 °øÆ÷ flag 8 point DODGE affect 21 cooldown 100
Aug 11 12:36:36 :: SKILL: #65 ÁÖ¸¶°© flag 8 point DEF_GRADE affect 22 cooldown 33+140*k
Aug 11 12:36:36 :: SKILL: #66 ÆĹý¼ú flag 262337 point HP affect 0 cooldown 12
Aug 11 12:36:36 :: SKILL: #76 ¸¶·É flag 193 point HP affect 0 cooldown 7
Aug 11 12:36:36 :: SKILL: #77 È­¿°Æø flag 201 point HP affect 0 cooldown 12
Aug 11 12:36:36 :: SKILL: #78 ¹«¿µÁø flag 2097345 point HP affect 0 cooldown 43+30*k
Aug 11 12:36:36 :: SKILL: #79 Èæ½Å¼öÈ£ flag 2097160 point DEF_GRADE affect 26 cooldown 63+120*k
Aug 11 12:36:36 :: SKILL: #80 Åõ¼Ó¸¶·É flag 4289 point HP affect 0 cooldown 12
Aug 11 12:36:36 :: SKILL: #81 ¸¶È¯°Ý flag 193 point HP affect 0 cooldown 24
Aug 11 12:36:36 :: SKILL: #91 ºñÆĺΠflag 193 point HP affect 0 cooldown 7
Aug 11 12:36:36 :: SKILL: #92 ¿ëÆÄ»ê flag 65537 point HP affect 0 cooldown 8
Aug 11 12:36:36 :: SKILL: #93 ÆзæÆø flag 65673 point HP affect 0 cooldown 20
Aug 11 12:36:36 :: SKILL: #94 È£½Å flag 0 point RESIST_NORMAL affect 23 cooldown 10
Aug 11 12:36:36 :: SKILL: #95 ¹Ý»ç flag 0 point REFLECT_MELEE affect 24 cooldown 10
Aug 11 12:36:36 :: SKILL: #96 ±âõ´ë°ø flag 0 point CRITICAL affect 30 cooldown 10
Aug 11 12:36:36 :: SKILL: #106 ³úÀü·É flag 129 point HP affect 0 cooldown 7
Aug 11 12:36:36 :: SKILL: #107 º­¶ô flag 8321 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #108 Æø·Ú°Ý flag 1 point HP affect 0 cooldown 10
Aug 11 12:36:36 :: SKILL: #109 Á¤¾÷ÀÎ flag 131072 point HP affect 0 cooldown 10
Aug 11 12:36:36 :: SKILL: #110 Äè¼Ó flag 0 point MOV_SPEED affect 25 cooldown 10
Aug 11 12:36:36 :: SKILL: #111 Áõ·Â¼ú flag 0 point ATT_GRADE affect 31 cooldown 10
Aug 11 12:36:36 :: SKILL: #121 Åë¼Ö·Â flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #122 ¿¬°è±â flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #124 䱤¼ú flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #125 º¯½Å flag 4194304 point NONE affect 1 cooldown 
Aug 11 12:36:36 :: SKILL: #126 ½Å¼ö¾î flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #127 õÁ¶¾î flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #128 Áø³ë¾î flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #129 µÐ°©¼ú flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #130 ½Â¸¶ flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #131 ¸»¼Òȯ flag 4194304 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #137 ³­¹« flag 524291 point HP affect 0 cooldown 5-(4*k)
Aug 11 12:36:36 :: SKILL: #138 µ¹°Ý flag 8388739 point HP affect 0 cooldown 15
Aug 11 12:36:36 :: SKILL: #139 Å»Ãâ flag 524427 point HP affect 0 cooldown 20
Aug 11 12:36:36 :: SKILL: #140 ³­¹«(È°) flag 524801 point HP affect 0 cooldown 10
Aug 11 12:36:36 :: SKILL: #151 ¿ë¾È flag 0 point NONE affect 0 cooldown 
Aug 11 12:36:36 :: SKILL: #152 ¿ë½ÅÀÇÇÇ flag 0 point MAX_HP affect 0 cooldown 600
Aug 11 12:36:36 :: SKILL: #153 ¿ë½ÅÀÇÃູ flag 0 point MAX_SP affect 0 cooldown 600
Aug 11 12:36:36 :: SKILL: #154 ¼ºÈÖ°© flag 0 point DEF_GRADE affect 0 cooldown 480
Aug 11 12:36:36 :: SKILL: #155 °¡¼ÓÈ­ flag 0 point MOV_SPEED affect 0 cooldown 480
Aug 11 12:36:36 :: SKILL: #156 ¿ë½ÅÀǺгë flag 8 point CRITICAL affect 0 cooldown 480
Aug 11 12:36:36 :: SKILL: #157 ÁÖ¹®¼ú flag 8 point CASTING_SPEED affect 0 cooldown 480
Aug 11 12:36:36 :: REFINE: id 1 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 2 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 3 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 4 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 5 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 6 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 7 cost 30000 prob 70 mat1 30053 cnt1 1
Aug 11 12:36:36 :: REFINE: id 8 cost 45000 prob 70 mat1 30073 cnt1 2
Aug 11 12:36:36 :: REFINE: id 9 cost 75000 prob 70 mat1 30033 cnt1 2
Aug 11 12:36:36 :: REFINE: id 10 cost 1000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 11 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 12 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 13 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 14 cost 13000 prob 70 mat1 30030 cnt1 2
Aug 11 12:36:36 :: REFINE: id 15 cost 20000 prob 70 mat1 30075 cnt1 2
Aug 11 12:36:36 :: REFINE: id 16 cost 40000 prob 70 mat1 30056 cnt1 2
Aug 11 12:36:36 :: REFINE: id 17 cost 70000 prob 70 mat1 30022 cnt1 2
Aug 11 12:36:36 :: REFINE: id 18 cost 120000 prob 70 mat1 30067 cnt1 2
Aug 11 12:36:36 :: REFINE: id 19 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 20 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 21 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 22 cost 10000 prob 60 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 23 cost 20000 prob 70 mat1 30079 cnt1 1
Aug 11 12:36:36 :: REFINE: id 24 cost 30000 prob 70 mat1 30015 cnt1 1
Aug 11 12:36:36 :: REFINE: id 25 cost 45000 prob 70 mat1 30016 cnt1 2
Aug 11 12:36:36 :: REFINE: id 26 cost 90000 prob 70 mat1 30089 cnt1 2
Aug 11 12:36:36 :: REFINE: id 27 cost 150000 prob 70 mat1 30091 cnt1 2
Aug 11 12:36:36 :: REFINE: id 28 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 29 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 30 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 31 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 32 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 33 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 34 cost 30000 prob 70 mat1 30034 cnt1 2
Aug 11 12:36:36 :: REFINE: id 35 cost 45000 prob 70 mat1 30011 cnt1 2
Aug 11 12:36:36 :: REFINE: id 36 cost 75000 prob 70 mat1 30035 cnt1 2
Aug 11 12:36:36 :: REFINE: id 37 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 38 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 39 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 40 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 41 cost 13000 prob 70 mat1 30052 cnt1 2
Aug 11 12:36:36 :: REFINE: id 42 cost 20000 prob 70 mat1 30046 cnt1 2
Aug 11 12:36:36 :: REFINE: id 43 cost 40000 prob 70 mat1 30045 cnt1 2
Aug 11 12:36:36 :: REFINE: id 44 cost 70000 prob 70 mat1 30025 cnt1 2
Aug 11 12:36:36 :: REFINE: id 45 cost 120000 prob 70 mat1 30058 cnt1 2
Aug 11 12:36:36 :: REFINE: id 46 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 47 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 48 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 49 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 50 cost 20000 prob 70 mat1 30083 cnt1 2
Aug 11 12:36:36 :: REFINE: id 51 cost 30000 prob 70 mat1 30060 cnt1 2
Aug 11 12:36:36 :: REFINE: id 52 cost 45000 prob 70 mat1 30061 cnt1 2
Aug 11 12:36:36 :: REFINE: id 53 cost 90000 prob 70 mat1 30088 cnt1 2
Aug 11 12:36:36 :: REFINE: id 54 cost 150000 prob 70 mat1 30019 cnt1 2
Aug 11 12:36:36 :: REFINE: id 55 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 56 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 57 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 58 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 59 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 60 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 61 cost 30000 prob 70 mat1 30070 cnt1 2
Aug 11 12:36:36 :: REFINE: id 62 cost 45000 prob 70 mat1 30072 cnt1 2
Aug 11 12:36:36 :: REFINE: id 63 cost 75000 prob 70 mat1 30017 cnt1 2
Aug 11 12:36:36 :: REFINE: id 64 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 65 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 66 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 67 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 68 cost 13000 prob 70 mat1 30041 cnt1 1
Aug 11 12:36:36 :: REFINE: id 69 cost 20000 prob 70 mat1 30008 cnt1 2
Aug 11 12:36:36 :: REFINE: id 70 cost 40000 prob 70 mat1 30057 cnt1 1
Aug 11 12:36:36 :: REFINE: id 71 cost 70000 prob 70 mat1 30081 cnt1 1
Aug 11 12:36:36 :: REFINE: id 72 cost 120000 prob 70 mat1 30077 cnt1 2
Aug 11 12:36:36 :: REFINE: id 73 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 74 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 75 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 76 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 77 cost 20000 prob 70 mat1 30009 cnt1 2
Aug 11 12:36:36 :: REFINE: id 78 cost 30000 prob 70 mat1 30039 cnt1 2
Aug 11 12:36:36 :: REFINE: id 79 cost 45000 prob 70 mat1 30040 cnt1 2
Aug 11 12:36:36 :: REFINE: id 80 cost 90000 prob 70 mat1 30048 cnt1 2
Aug 11 12:36:36 :: REFINE: id 81 cost 150000 prob 70 mat1 30090 cnt1 2
Aug 11 12:36:36 :: REFINE: id 82 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 83 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 84 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 85 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 86 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 87 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 88 cost 30000 prob 70 mat1 30031 cnt1 1
Aug 11 12:36:36 :: REFINE: id 89 cost 45000 prob 70 mat1 30032 cnt1 2
Aug 11 12:36:36 :: REFINE: id 90 cost 75000 prob 70 mat1 30033 cnt1 2
Aug 11 12:36:36 :: REFINE: id 91 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 92 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 93 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 94 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 95 cost 13000 prob 70 mat1 30008 cnt1 2
Aug 11 12:36:36 :: REFINE: id 96 cost 20000 prob 70 mat1 30075 cnt1 2
Aug 11 12:36:36 :: REFINE: id 97 cost 40000 prob 70 mat1 30006 cnt1 2
Aug 11 12:36:36 :: REFINE: id 98 cost 70000 prob 70 mat1 30022 cnt1 1
Aug 11 12:36:36 :: REFINE: id 99 cost 120000 prob 70 mat1 30067 cnt1 2
Aug 11 12:36:36 :: REFINE: id 100 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 101 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 102 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 103 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 104 cost 20000 prob 70 mat1 30079 cnt1 1
Aug 11 12:36:36 :: REFINE: id 105 cost 30000 prob 70 mat1 30015 cnt1 1
Aug 11 12:36:36 :: REFINE: id 106 cost 45000 prob 70 mat1 30086 cnt1 2
Aug 11 12:36:36 :: REFINE: id 107 cost 90000 prob 70 mat1 30050 cnt1 2
Aug 11 12:36:36 :: REFINE: id 108 cost 150000 prob 70 mat1 30091 cnt1 2
Aug 11 12:36:36 :: REFINE: id 109 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 110 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 111 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 112 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 113 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 114 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 115 cost 30000 prob 70 mat1 30071 cnt1 2
Aug 11 12:36:36 :: REFINE: id 116 cost 45000 prob 70 mat1 30018 cnt1 2
Aug 11 12:36:36 :: REFINE: id 117 cost 75000 prob 70 mat1 30017 cnt1 2
Aug 11 12:36:36 :: REFINE: id 118 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 119 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 120 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 121 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 122 cost 13000 prob 70 mat1 30005 cnt1 2
Aug 11 12:36:36 :: REFINE: id 123 cost 20000 prob 70 mat1 30076 cnt1 2
Aug 11 12:36:36 :: REFINE: id 124 cost 40000 prob 70 mat1 30051 cnt1 1
Aug 11 12:36:36 :: REFINE: id 125 cost 70000 prob 70 mat1 30081 cnt1 1
Aug 11 12:36:36 :: REFINE: id 126 cost 120000 prob 70 mat1 30047 cnt1 2
Aug 11 12:36:36 :: REFINE: id 127 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 128 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 129 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 130 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 131 cost 20000 prob 70 mat1 30009 cnt1 1
Aug 11 12:36:36 :: REFINE: id 132 cost 30000 prob 70 mat1 30080 cnt1 1
Aug 11 12:36:36 :: REFINE: id 133 cost 45000 prob 70 mat1 30040 cnt1 2
Aug 11 12:36:36 :: REFINE: id 134 cost 90000 prob 70 mat1 30049 cnt1 2
Aug 11 12:36:36 :: REFINE: id 135 cost 150000 prob 70 mat1 30090 cnt1 2
Aug 11 12:36:36 :: REFINE: id 136 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 137 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 138 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 139 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 140 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 141 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 142 cost 30000 prob 70 mat1 30038 cnt1 1
Aug 11 12:36:36 :: REFINE: id 143 cost 45000 prob 70 mat1 30023 cnt1 2
Aug 11 12:36:36 :: REFINE: id 144 cost 75000 prob 70 mat1 30074 cnt1 2
Aug 11 12:36:36 :: REFINE: id 145 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 146 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 147 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 148 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 149 cost 13000 prob 70 mat1 30007 cnt1 2
Aug 11 12:36:36 :: REFINE: id 150 cost 20000 prob 70 mat1 30078 cnt1 2
Aug 11 12:36:36 :: REFINE: id 151 cost 40000 prob 70 mat1 30045 cnt1 2
Aug 11 12:36:36 :: REFINE: id 152 cost 70000 prob 70 mat1 30055 cnt1 2
Aug 11 12:36:36 :: REFINE: id 153 cost 120000 prob 70 mat1 30047 cnt1 2
Aug 11 12:36:36 :: REFINE: id 154 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 155 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 156 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 157 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 158 cost 20000 prob 70 mat1 30059 cnt1 2
Aug 11 12:36:36 :: REFINE: id 159 cost 30000 prob 70 mat1 30080 cnt1 2
Aug 11 12:36:36 :: REFINE: id 160 cost 45000 prob 70 mat1 30085 cnt1 2
Aug 11 12:36:36 :: REFINE: id 161 cost 90000 prob 70 mat1 30014 cnt1 2
Aug 11 12:36:36 :: REFINE: id 162 cost 150000 prob 70 mat1 30042 cnt1 2
Aug 11 12:36:36 :: REFINE: id 163 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 164 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 165 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 166 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 167 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 168 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 169 cost 30000 prob 70 mat1 30010 cnt1 2
Aug 11 12:36:36 :: REFINE: id 170 cost 45000 prob 70 mat1 30031 cnt1 1
Aug 11 12:36:36 :: REFINE: id 171 cost 75000 prob 70 mat1 30032 cnt1 2
Aug 11 12:36:36 :: REFINE: id 172 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 173 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 174 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 175 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 176 cost 13000 prob 70 mat1 30021 cnt1 2
Aug 11 12:36:36 :: REFINE: id 177 cost 20000 prob 70 mat1 30008 cnt1 2
Aug 11 12:36:36 :: REFINE: id 178 cost 40000 prob 70 mat1 30057 cnt1 2
Aug 11 12:36:36 :: REFINE: id 179 cost 70000 prob 70 mat1 30006 cnt1 2
Aug 11 12:36:36 :: REFINE: id 180 cost 120000 prob 70 mat1 30022 cnt1 2
Aug 11 12:36:36 :: REFINE: id 181 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 182 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 183 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 184 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 185 cost 20000 prob 70 mat1 30082 cnt1 2
Aug 11 12:36:36 :: REFINE: id 186 cost 30000 prob 70 mat1 30079 cnt1 2
Aug 11 12:36:36 :: REFINE: id 187 cost 45000 prob 70 mat1 30087 cnt1 2
Aug 11 12:36:36 :: REFINE: id 188 cost 90000 prob 70 mat1 30086 cnt1 2
Aug 11 12:36:36 :: REFINE: id 189 cost 150000 prob 70 mat1 30050 cnt1 2
Aug 11 12:36:36 :: REFINE: id 190 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 191 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 192 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 193 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 194 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 195 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 196 cost 30000 prob 70 mat1 30038 cnt1 2
Aug 11 12:36:36 :: REFINE: id 197 cost 45000 prob 70 mat1 30011 cnt1 2
Aug 11 12:36:36 :: REFINE: id 198 cost 75000 prob 70 mat1 30074 cnt1 1
Aug 11 12:36:36 :: REFINE: id 199 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 200 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 201 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 202 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 203 cost 13000 prob 70 mat1 30007 cnt1 2
Aug 11 12:36:36 :: REFINE: id 204 cost 20000 prob 70 mat1 30046 cnt1 2
Aug 11 12:36:36 :: REFINE: id 205 cost 40000 prob 70 mat1 30045 cnt1 2
Aug 11 12:36:36 :: REFINE: id 206 cost 70000 prob 70 mat1 30055 cnt1 2
Aug 11 12:36:36 :: REFINE: id 207 cost 120000 prob 70 mat1 30058 cnt1 2
Aug 11 12:36:36 :: REFINE: id 208 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 209 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 210 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 211 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 212 cost 20000 prob 70 mat1 30059 cnt1 2
Aug 11 12:36:36 :: REFINE: id 213 cost 30000 prob 70 mat1 30060 cnt1 2
Aug 11 12:36:36 :: REFINE: id 214 cost 45000 prob 70 mat1 30061 cnt1 2
Aug 11 12:36:36 :: REFINE: id 215 cost 90000 prob 70 mat1 30014 cnt1 2
Aug 11 12:36:36 :: REFINE: id 216 cost 150000 prob 70 mat1 30042 cnt1 2
Aug 11 12:36:36 :: REFINE: id 217 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 218 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 219 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 220 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 221 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 222 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 223 cost 30000 prob 70 mat1 30071 cnt1 2
Aug 11 12:36:36 :: REFINE: id 224 cost 45000 prob 70 mat1 30023 cnt1 1
Aug 11 12:36:36 :: REFINE: id 225 cost 75000 prob 70 mat1 30074 cnt1 2
Aug 11 12:36:36 :: REFINE: id 226 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 227 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 228 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 229 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 230 cost 13000 prob 70 mat1 30005 cnt1 1
Aug 11 12:36:36 :: REFINE: id 231 cost 20000 prob 70 mat1 30078 cnt1 1
Aug 11 12:36:36 :: REFINE: id 232 cost 40000 prob 70 mat1 30051 cnt1 1
Aug 11 12:36:36 :: REFINE: id 233 cost 70000 prob 70 mat1 30055 cnt1 2
Aug 11 12:36:36 :: REFINE: id 234 cost 120000 prob 70 mat1 30047 cnt1 2
Aug 11 12:36:36 :: REFINE: id 235 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 236 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 237 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 238 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 239 cost 20000 prob 70 mat1 30059 cnt1 2
Aug 11 12:36:36 :: REFINE: id 240 cost 30000 prob 70 mat1 30080 cnt1 2
Aug 11 12:36:36 :: REFINE: id 241 cost 45000 prob 70 mat1 30085 cnt1 2
Aug 11 12:36:36 :: REFINE: id 242 cost 90000 prob 70 mat1 30049 cnt1 2
Aug 11 12:36:36 :: REFINE: id 243 cost 150000 prob 70 mat1 30042 cnt1 2
Aug 11 12:36:36 :: REFINE: id 244 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 245 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 246 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 247 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 248 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 249 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 250 cost 30000 prob 70 mat1 30070 cnt1 2
Aug 11 12:36:36 :: REFINE: id 251 cost 45000 prob 70 mat1 30018 cnt1 2
Aug 11 12:36:36 :: REFINE: id 252 cost 75000 prob 70 mat1 30017 cnt1 2
Aug 11 12:36:36 :: REFINE: id 253 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 254 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 255 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 256 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 257 cost 13000 prob 70 mat1 30041 cnt1 2
Aug 11 12:36:36 :: REFINE: id 258 cost 20000 prob 70 mat1 30076 cnt1 2
Aug 11 12:36:36 :: REFINE: id 259 cost 40000 prob 70 mat1 30051 cnt1 2
Aug 11 12:36:36 :: REFINE: id 260 cost 70000 prob 70 mat1 30081 cnt1 2
Aug 11 12:36:36 :: REFINE: id 261 cost 120000 prob 70 mat1 30077 cnt1 2
Aug 11 12:36:36 :: REFINE: id 262 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 263 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 264 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 265 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 266 cost 20000 prob 70 mat1 30009 cnt1 2
Aug 11 12:36:36 :: REFINE: id 267 cost 30000 prob 70 mat1 30039 cnt1 2
Aug 11 12:36:36 :: REFINE: id 268 cost 45000 prob 70 mat1 30040 cnt1 2
Aug 11 12:36:36 :: REFINE: id 269 cost 90000 prob 70 mat1 30048 cnt1 2
Aug 11 12:36:36 :: REFINE: id 270 cost 150000 prob 70 mat1 30090 cnt1 2
Aug 11 12:36:36 :: REFINE: id 271 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 272 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 273 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 274 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 275 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 276 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 277 cost 30000 prob 70 mat1 30010 cnt1 1
Aug 11 12:36:36 :: REFINE: id 278 cost 45000 prob 70 mat1 30072 cnt1 2
Aug 11 12:36:36 :: REFINE: id 279 cost 75000 prob 70 mat1 30032 cnt1 1
Aug 11 12:36:36 :: REFINE: id 280 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 281 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 282 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 283 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 284 cost 13000 prob 70 mat1 30021 cnt1 1
Aug 11 12:36:36 :: REFINE: id 285 cost 20000 prob 70 mat1 30008 cnt1 1
Aug 11 12:36:36 :: REFINE: id 286 cost 40000 prob 70 mat1 30057 cnt1 1
Aug 11 12:36:36 :: REFINE: id 287 cost 70000 prob 70 mat1 30006 cnt1 2
Aug 11 12:36:36 :: REFINE: id 288 cost 120000 prob 70 mat1 30077 cnt1 2
Aug 11 12:36:36 :: REFINE: id 289 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 290 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 291 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 292 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 293 cost 20000 prob 70 mat1 30082 cnt1 2
Aug 11 12:36:36 :: REFINE: id 294 cost 30000 prob 70 mat1 30039 cnt1 2
Aug 11 12:36:36 :: REFINE: id 295 cost 45000 prob 70 mat1 30087 cnt1 2
Aug 11 12:36:36 :: REFINE: id 296 cost 90000 prob 70 mat1 30086 cnt1 2
Aug 11 12:36:36 :: REFINE: id 297 cost 150000 prob 70 mat1 30050 cnt1 2
Aug 11 12:36:36 :: REFINE: id 298 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 299 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 300 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 301 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 302 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 303 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 304 cost 30000 prob 70 mat1 30053 cnt1 1
Aug 11 12:36:36 :: REFINE: id 305 cost 45000 prob 70 mat1 30073 cnt1 1
Aug 11 12:36:36 :: REFINE: id 306 cost 75000 prob 70 mat1 30035 cnt1 2
Aug 11 12:36:36 :: REFINE: id 307 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 308 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 309 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 310 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 311 cost 13000 prob 70 mat1 30030 cnt1 2
Aug 11 12:36:36 :: REFINE: id 312 cost 20000 prob 70 mat1 30075 cnt1 2
Aug 11 12:36:36 :: REFINE: id 313 cost 40000 prob 70 mat1 30056 cnt1 2
Aug 11 12:36:36 :: REFINE: id 314 cost 70000 prob 70 mat1 30025 cnt1 2
Aug 11 12:36:36 :: REFINE: id 315 cost 120000 prob 70 mat1 30067 cnt1 2
Aug 11 12:36:36 :: REFINE: id 316 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 317 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 318 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 319 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 320 cost 20000 prob 70 mat1 30083 cnt1 2
Aug 11 12:36:36 :: REFINE: id 321 cost 30000 prob 70 mat1 30015 cnt1 2
Aug 11 12:36:36 :: REFINE: id 322 cost 45000 prob 70 mat1 30016 cnt1 2
Aug 11 12:36:36 :: REFINE: id 323 cost 90000 prob 70 mat1 30089 cnt1 2
Aug 11 12:36:36 :: REFINE: id 324 cost 150000 prob 70 mat1 30019 cnt1 2
Aug 11 12:36:36 :: REFINE: id 325 cost 600 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 326 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 327 cost 2500 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 328 cost 5000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 329 cost 10000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 330 cost 20000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 331 cost 30000 prob 70 mat1 30034 cnt1 2
Aug 11 12:36:36 :: REFINE: id 332 cost 45000 prob 70 mat1 30073 cnt1 2
Aug 11 12:36:36 :: REFINE: id 333 cost 75000 prob 70 mat1 30035 cnt1 2
Aug 11 12:36:36 :: REFINE: id 334 cost 1000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 335 cost 2000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 336 cost 4000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 337 cost 8000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 338 cost 13000 prob 70 mat1 30052 cnt1 2
Aug 11 12:36:36 :: REFINE: id 339 cost 20000 prob 70 mat1 30046 cnt1 2
Aug 11 12:36:36 :: REFINE: id 340 cost 40000 prob 70 mat1 30056 cnt1 2
Aug 11 12:36:36 :: REFINE: id 341 cost 70000 prob 70 mat1 30025 cnt1 2
Aug 11 12:36:36 :: REFINE: id 342 cost 120000 prob 70 mat1 30058 cnt1 2
Aug 11 12:36:36 :: REFINE: id 343 cost 1200 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 344 cost 2500 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 345 cost 5000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 346 cost 10000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 347 cost 20000 prob 70 mat1 30083 cnt1 2
Aug 11 12:36:36 :: REFINE: id 348 cost 30000 prob 70 mat1 30060 cnt1 2
Aug 11 12:36:36 :: REFINE: id 349 cost 45000 prob 70 mat1 30061 cnt1 2
Aug 11 12:36:36 :: REFINE: id 350 cost 90000 prob 70 mat1 30088 cnt1 2
Aug 11 12:36:36 :: REFINE: id 351 cost 150000 prob 70 mat1 30019 cnt1 2
Aug 11 12:36:36 :: REFINE: id 352 cost 3000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 353 cost 6000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 354 cost 12000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 355 cost 25000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 356 cost 40000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 357 cost 60000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 358 cost 90000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 359 cost 120000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 360 cost 150000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 501 cost 100000 prob 100 mat1 25040 cnt1 2
Aug 11 12:36:36 :: REFINE: id 502 cost 120000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 503 cost 140000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 504 cost 170000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 505 cost 200000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 506 cost 240000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 507 cost 290000 prob 70 mat1 30050 cnt1 2
Aug 11 12:36:36 :: REFINE: id 508 cost 340000 prob 70 mat1 30083 cnt1 2
Aug 11 12:36:36 :: REFINE: id 509 cost 410000 prob 70 mat1 30040 cnt1 2
Aug 11 12:36:36 :: REFINE: id 510 cost 500000 prob 70 mat1 30089 cnt1 2
Aug 11 12:36:36 :: REFINE: id 701 cost 500000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 702 cost 2000000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1003 cost 3000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1001 cost 1000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1002 cost 2000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1005 cost 5000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1004 cost 4000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1006 cost 6000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1007 cost 7000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1008 cost 8000 prob 95 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1009 cost 9000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1010 cost 50000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1011 cost 2000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1012 cost 4000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1013 cost 6000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1014 cost 8000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1015 cost 10000 prob 95 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1016 cost 12000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1017 cost 14000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1018 cost 16000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1019 cost 18000 prob 75 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1020 cost 75000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1021 cost 4000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1022 cost 6000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1023 cost 8000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1024 cost 10000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1025 cost 12000 prob 95 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1026 cost 14000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1027 cost 16000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1028 cost 18000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1029 cost 20000 prob 75 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1030 cost 12000 prob 55 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1031 cost 14000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1032 cost 16000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1033 cost 18000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1034 cost 20000 prob 75 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1035 cost 22000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1036 cost 24000 prob 65 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1037 cost 26000 prob 60 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1038 cost 28000 prob 55 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1039 cost 30000 prob 50 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1040 cost 49000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1041 cost 52000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1042 cost 55000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1043 cost 58000 prob 100 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1044 cost 61000 prob 95 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1045 cost 64000 prob 95 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1046 cost 67000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1047 cost 70000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1048 cost 73000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1049 cost 76000 prob 75 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1050 cost 80000 prob 70 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1051 cost 82000 prob 90 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1052 cost 84000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1053 cost 86000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1054 cost 88000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1055 cost 90000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1056 cost 92000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1057 cost 94000 prob 85 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1058 cost 96000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1059 cost 98000 prob 80 mat1 0 cnt1 0
Aug 11 12:36:36 :: REFINE: id 1060 cost 100000 prob 50 mat1 0 cnt1 0
Aug 11 12:36:36 :: ITEM_ATTR: MAX_HP                  1 { 2000 2000 3000 3500 3500 } { 0 5 5 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: MAX_SP                  1 { 200 400 800 1000 1000 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: CON                     1 {   6   6  10  12  12 } { 5 0 0 0 0 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: INT                     1 {   6   6  10  12  12 } { 5 0 0 0 0 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: STR                     1 {   6   6  10  12  12 } { 5 0 0 0 0 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: DEX                     1 {   6   6  10  12  12 } { 5 0 0 0 0 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: ATT_SPEED               1 {   5   5   5   8   8 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: MOV_SPEED               1 {  20  20  20  20  20 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: CAST_SPEED              1 {  10  10  15  20  20 } { 5 5 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: HP_REGEN                1 {  10  10  15  20  20 } { 0 0 0 0 5 5 0 }
Aug 11 12:36:36 :: ITEM_ATTR: SP_REGEN                1 {  10  10  15  20  20 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: POISON_PCT              1 {   3   3   5   5   8 } { 5 0 0 0 0 5 0 }
Aug 11 12:36:36 :: ITEM_ATTR: STUN_PCT                1 {   3   3   5   5   8 } { 5 0 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: SLOW_PCT                1 {   3   3   5   5   8 } { 5 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: CRITICAL_PCT            1 {   5   5   5  10  10 } { 5 0 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: PENETRATE_PCT           1 {   5   5   5  10  10 } { 5 0 5 0 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: ATTBONUS_HUMAN          1 {   5   8   8  10  10 } { 5 0 5 0 0 5 5 }
Aug 11 12:36:36 :: ITEM_ATTR: ATTBONUS_ANIMAL         1 {  20  20  20  20  20 } { 5 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: ATTBONUS_ORC            1 {  20  20  20  20  20 } { 5 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: ATTBONUS_MILGYO         1 {  20  20  20  20  20 } { 5 0 5 0 0 5 5 }
Aug 11 12:36:36 :: ITEM_ATTR: ATTBONUS_UNDEAD         1 {  20  20  20  20  20 } { 5 0 5 0 0 5 5 }
Aug 11 12:36:36 :: ITEM_ATTR: ATTBONUS_DEVIL          1 {  20  20  20  20  20 } { 5 0 5 0 0 5 5 }
Aug 11 12:36:36 :: ITEM_ATTR: STEAL_HP                1 {  10  10  10  10  10 } { 0 5 5 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: STEAL_SP                1 {   5   5  10  10  10 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: MANA_BURN_PCT           1 {   5   5  10  10  10 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: BLOCK                   1 {   5  10  10  15  15 } { 0 0 0 0 0 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: DODGE                   1 {   5  10  10  15  15 } { 0 0 0 5 0 5 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_SWORD            1 {   8  10  10  15  15 } { 0 5 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_TWOHAND          1 {   8  10  10  10  15 } { 0 5 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_DAGGER           1 {   8  10  10  10  15 } { 0 5 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_BELL             1 {   8  10  10  10  15 } { 0 5 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_FAN              1 {   8  10  10  10  15 } { 0 5 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_BOW              1 {   8  10  10  10  15 } { 0 5 0 5 5 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_FIRE             1 {  10  15  15  15  20 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_ELEC             1 {  10  15  15  15  20 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_MAGIC            1 {  10  15  15  15  20 } { 0 5 5 0 0 5 0 }
Aug 11 12:36:36 :: ITEM_ATTR: RESIST_WIND             1 {  10  15  15  15  20 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: REFLECT_MELEE           1 {   5   5   5   5  10 } { 0 5 0 0 0 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: POISON_REDUCE           1 {  10  10  10  15  15 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: EXP_DOUBLE_BONUS        1 {  20  20  20  20  20 } { 0 0 0 5 5 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: GOLD_DOUBLE_BONUS       1 {  20  20  20  20  20 } { 0 0 0 5 5 0 5 }
Aug 11 12:36:36 :: ITEM_ATTR: ITEM_DROP_BONUS         1 {  20  20  20  20  20 } { 0 0 5 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: IMMUNE_STUN             1 {   1   1   1   1   1 } { 0 0 0 0 0 0 1 }
Aug 11 12:36:36 :: ITEM_ATTR: IMMUNE_SLOW             1 {   1   1   1   1   1 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_ATTR: ATT_GRADE_BONUS         1 {  30  30  50  50  50 } { 0 5 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: MAX_HP                  1 { 500 500 500 500 500 } { 5 5 5 5 5 5 5 }
Aug 11 12:36:36 :: ITEM_RARE: MAX_SP                  1 {  50  50  50  50  50 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: CON                     1 {   5   5   5   5   5 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: INT                     1 {   5   5   5   5   5 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: STR                     1 {   5   5   5   5   5 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: DEX                     1 {   5   5   5   5   5 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: ATT_GRADE_BONUS         1 {  30  30  30  30  30 } { 0 0 0 0 0 0 0 }
Aug 11 12:36:36 :: ITEM_RARE: ATT_BONUS_TO_MONSTER    1 {  10  10  10  10  10 } { 5 5 5 5 5 5 5 }
Aug 11 12:36:36 :: LAND: 1 map 1      20200x10000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 2 map 1      23500x13600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 3 map 1      27600x10900   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 4 map 1      55600x9600    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 5 map 1      57100x3800    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 6 map 1      60900x5200    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 7 map 1      66100x7900    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 8 map 1      81400x16800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 9 map 1      90700x20400   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 10 map 1      94300x23700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 11 map 1      10800x108500  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 12 map 1       5900x108500  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 13 map 1       7700x104300  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 14 map 1      23400x46200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 15 map 1      17200x44400   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 16 map 1      20000x40100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 17 map 1      25800x36900   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 18 map 1      16900x35800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 75 map 4       9600x13100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 76 map 4      16100x15600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 77 map 4       9100x19500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 78 map 4      14900x19500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 79 map 4      27700x19500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 80 map 4      23600x23000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 81 map 4      31800x24200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 82 map 4      27900x27300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 83 map 4      35500x35400   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 84 map 4      32800x39300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 85 map 4      39700x39600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 86 map 4      36100x42700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 87 map 4      24400x39000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 88 map 4      19900x41600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 89 map 4      14400x41700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 90 map 4      10200x39100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 91 map 4       7700x34600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 92 map 4       8400x29500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 101 map 21     29400x11400   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 102 map 21     33600x12700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 103 map 21     36300x16300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 104 map 21     55900x17200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 105 map 21     72800x8500    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 106 map 21     76300x5400    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 107 map 21     77600x10200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 108 map 21     84200x47200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 109 map 21     87800x61000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 110 map 21     32100x113800  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 111 map 21     28800x117200  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 112 map 21     24400x118700  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 113 map 21     22600x114400  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 114 map 21     34800x92300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 115 map 21     37500x89000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 116 map 21     35100x73600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 117 map 21     35400x69200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 118 map 21     35400x55600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 175 map 24      7100x5200    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 176 map 24     12800x4800    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 177 map 24      9700x9900    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 178 map 24     14500x13300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 179 map 24     36900x26000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 180 map 24     38600x29800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 181 map 24     36500x33900   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 182 map 24     33600x38600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 183 map 24     30900x33500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 184 map 24     25700x33500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 185 map 24     25600x37800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 186 map 24     20900x37800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 187 map 24     20900x33700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 188 map 24     14200x33700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 189 map 24     10000x37100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 190 map 24      5800x34800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 191 map 24      8800x29800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 192 map 24     10500x26100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 201 map 41     66100x9400    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 202 map 41     70300x7900    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 203 map 41     73600x11500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 204 map 41     70900x15100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 205 map 41     71800x61900   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 206 map 41     77000x64100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 207 map 41     60700x66800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 208 map 41     74500x68200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 209 map 41     67900x110800  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 210 map 41     67900x115700  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 211 map 41     62800x114800  w 3000 h 3000
Aug 11 12:36:36 :: LAND: 212 map 41     16600x95300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 213 map 41      5400x94100   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 214 map 41     18600x89300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 215 map 41      4600x89800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 216 map 41     11200x36000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 217 map 41      8200x31800   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 218 map 41     12000x29200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 275 map 44      5400x7700    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 276 map 44      9700x7300    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 277 map 44      5500x11500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 278 map 44      5100x15500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 279 map 44      8900x17900   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 280 map 44     22200x15600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 281 map 44     43000x3700    w 3000 h 3000
Aug 11 12:36:36 :: LAND: 282 map 44     38900x27200   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 283 map 44     30200x29900   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 284 map 44     40000x34500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 285 map 44     32800x37000   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 286 map 44     40600x39300   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 287 map 44     35600x40600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 288 map 44     18500x33600   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 289 map 44     17300x38500   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 290 map 44     13500x39400   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 291 map 44      9100x38700   w 3000 h 3000
Aug 11 12:36:36 :: LAND: 292 map 44      5000x36300   w 3000 h 3000
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14013 price 20000000 mat 90010 20
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14014 price 20000000 mat 90010 20
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14015 price 20000000 mat 90010 20
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14043 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14045 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14046 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14047 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14048 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14049 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14050 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14051 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14052 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14053 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14054 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14055 price 20000000 mat 90010 15
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14061 price 25000000 mat 90010 25
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14062 price 500000000 mat 90010 50
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14063 price 750000000 mat 90010 75
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14100 price 20000000 mat 90010 20
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14110 price 20000000 mat 90010 20
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14120 price 20000000 mat 90010 20
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14200 price 3000000 mat 90011 5
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14300 price 300000 mat 90010 5
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14301 price 300000 mat 90010 5
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14302 price 300000 mat 90010 7
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14303 price 300000 mat 90010 7
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14304 price 300000 mat 90010 7
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14305 price 300000 mat 90010 8
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14306 price 300000 mat 90010 8
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14307 price 300000 mat 90010 8
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14308 price 300000 mat 90010 9
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14309 price 300000 mat 90010 9
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14400 price 2000000 mat 90011 5
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14401 price 2000000 mat 90011 5
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14402 price 2000000 mat 90011 7
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14403 price 2000000 mat 90011 7
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14404 price 2000000 mat 90011 7
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14405 price 2000000 mat 90011 9
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14406 price 2000000 mat 90011 9
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14407 price 2000000 mat 90011 9
Aug 11 12:36:36 :: OBJ_PROTO: vnum 14408 price 2000000 mat 90011 9
Aug 11 12:36:36 :: SYSTEM: BINDING TCP PORT ON [20000] (fd 19)
Aug 11 12:36:36 :: ACCEPT_HANDLE: 19
Aug 11 12:36:36 :: PLAYER_DELETE_LEVEL_LIMIT set to 70
Aug 11 12:36:36 :: PLAYER_DELETE_LEVEL_LIMIT_LOWER set to 0
Aug 11 12:36:36 :: CHINA_EVENT_SERVER false
Aug 11 12:36:36 :: EventFlag Load Ayuuji 0
Aug 11 12:36:36 :: EventFlag Load Eptun 0
Aug 11 12:36:36 :: EventFlag Load hime 0
Aug 11 12:36:36 :: EventFlag Load metinkills 3
Aug 11 12:36:36 :: EventFlag Load oxevent_status 0
Aug 11 12:36:36 :: EventFlag Load Sempoinus1 0
Aug 11 12:36:36 :: EventFlag Load threeway_war 0
Aug 11 12:36:36 :: EventFlag Load threeway_war_boss_count 5
Aug 11 12:36:36 :: EventFlag Load threeway_war_dead_count 50
Aug 11 12:36:36 :: EventFlag Load threeway_war_kill_count 100
Aug 11 12:36:36 :: EventFlag Load threeway_war_open_gate1 1
Aug 11 12:36:36 :: EventFlag Load threeway_war_open_gate2 1
Aug 11 12:36:36 :: EventFlag Load threeway_war_open_gate3 1
Aug 11 12:36:36 :: EventFlag Load threeway_war_pass_idx 0
Aug 11 12:36:36 :: EventFlag Load threeway_war_sungzi_idx 0
Aug 11 12:36:36 :: EventFlag Load trading_offer_item_a 30011
Aug 11 12:36:36 :: EventFlag Load trading_offer_item_b 30015
Aug 11 12:36:36 :: EventFlag Load trading_offer_time 1502450701
Aug 11 12:36:36 :: EventFlag Load [Dev]Eptun 0
Aug 11 12:36:36 :: EventFlag Load [GP]Ayuuji 0
Aug 11 12:36:36 :: EventFlag Load [GP]hime 0
Aug 11 12:36:36 ::    OK
Aug 11 12:36:36 :: GuildWar: Limbo2                   ladder 19000 win 0   draw 0   loss 0  
Aug 11 12:36:36 :: POWER_POLY: 
Aug 11 12:36:36 :: HANDICAP_POLY: 
Aug 11 12:36:36 :: SIGNAL: SIGSEGV
SYSERR: Aug 11 12:36:45 :: pid_init: 
Start of pid: 1206

 

Link to comment
Share on other sites

  • Answers 0
  • Created
  • Last Reply

Top Posters For This Question

Popular Days

Top Posters For This Question

0 answers to this question

Recommended Posts

There have been no answers to this question yet

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
  • Recently Browsing   0 members

    • No registered users viewing this page.


Important Information

Terms of Use / Privacy Policy / Guidelines / We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.