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


crypto/bn/bn_gf2m.c:913:14: Call
911.   
912.       BN_CTX_start(ctx);
913.       if ((u = BN_CTX_get(ctx)) == NULL)
                    ^
914.           goto err;
915.   

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_gf2m.c:924:18: Call
922.               goto err;
923.           if (BN_is_bit_set(b, i)) {
924.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                        ^
925.                   goto err;
926.           }

crypto/bn/bn_gf2m.c:408:1: Parameter `*r->d`
  406.    * the result in r.  r could be a or b; a could be b.
  407.    */
  408. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  409.                           const int p[], BN_CTX *ctx)
  410.   {

crypto/bn/bn_gf2m.c:419:16: Call
  417.   
  418.       if (a == b) {
  419.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  420.       }
  421.   

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

crypto/bn/bn_gf2m.c:507:10: Call
    505.       s->top = 2 * a->top;
    506.       bn_correct_top(s);
    507.       if (!BN_GF2m_mod_arr(r, s, p))
                    ^
    508.           goto err;
    509.       bn_check_top(r);

crypto/bn/bn_gf2m.c:290:1: <Length trace>
288.   
289.   /* Performs modular reduction of a and store result in r.  r could be a. */
290. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
291.   {
292.       int j, k;

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

crypto/bn/bn_gf2m.c:316:5: Assignment
      314.           r->top = a->top;
      315.       }
      316.       z = r->d;
                 ^
      317.   
      318.       /* start reduction */

crypto/bn/bn_gf2m.c:362:9: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr` 
      360.           else
      361.               z[dN] = 0;
      362.           z[0] ^= zz;             /* reduction t^0 component */
                     ^
      363.   
      364.           for (k = 1; p[k] != 0; k++) {
