crypto/bn/bn_gf2m.c:1100: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_sqr_arr`.
Showing all 12 steps of the trace


crypto/bn/bn_gf2m.c:1056:9: Call
1054.   
1055.       BN_CTX_start(ctx);
1056.       a = BN_CTX_get(ctx);
                ^
1057.       z = BN_CTX_get(ctx);
1058.       w = BN_CTX_get(ctx);

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:393:1: Parameter `*a->d`
    391.   }
    392.   
    393. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    394.   {
    395.       bn_check_top(a);

crypto/bn/bn_lib.c:396:9: Call
    394.   {
    395.       bn_check_top(a);
    396.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    397.           return (0);
    398.       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_gf2m.c:1100:22: Call
1098.                   goto err;
1099.               for (j = 1; j <= p[0] - 1; j++) {
1100.                   if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx))
                             ^
1101.                       goto err;
1102.                   if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx))

crypto/bn/bn_gf2m.c:497:1: Parameter `*r->d`
  495.   
  496.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  497. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
  498.                           BN_CTX *ctx)
  499.   {

crypto/bn/bn_gf2m.c:517:10: Call
  515.       s->top = 2 * a->top;
  516.       bn_correct_top(s);
  517.       if (!BN_GF2m_mod_arr(r, s, p))
                  ^
  518.           goto err;
  519.       bn_check_top(r);

crypto/bn/bn_gf2m.c:300:1: <Length trace>
298.   
299.   /* Performs modular reduction of a and store result in r.  r could be a. */
300. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
301.   {
302.       int j, k;

crypto/bn/bn_gf2m.c:300:1: Parameter `*r->d`
    298.   
    299.   /* Performs modular reduction of a and store result in r.  r could be a. */
    300. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
    301.   {
    302.       int j, k;

crypto/bn/bn_gf2m.c:326:5: Assignment
    324.           r->top = a->top;
    325.       }
    326.       z = r->d;
               ^
    327.   
    328.       /* start reduction */

crypto/bn/bn_gf2m.c:372:9: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_sqr_arr` 
    370.           else
    371.               z[dN] = 0;
    372.           z[0] ^= zz;             /* reduction t^0 component */
                   ^
    373.   
    374.           for (k = 1; p[k] != 0; k++) {
