test/bntest.c:238: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_div_recp`.
Showing all 14 steps of the trace


test/bntest.c:237:9: Call
235.           a->neg = rand_neg();
236.           b->neg = rand_neg();
237.           BN_RECP_CTX_set(recp, b, ctx);
               ^
238.           BN_div_recp(d, c, a, recp, ctx);
239.           BN_mul(e, d, b, ctx);

crypto/bn/bn_recp.c:44:1: Parameter `*recp->N.d`
  42.   }
  43.   
  44. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  45.   {
  46.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_recp.c:46:10: Call
  44.   int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  45.   {
  46.       if (!BN_copy(&(recp->N), d))
                 ^
  47.           return 0;
  48.       BN_zero(&(recp->Nr));

crypto/bn/bn_lib.c:362:1: Parameter `*a->d`
    360.   }
    361.   
    362. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    363.   {
    364.       int i;

test/bntest.c:238:9: Call
236.           b->neg = rand_neg();
237.           BN_RECP_CTX_set(recp, b, ctx);
238.           BN_div_recp(d, c, a, recp, ctx);
               ^
239.           BN_mul(e, d, b, ctx);
240.           BN_add(d, e, c);

crypto/bn/bn_recp.c:83:1: Parameter `*recp->N.d`
  81.   }
  82.   
  83. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
  84.                   BN_RECP_CTX *recp, BN_CTX *ctx)
  85.   {

crypto/bn/bn_recp.c:145:10: Call
  143.       d->neg = 0;
  144.   
  145.       if (!BN_mul(b, &(recp->N), d, ctx))
                  ^
  146.           goto err;
  147.       if (!BN_usub(r, m, b))

crypto/bn/bn_mul.c:828:1: Parameter `*a->d`
    826.   #endif                          /* BN_RECURSION */
    827.   
    828. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    829.   {
    830.       int ret = 0;

crypto/bn/bn_mul.c:909:17: Call
    907.                   if (bn_wexpand(rr, k * 4) == NULL)
    908.                       goto err;
    909.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    910.                                         j, al - j, bl - j, t->d);
    911.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:480:1: Parameter `*a`
      478.    */
      479.   /* tnX may not be negative but less than n */
      480. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      481.                              int tna, int tnb, BN_ULONG *t)
      482.   {

crypto/bn/bn_mul.c:488:9: Call
      486.   
      487.       if (n < 8) {
      488.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                     ^
      489.           return;
      490.       }

crypto/bn/bn_mul.c:983:1: <Length trace>
981.   }
982.   
983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
984.   {
985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:983:1: Parameter `*b`
        981.   }
        982.   
        983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        984.   {
        985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1018:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_div_recp` 
        1016.           if (--nb <= 0)
        1017.               return;
        1018.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                 ^
        1019.           rr += 4;
        1020.           r += 4;
