crypto/ec/ecp_mont.c:201: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_to_montgomery`.
Showing all 15 steps of the trace


crypto/ec/ecp_mont.c:194:10: Call
192.       if (mont == NULL)
193.           goto err;
194.       if (!BN_MONT_CTX_set(mont, p, ctx)) {
                ^
195.           ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB);
196.           goto err;

crypto/bn/bn_mont.c:349:1: Parameter `mont->N.top`
  347.   }
  348.   
  349. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
  350.   {
  351.       int ret = 0;

crypto/ec/ecp_mont.c:201:10: Call
199.       if (one == NULL)
200.           goto err;
201.       if (!BN_to_montgomery(one, BN_value_one(), mont, ctx))
                ^
202.           goto err;
203.   

crypto/bn/bn_lib.c:924:1: Parameter `mont->N.top`
  922.   }
  923.   
  924. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  925.                        BN_CTX *ctx)
  926.   {

crypto/bn/bn_lib.c:927:12: Call
  925.                        BN_CTX *ctx)
  926.   {
  927.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                    ^
  928.   }
  929.   

crypto/bn/bn_mont.c:128:1: Parameter `mont->N.top`
    126.   #endif
    127.   
    128. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    129.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    130.   {

crypto/bn/bn_mont.c:163:10: Call
    161.       /* reduce from aRR to aR */
    162.   #ifdef MONT_WORD
    163.       if (!BN_from_montgomery_word(r, tmp, mont))
                    ^
    164.           goto err;
    165.   #else

crypto/bn/bn_mont.c:206:21: <Offset trace>
204.       n0 = mont->n0[0];
205.   
206.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                           ^
207.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
208.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:206:21: Assignment
      204.       n0 = mont->n0[0];
      205.   
      206.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                                 ^
      207.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
      208.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:177:1: <Length trace>
175.   
176.   #ifdef MONT_WORD
177. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
178.   {
179.       BIGNUM *n;

crypto/bn/bn_mont.c:177:1: Parameter `*r->d`
      175.   
      176.   #ifdef MONT_WORD
      177. > static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
      178.   {
      179.       BIGNUM *n;

crypto/bn/bn_mont.c:191:9: Call
      189.   
      190.       max = (2 * nl);             /* carry is stored separately */
      191.       if (bn_wexpand(r, max) == NULL)
                     ^
      192.           return (0);
      193.   

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_mont.c:196:5: Assignment
      194.       r->neg ^= n->neg;
      195.       np = n->d;
      196.       rp = r->d;
                 ^
      197.   
      198.       /* clear the top words of T */

crypto/bn/bn_mont.c:208:26: Array access: Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `BN_to_montgomery` 
      206.       for (carry = 0, i = 0; i < nl; i++, rp++) {
      207.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
      208.           v = (v + carry + rp[nl]) & BN_MASK2;
                                      ^
      209.           carry |= (v != rp[nl]);
      210.           carry &= (v <= rp[nl]);
