crypto/bn/bn_word.c:105: error: BUFFER_OVERRUN_L3
  Offset added: [0, 512] Size: [0, 67108856] by call to `BN_lshift`.
Showing all 14 steps of the trace


crypto/bn/bn_word.c:103:20: Call
101.   
102.       /* normalize input (so bn_div_words doesn't complain) */
103.       j = BN_BITS2 - BN_num_bits_word(w);
                          ^
104.       w <<= j;
105.       if (!BN_lshift(a, a, j))

crypto/bn/bn_lib.c:145:44: Assignment
  143.   int BN_num_bits_word(BN_ULONG l)
  144.   {
  145.       static const unsigned char bits[256] = {
                                                    ^
  146.           0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
  147.           5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,

crypto/bn/bn_lib.c:168:17: Assignment
  166.           if (l & 0xffff000000000000L) {
  167.               if (l & 0xff00000000000000L) {
  168.                   return (bits[(int)(l >> 56)] + 56);
                         ^
  169.               } else
  170.                   return (bits[(int)(l >> 48)] + 48);

crypto/bn/bn_word.c:103:5: Assignment
101.   
102.       /* normalize input (so bn_div_words doesn't complain) */
103.       j = BN_BITS2 - BN_num_bits_word(w);
           ^
104.       w <<= j;
105.       if (!BN_lshift(a, a, j))

crypto/bn/bn_word.c:105:10: Call
103.       j = BN_BITS2 - BN_num_bits_word(w);
104.       w <<= j;
105.       if (!BN_lshift(a, a, j))
                ^
106.           return (BN_ULONG)-1;
107.   

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
  143.   
  144.       r->neg = a->neg;
  145.       nw = n / BN_BITS2;
             ^
  146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
  147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
  144.       r->neg = a->neg;
  145.       nw = n / BN_BITS2;
  146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                 ^
  147.           return (0);
  148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
    993.   }
    994.   
    995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    996.   {
    997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
  149.       rb = BN_BITS2 - lb;
  150.       f = a->d;
  151.       t = r->d;
             ^
  152.       t[a->top + nw] = 0;
  153.       if (lb == 0)

crypto/bn/bn_shift.c:162:5: Array access: Offset added: [0, 512] Size: [0, 67108856] by call to `BN_lshift` 
  160.               t[nw + i] = (l << lb) & BN_MASK2;
  161.           }
  162.       memset(t, 0, sizeof(*t) * nw);
             ^
  163.       r->top = a->top + nw + 1;
  164.       bn_correct_top(r);
