crypto/bn/bn_print.c:93: error: BUFFER_OVERRUN_L2
  Offset: [0, 10000000000000000000] Size: 256 by call to `BN_div_word`.
Showing all 9 steps of the trace


crypto/bn/bn_print.c:93:19: Call
91.               if (lp - bn_data >= bn_data_num)
92.                   goto err;
93.               *lp = BN_div_word(t, BN_DEC_CONV);
                        ^
94.               if (*lp == (BN_ULONG)-1)
95.                   goto err;

crypto/bn/bn_word.c:61:1: Parameter `w`
  59.   }
  60.   
  61. > BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
  62.   {
  63.       BN_ULONG ret = 0;

crypto/bn/bn_word.c:67:5: Assignment
  65.   
  66.       bn_check_top(a);
  67.       w &= BN_MASK2;
            ^
  68.   
  69.       if (!w)

crypto/bn/bn_word.c:76:20: Call
  74.   
  75.       /* normalize input (so bn_div_words doesn't complain) */
  76.       j = BN_BITS2 - BN_num_bits_word(w);
                           ^
  77.       w <<= j;
  78.       if (!BN_lshift(a, a, j))

crypto/bn/bn_lib.c:89:1: <Offset trace>
87.   }
88.   
89. > int BN_num_bits_word(BN_ULONG l)
90.   {
91.       static const unsigned char bits[256] = {

crypto/bn/bn_lib.c:89:1: Parameter `l`
    87.   }
    88.   
    89. > int BN_num_bits_word(BN_ULONG l)
    90.   {
    91.       static const unsigned char bits[256] = {

crypto/bn/bn_lib.c:91:5: <Length trace>
89.   int BN_num_bits_word(BN_ULONG l)
90.   {
91.       static const unsigned char bits[256] = {
          ^
92.           0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
93.           5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

crypto/bn/bn_lib.c:91:5: Array declaration
    89.   int BN_num_bits_word(BN_ULONG l)
    90.   {
    91.       static const unsigned char bits[256] = {
              ^
    92.           0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
    93.           5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

crypto/bn/bn_lib.c:114:25: Array access: Offset: [0, 10000000000000000000] Size: 256 by call to `BN_div_word` 
    112.           if (l & 0xffff000000000000L) {
    113.               if (l & 0xff00000000000000L) {
    114.                   return (bits[(int)(l >> 56)] + 56);
                                   ^
    115.               } else
    116.                   return (bits[(int)(l >> 48)] + 48);
