crypto/bn/bn_exp.c:224: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_mul_reciprocal`.
Showing all 15 steps of the trace


crypto/bn/bn_exp.c:196:10: Call
194.   
195.       BN_CTX_start(ctx);
196.       aa = BN_CTX_get(ctx);
                ^
197.       val[0] = BN_CTX_get(ctx);
198.       if (!aa || !val[0])

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
    461.   }
    462.   
    463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    464.   {
    465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
    464.   {
    465.       bn_check_top(a);
    466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    467.           return (0);
    468.       a->neg = 0;

crypto/bn/bn_lcl.h:676:1: Parameter `*a->d`
      674.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      675.   
      676. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      677.   {
      678.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_exp.c:224:14: Call
222.       window = BN_window_bits_for_exponent_size(bits);
223.       if (window > 1) {
224.           if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))
                    ^
225.               goto err;           /* 2 */
226.           j = 1 << (window - 1);

crypto/bn/bn_recp.c:54:1: Parameter `*x->d`
  52.   }
  53.   
  54. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  55.                             BN_RECP_CTX *recp, BN_CTX *ctx)
  56.   {

crypto/bn/bn_recp.c:76:11: Call
  74.           ca = x;                 /* Just do the mod */
  75.   
  76.       ret = BN_div_recp(NULL, r, ca, recp, ctx);
                  ^
  77.    err:
  78.       BN_CTX_end(ctx);

crypto/bn/bn_recp.c:83:1: Parameter `*m->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:137:10: Call
    135.        *    = |m/N|
    136.        */
    137.       if (!BN_rshift(a, m, recp->num_bits))
                    ^
    138.           goto err;
    139.       if (!BN_mul(b, a, &(recp->Nr), ctx))

crypto/bn/bn_shift.c:120:1: <Length trace>
118.   }
119.   
120. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
121.   {
122.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:120:1: Parameter `*a->d`
      118.   }
      119.   
      120. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
      121.   {
      122.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:151:5: Assignment
      149.       }
      150.   
      151.       f = &(a->d[nw]);
                 ^
      152.       t = r->d;
      153.       j = a->top - nw;

crypto/bn/bn_shift.c:160:15: Assignment
      158.               *(t++) = *(f++);
      159.       } else {
      160.           l = *(f++);
                           ^
      161.           for (i = j - 1; i != 0; i--) {
      162.               tmp = (l >> rb) & BN_MASK2;

crypto/bn/bn_shift.c:163:17: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_mul_reciprocal` 
      161.           for (i = j - 1; i != 0; i--) {
      162.               tmp = (l >> rb) & BN_MASK2;
      163.               l = *(f++);
                             ^
      164.               *(t++) = (tmp | (l << lb)) & BN_MASK2;
      165.           }
