crypto/ec/ecp_smpl.c:606: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_sqr`.
Showing all 19 steps of the trace


crypto/ec/ecp_smpl.c:595:14: Call
593.           }
594.       } else {
595.           if (!BN_mod_inverse(Z_1, Z_, group->field, ctx)) {
                    ^
596.               ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES,
597.                     ERR_R_BN_LIB);

crypto/bn/bn_gcd.c:231:10: Call
  229.       BIGNUM *rv;
  230.       int noinv;
  231.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                  ^
  232.       if (noinv)
  233.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:237:1: Parameter `n->top`
    235.   }
    236.   
    237. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    238.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
    239.                              int *pnoinv)

crypto/ec/ecp_smpl.c:606:18: Call
604.                   goto err;
605.           } else {
606.               if (!BN_mod_sqr(Z_2, Z_1, group->field, ctx))
                        ^
607.                   goto err;
608.           }

crypto/bn/bn_mod.c:208:1: Parameter `m->top`
  206.   }
  207.   
  208. > int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
  209.   {
  210.       if (!BN_sqr(r, a, ctx))

crypto/bn/bn_mod.c:213:12: Call
  211.           return 0;
  212.       /* r->neg == 0,  thus we don't need BN_nnmod */
  213.       return BN_mod(r, r, m, ctx);
                    ^
  214.   }
  215.   

crypto/bn/bn_div.c:254:31: Call
    252.   
    253.       /* First we normalise the numbers */
    254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                         ^
    255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
    256.           goto err;

crypto/bn/bn_lib.c:221:9: Assignment
      219.   
      220.       if (BN_is_zero(a))
      221.           return 0;
                     ^
      222.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
      223.   }

crypto/bn/bn_div.c:254:5: Assignment
    252.   
    253.       /* First we normalise the numbers */
    254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
               ^
    255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
    256.           goto err;

crypto/bn/bn_div.c:255:11: Call
    253.       /* First we normalise the numbers */
    254.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
    255.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                     ^
    256.           goto err;
    257.       sdiv->neg = 0;

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
      128.   }
      129.   
      130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      131.   {
      132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
      143.   
      144.       r->neg = a->neg;
      145.       nw = n / BN_BITS2;
                 ^
      146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
      128.   }
      129.   
      130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      131.   {
      132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
      144.       r->neg = a->neg;
      145.       nw = n / BN_BITS2;
      146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                     ^
      147.           return (0);
      148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
        993.   }
        994.   
        995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        996.   {
        997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
      149.       rb = BN_BITS2 - lb;
      150.       f = a->d;
      151.       t = r->d;
                 ^
      152.       t[a->top + nw] = 0;
      153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_sqr` 
      157.           for (i = a->top - 1; i >= 0; i--) {
      158.               l = f[i];
      159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                         ^
      160.               t[nw + i] = (l << lb) & BN_MASK2;
      161.           }
