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


test/bntest.c:604:9: Call
602.           a->neg = rand_neg();
603.           b->neg = rand_neg();
604.           BN_RECP_CTX_set(recp, b, ctx);
               ^
605.           BN_div_recp(d, c, a, recp, ctx);
606.           if (bp != NULL) {

crypto/bn/bn_recp.c:93:1: Parameter `*recp->Nr.d`
  91.   }
  92.   
  93. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  94.   {
  95.       if (!BN_copy(&(recp->N), d))

test/bntest.c:605:9: Call
603.           b->neg = rand_neg();
604.           BN_RECP_CTX_set(recp, b, ctx);
605.           BN_div_recp(d, c, a, recp, ctx);
               ^
606.           if (bp != NULL) {
607.               if (!results) {

crypto/bn/bn_recp.c:132:1: Parameter `*recp->Nr.d`
  130.   }
  131.   
  132. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
  133.                   BN_RECP_CTX *recp, BN_CTX *ctx)
  134.   {

crypto/bn/bn_recp.c:188:10: Call
  186.       if (!BN_rshift(a, m, recp->num_bits))
  187.           goto err;
  188.       if (!BN_mul(b, a, &(recp->Nr), ctx))
                  ^
  189.           goto err;
  190.       if (!BN_rshift(d, b, i - recp->num_bits))

crypto/bn/bn_mul.c:883:1: Parameter `*b->d`
    881.   #endif                          /* BN_RECURSION */
    882.   
    883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    884.   {
    885.       int ret = 0;

crypto/bn/bn_mul.c:964:17: Call
    962.                   if (bn_wexpand(rr, k * 4) == NULL)
    963.                       goto err;
    964.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    965.                                         j, al - j, bl - j, t->d);
    966.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:534:1: Parameter `n`
      532.    */
      533.   /* tnX may not be negative but less than n */
      534. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      535.                              int tna, int tnb, BN_ULONG *t)
      536.   {

crypto/bn/bn_mul.c:548:10: Call
      546.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      547.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      548.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      549.       neg = 0;
      550.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:782:1: Parameter `cl`
        780.    */
        781.   
        782. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        783.   {
        784.       int n, i;

crypto/bn/bn_lib.c:799:12: Call
        797.           }
        798.       }
        799.       return bn_cmp_words(a, b, cl);
                          ^
        800.   }
        801.   

crypto/bn/bn_lib.c:755:1: <Offset trace>
753.   }
754.   
755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
756.   {
757.       int i;

crypto/bn/bn_lib.c:755:1: Parameter `n`
          753.   }
          754.   
          755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          756.   {
          757.       int i;

crypto/bn/bn_lib.c:764:10: Assignment
          762.       if (aa != bb)
          763.           return ((aa > bb) ? 1 : -1);
          764.       for (i = n - 2; i >= 0; i--) {
                          ^
          765.           aa = a[i];
          766.           bb = b[i];

crypto/bn/bn_lib.c:755:1: <Length trace>
753.   }
754.   
755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
756.   {
757.       int i;

crypto/bn/bn_lib.c:755:1: Parameter `*a`
          753.   }
          754.   
          755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          756.   {
          757.       int i;

crypto/bn/bn_lib.c:765:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_div_recp` 
          763.           return ((aa > bb) ? 1 : -1);
          764.       for (i = n - 2; i >= 0; i--) {
          765.           aa = a[i];
                              ^
          766.           bb = b[i];
          767.           if (aa != bb)
