crypto/pem/pvkfmt.c:284: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 24 steps of the trace


crypto/pem/pvkfmt.c:274:14: Call
272.               goto memerr;
273.       } else {
274.           if (!read_lebn(&p, 20, &priv_key))
                    ^
275.               goto memerr;
276.   

crypto/pem/pvkfmt.c:47:10: Call
  45.   static int read_lebn(const unsigned char **in, unsigned int nbyte, BIGNUM **r)
  46.   {
  47.       *r = BN_lebin2bn(*in, nbyte, NULL);
                 ^
  48.       if (*r == NULL)
  49.           return 0;

crypto/bn/bn_lib.c:459:1: Parameter `*ret->d`
    457.   }
    458.   
    459. > BIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret)
    460.   {
    461.       unsigned int i, m;

crypto/pem/pvkfmt.c:284:14: Call
282.               goto memerr;
283.   
284.           if (!BN_mod_exp(pub_key, gbn, priv_key, pbn, ctx))
                    ^
285.               goto memerr;
286.   

crypto/bn/bn_exp.c:89:1: Parameter `*a->d`
  87.   }
  88.   
  89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  90.                  BN_CTX *ctx)
  91.   {

crypto/bn/bn_exp.c:144:19: Call
  142.           } else
  143.   # endif
  144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  145.       } else
  146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `*a->d`
    294.   }
    295.   
    296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    298.   {

crypto/bn/bn_exp.c:364:10: Call
    362.           goto err;
    363.       }
    364.       if (!bn_to_mont_fixed_top(val[0], aa, mont, ctx))
                    ^
    365.           goto err;               /* 1 */
    366.   

crypto/bn/bn_mont.c:210:1: Parameter `*a->d`
      208.   }
      209.   
      210. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      211.                            BN_CTX *ctx)
      212.   {

crypto/bn/bn_mont.c:213:12: Call
      211.                            BN_CTX *ctx)
      212.   {
      213.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                        ^
      214.   }
      215.   

crypto/bn/bn_mont.c:37:1: Parameter `*a->d`
        35.   }
        36.   
        37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        39.   {

crypto/bn/bn_mont.c:70:14: Call
        68.               goto err;
        69.       } else {
        70.           if (!BN_mul(tmp, a, b, ctx))
                           ^
        71.               goto err;
        72.       }

crypto/bn/bn_mul.c:497:1: Parameter `*a->d`
          495.   #endif                          /* BN_RECURSION */
          496.   
          497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
          498.   {
          499.       int ret = 0;

crypto/bn/bn_mul.c:577:17: Call
          575.                   if (bn_wexpand(rr, k * 4) == NULL)
          576.                       goto err;
          577.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                                 ^
          578.                                         j, al - j, bl - j, t->d);
          579.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `n`
            320.    */
            321.   /* tnX may not be negative but less than n */
            322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
            323.                              int tna, int tnb, BN_ULONG *t)
            324.   {

crypto/bn/bn_mul.c:335:10: Call
            333.   
            334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
            335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
                            ^
            336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
            337.       neg = 0;

crypto/bn/bn_lib.c:707:1: Parameter `cl`
              705.    */
              706.   
              707. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
              708.   {
              709.       int n, i;

crypto/bn/bn_lib.c:724:12: Call
              722.           }
              723.       }
              724.       return bn_cmp_words(a, b, cl);
                                ^
              725.   }
              726.   

crypto/bn/bn_lib.c:680:1: <Offset trace>
678.   }
679.   
680. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
681.   {
682.       int i;

crypto/bn/bn_lib.c:680:1: Parameter `n`
                678.   }
                679.   
                680. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
                681.   {
                682.       int i;

crypto/bn/bn_lib.c:689:10: Assignment
                687.       if (aa != bb)
                688.           return ((aa > bb) ? 1 : -1);
                689.       for (i = n - 2; i >= 0; i--) {
                                ^
                690.           aa = a[i];
                691.           bb = b[i];

crypto/bn/bn_lib.c:680:1: <Length trace>
678.   }
679.   
680. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
681.   {
682.       int i;

crypto/bn/bn_lib.c:680:1: Parameter `*b`
                678.   }
                679.   
                680. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
                681.   {
                682.       int i;

crypto/bn/bn_lib.c:691:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mod_exp` 
                689.       for (i = n - 2; i >= 0; i--) {
                690.           aa = a[i];
                691.           bb = b[i];
                                    ^
                692.           if (aa != bb)
                693.               return ((aa > bb) ? 1 : -1);
