crypto/ec/ec2_oct.c:61: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_arr`.
Showing all 10 steps of the trace


crypto/ec/ec2_oct.c:54:11: Call
52.   
53.       BN_CTX_start(ctx);
54.       tmp = BN_CTX_get(ctx);
                ^
55.       x = BN_CTX_get(ctx);
56.       y = 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.       /* 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/ec/ec2_oct.c:61:10: Call
59.           goto err;
60.   
61.       if (!BN_GF2m_mod_arr(x, x_, group->poly))
               ^
62.           goto err;
63.       if (BN_is_zero(x)) {

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

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

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

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