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

crypto/bn/bn_lib.c:366:5: Assignment
    364.       a->neg = 0;
    365.       a->d[0] = w;
    366.       a->top = (w ? 1 : 0);
               ^
    367.       a->flags &= ~BN_FLG_FIXED_TOP;
    368.       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:421:16: Call
      419.   
      420.       if (a == b) {
      421.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                            ^
      422.       }
      423.   

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

crypto/bn/bn_gf2m.c:509:10: Call
        507.       s->top = 2 * a->top;
        508.       bn_correct_top(s);
        509.       if (!BN_GF2m_mod_arr(r, s, p))
                        ^
        510.           goto err;
        511.       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:949:1: Parameter `*a->d`
            947.   }
            948.   
            949. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
            950.   {
            951.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:951:37: Call
            949.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
            950.   {
            951.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                       ^
            952.   }
            953.   

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

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

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

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

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

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

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