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


crypto/bn/bn_gf2m.c:1126:9: Call
1124.   
1125.       BN_CTX_start(ctx);
1126.       a = BN_CTX_get(ctx);
                ^
1127.       z = BN_CTX_get(ctx);
1128.       w = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_gf2m.c:1170:22: Call
1168.                   goto err;
1169.               for (j = 1; j <= p[0] - 1; j++) {
1170.                   if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx))
                             ^
1171.                       goto err;
1172.                   if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx))

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

crypto/bn/bn_gf2m.c:587:10: Call
  585.       s->top = 2 * a->top;
  586.       bn_correct_top(s);
  587.       if (!BN_GF2m_mod_arr(r, s, p))
                  ^
  588.           goto err;
  589.       bn_check_top(r);

crypto/bn/bn_gf2m.c:370:1: <Length trace>
368.   
369.   /* Performs modular reduction of a and store result in r.  r could be a. */
370. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
371.   {
372.       int j, k;

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

crypto/bn/bn_gf2m.c:396:5: Assignment
    394.           r->top = a->top;
    395.       }
    396.       z = r->d;
               ^
    397.   
    398.       /* start reduction */

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