test/bntest.c:547: error: BUFFER_OVERRUN_L3
  Offset added: [0, 512] Size: [0, 536870848] by call to `BN_div_word`.
Showing all 16 steps of the trace


test/bntest.c:541:13: Call
539.       for (i = 0; i < num0; i++) {
540.           do {
541.               BN_bntest_rand(a, 512, -1, 0);
                   ^
542.               BN_bntest_rand(b, BN_BITS2, -1, 0);
543.           } while (BN_is_zero(b));

crypto/bn/bn_rand.c:210:1: Parameter `*rnd->d`
  208.   }
  209.   
  210. > int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
  211.   {
  212.       return bnrand(2, rnd, bits, top, bottom);

crypto/bn/bn_rand.c:212:12: Call
  210.   int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
  211.   {
  212.       return bnrand(2, rnd, bits, top, bottom);
                    ^
  213.   }
  214.   

crypto/bn/bn_rand.c:119:1: Parameter `*rnd->d`
    117.   #include <openssl/sha.h>
    118.   
    119. > static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom)
    120.   {
    121.       unsigned char *buf = NULL;

test/bntest.c:547:13: Call
545.           s = b->d[0];
546.           BN_copy(b, a);
547.           r = BN_div_word(b, s);
                   ^
548.   
549.           if (bp != NULL) {

crypto/bn/bn_word.c:88:1: Parameter `*a->d`
  86.   }
  87.   
  88. > BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
  89.   {
  90.       BN_ULONG ret = 0;

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, 536870848] by call to `BN_div_word` 
    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);
