crypto/bn/bn_exp.c:220: 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:192:10: Call
190.   
191.       BN_CTX_start(ctx);
192.       aa = BN_CTX_get(ctx);
                ^
193.       val[0] = BN_CTX_get(ctx);
194.       if (val[0] == NULL)

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:387:1: Parameter `*a->d`
    385.   }
    386.   
    387. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    388.   {
    389.       bn_check_top(a);

crypto/bn/bn_lib.c:390:9: Call
    388.   {
    389.       bn_check_top(a);
    390.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    391.           return 0;
    392.       a->neg = 0;

crypto/bn/bn_lcl.h:651:1: Parameter `*a->d`
      649.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      650.   
      651. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      652.   {
      653.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_exp.c:220:14: Call
218.       window = BN_window_bits_for_exponent_size(bits);
219.       if (window > 1) {
220.           if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))
                    ^
221.               goto err;           /* 2 */
222.           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:131:10: Call
    129.        *    = |m/N|
    130.        */
    131.       if (!BN_rshift(a, m, recp->num_bits))
                    ^
    132.           goto err;
    133.       if (!BN_mul(b, a, &(recp->Nr), ctx))

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

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

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

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

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