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


crypto/ec/ec2_oct.c:304:9: Call
302.   
303.       BN_CTX_start(ctx);
304.       x = BN_CTX_get(ctx);
               ^
305.       y = BN_CTX_get(ctx);
306.       yxi = 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/ec/ec2_oct.c:331:26: Call
329.               if (!group->meth->field_div(group, yxi, y, x, ctx))
330.                   goto err;
331.               if (y_bit != BN_is_odd(yxi)) {
                                ^
332.                   ECerr(EC_F_EC_GF2M_SIMPLE_OCT2POINT, EC_R_INVALID_ENCODING);
333.                   goto err;

crypto/bn/bn_lib.c:865:1: <Length trace>
863.   }
864.   
865. > int BN_is_odd(const BIGNUM *a)
866.   {
867.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_lib.c:865:1: Parameter `*a->d`
  863.   }
  864.   
  865. > int BN_is_odd(const BIGNUM *a)
  866.   {
  867.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_lib.c:867:29: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_is_odd` 
  865.   int BN_is_odd(const BIGNUM *a)
  866.   {
  867.       return (a->top > 0) && (a->d[0] & 1);
                                     ^
  868.   }
  869.   
