crypto/bn/bn_exp.c:210: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_nnmod`.
Showing all 19 steps of the trace


crypto/bn/bn_exp.c:161:1: Parameter `m->top`
159.   }
160.   
161. > int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
162.                       const BIGNUM *m, BN_CTX *ctx)
163.   {

crypto/bn/bn_exp.c:200:14: Call
198.       if (m->neg) {
199.           /* ignore sign of 'm' */
200.           if (!BN_copy(aa, m))
                    ^
201.               goto err;
202.           aa->neg = 0;

crypto/bn/bn_lib.c:281:1: Parameter `b->top`
  279.   }
  280.   
  281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  282.   {
  283.       bn_check_top(b);

crypto/bn/bn_exp.c:210:10: Call
208.       }
209.   
210.       if (!BN_nnmod(val[0], a, m, ctx))
                ^
211.           goto err;               /* 1 */
212.       if (BN_is_zero(val[0])) {

crypto/bn/bn_mod.c:13:1: Parameter `d->top`
  11.   #include "bn_lcl.h"
  12.   
  13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
  14.   {
  15.       /*

crypto/bn/bn_mod.c:20:11: Call
  18.        */
  19.   
  20.       if (!(BN_mod(r, m, d, ctx)))
                  ^
  21.           return 0;
  22.       if (!r->neg)

crypto/bn/bn_div.c:209:1: Parameter `divisor->top`
    207.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    208.    */
    209. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    210.              BN_CTX *ctx)
    211.   {

crypto/bn/bn_div.c:214:9: Call
    212.       int ret;
    213.   
    214.       if (BN_is_zero(divisor)) {
                   ^
    215.           BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);
    216.           return 0;

crypto/bn/bn_lib.c:864:1: Parameter `a->top`
      862.   }
      863.   
      864. > int BN_is_zero(const BIGNUM *a)
      865.   {
      866.       return a->top == 0;

crypto/bn/bn_div.c:229:11: Call
    227.       }
    228.   
    229.       ret = bn_div_fixed_top(dv, rm, num, divisor, ctx);
                     ^
    230.   
    231.       if (ret) {

crypto/bn/bn_div.c:264:1: Parameter `divisor->top`
      262.    *       divisor's length is considered public;
      263.    */
      264. > int bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
      265.                        const BIGNUM *divisor, BN_CTX *ctx)
      266.   {

crypto/bn/bn_div.c:289:10: Call
      287.   
      288.       /* First we normalise the numbers */
      289.       if (!BN_copy(sdiv, divisor))
                      ^
      290.           goto err;
      291.       norm_shift = bn_left_align(sdiv);

crypto/bn/bn_lib.c:281:1: <Offset trace>
279.   }
280.   
281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
282.   {
283.       bn_check_top(b);

crypto/bn/bn_lib.c:281:1: Parameter `b->top`
        279.   }
        280.   
        281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        282.   {
        283.       bn_check_top(b);

crypto/bn/bn_lib.c:281:1: <Length trace>
279.   }
280.   
281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
282.   {
283.       bn_check_top(b);

crypto/bn/bn_lib.c:281:1: Parameter `*a->d`
        279.   }
        280.   
        281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        282.   {
        283.       bn_check_top(b);

crypto/bn/bn_lib.c:287:9: Call
        285.       if (a == b)
        286.           return a;
        287.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        288.           return NULL;
        289.   

crypto/bn/bn_lib.c:960:1: Parameter `*a->d`
          958.   }
          959.   
          960. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          961.   {
          962.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:291:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_nnmod` 
        289.   
        290.       if (b->top > 0)
        291.           memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);
                       ^
        292.   
        293.       a->neg = b->neg;
