crypto/bn/bn_exp.c:1322: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 17 steps of the trace


crypto/bn/bn_exp.c:1307:9: Call
1305.   
1306.       BN_CTX_start(ctx);
1307.       d = BN_CTX_get(ctx);
                ^
1308.       val[0] = BN_CTX_get(ctx);
1309.       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.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  231.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:359:1: Parameter `*a->d`
    357.   }
    358.   
    359. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    360.   {
    361.       bn_check_top(a);

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_exp.c:1322:14: Call
1320.       window = BN_window_bits_for_exponent_size(bits);
1321.       if (window > 1) {
1322.           if (!BN_mod_mul(d, val[0], val[0], m, ctx))
                     ^
1323.               goto err;           /* 2 */
1324.           j = 1 << (window - 1);

crypto/bn/bn_mod.c:193:1: Parameter `*r->d`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/bn/bn_mod.c:213:10: Call
  211.               goto err;
  212.       }
  213.       if (!BN_nnmod(r, t, m, ctx))
                  ^
  214.           goto err;
  215.       bn_check_top(r);

crypto/bn/bn_mod.c:13:1: Parameter `*r->d`
    11.   #include "bn_lcl.h"
    12.   
    13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
    14.   {
    15.       /*

crypto/bn/bn_mod.c:20:11: Call
    18.        */
    19.   
    20.       if (!(BN_mod(r, m, d, ctx)))
                    ^
    21.           return 0;
    22.       if (!r->neg)

crypto/bn/bn_div.c:209:1: Parameter `*rm->d`
      207.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
      208.    */
      209. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
      210.              BN_CTX *ctx)
      211.   {

crypto/bn/bn_div.c:229:11: Call
      227.       }
      228.   
      229.       ret = bn_div_fixed_top(dv, rm, num, divisor, ctx);
                       ^
      230.   
      231.       if (ret) {

crypto/bn/bn_div.c:264:1: Parameter `*rm->d`
        262.    *       divisor's length is considered public;
        263.    */
        264. > int bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
        265.                        const BIGNUM *divisor, BN_CTX *ctx)
        266.   {

crypto/bn/bn_div.c:449:9: Call
        447.       snum->flags |= BN_FLG_FIXED_TOP;
        448.       if (rm != NULL)
        449.           bn_rshift_fixed_top(rm, snum, norm_shift);
                       ^
        450.       BN_CTX_end(ctx);
        451.       return 1;

crypto/bn/bn_shift.c:214:1: <Length trace>
212.    * |n < BN_BITS2| or |n / BN_BITS2| being non-secret.
213.    */
214. > int bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n)
215.   {
216.       int i, top, nw;

crypto/bn/bn_shift.c:214:1: Parameter `*r->d`
          212.    * |n < BN_BITS2| or |n / BN_BITS2| being non-secret.
          213.    */
          214. > int bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n)
          215.   {
          216.       int i, top, nw;

crypto/bn/bn_shift.c:242:5: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul` 
          240.           return 0;
          241.   
          242.       t = &(r->d[0]);
                     ^
          243.       f = &(a->d[nw]);
          244.       l = f[0];
