crypto/bn/bn_gf2m.c:805: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_inv`.
Showing all 22 steps of the trace


crypto/bn/bn_gf2m.c:801:12: Call
799.   
800.       BN_CTX_start(ctx);
801.       xinv = BN_CTX_get(ctx);
                  ^
802.       if (xinv == NULL)
803.           goto err;

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:365:15: Assignment
    363.       a->neg = 0;
    364.       a->d[0] = w;
    365.       a->top = (w ? 1 : 0);
                         ^
    366.       a->flags &= ~BN_FLG_FIXED_TOP;
    367.       bn_check_top(a);

crypto/bn/bn_lib.c:365:5: Assignment
    363.       a->neg = 0;
    364.       a->d[0] = w;
    365.       a->top = (w ? 1 : 0);
               ^
    366.       a->flags &= ~BN_FLG_FIXED_TOP;
    367.       bn_check_top(a);

crypto/bn/bn_gf2m.c:805:10: Call
803.           goto err;
804.   
805.       if (!BN_GF2m_mod_inv(xinv, x, p, ctx))
                ^
806.           goto err;
807.       if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx))

crypto/bn/bn_gf2m.c:724:1: Parameter `*r->d`
  722.    * But it does eliminate first order deduction on the input.
  723.    */
  724. > int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  725.   {
  726.       BIGNUM *b = NULL;

crypto/bn/bn_gf2m.c:741:10: Call
  739.   
  740.       /* r := a * b */
  741.       if (!BN_GF2m_mod_mul(r, a, b, p, ctx))
                  ^
  742.           goto err;
  743.   

crypto/bn/bn_gf2m.c:465:1: Parameter `*r->d`
    463.    * BN_GF2m_mod_mul_arr function.
    464.    */
    465. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    466.                       const BIGNUM *p, BN_CTX *ctx)
    467.   {

crypto/bn/bn_gf2m.c:481:11: Call
    479.           goto err;
    480.       }
    481.       ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
                     ^
    482.       bn_check_top(r);
    483.    err:

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

crypto/bn/bn_gf2m.c:449:9: Call
      447.   
      448.       bn_correct_top(s);
      449.       if (BN_GF2m_mod_arr(r, s, p))
                     ^
      450.           ret = 1;
      451.       bn_check_top(r);

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:311:14: Call
        309.        */
        310.       if (a != r) {
        311.           if (!bn_wexpand(r, a->top))
                            ^
        312.               return 0;
        313.           for (j = 0; j < a->top; j++) {

crypto/bn/bn_lib.c:942:1: Parameter `*a->d`
          940.   }
          941.   
          942. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          943.   {
          944.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:944:37: Call
          942.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
          943.   {
          944.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                     ^
          945.   }
          946.   

crypto/bn/bn_lib.c:244:1: Parameter `*b->d`
            242.    */
            243.   
            244. > BIGNUM *bn_expand2(BIGNUM *b, int words)
            245.   {
            246.       if (words > b->dmax) {

crypto/bn/bn_lib.c:247:23: Call
            245.   {
            246.       if (words > b->dmax) {
            247.           BN_ULONG *a = bn_expand_internal(b, words);
                                         ^
            248.           if (!a)
            249.               return NULL;

crypto/bn/bn_lib.c:208:1: <Offset trace>
206.   /* This is used by bn_expand2() */
207.   /* The caller MUST check that words > b->dmax before calling this */
208. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
209.   {
210.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:208:1: Parameter `b->top`
              206.   /* This is used by bn_expand2() */
              207.   /* The caller MUST check that words > b->dmax before calling this */
              208. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              209.   {
              210.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:208:1: <Length trace>
206.   /* This is used by bn_expand2() */
207.   /* The caller MUST check that words > b->dmax before calling this */
208. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
209.   {
210.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:208:1: Parameter `*b->d`
              206.   /* This is used by bn_expand2() */
              207.   /* The caller MUST check that words > b->dmax before calling this */
              208. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              209.   {
              210.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:231:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_inv` 
              229.       assert(b->top <= words);
              230.       if (b->top > 0)
              231.           memcpy(a, b->d, sizeof(*a) * b->top);
                             ^
              232.   
              233.       return a;
