crypto/rsa/rsa_x931g.c:60: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_X931_derive_prime_ex`.
Showing all 22 steps of the trace


crypto/rsa/rsa_x931g.c:44:18: Call
42.           goto err;
43.       if (!rsa->e) {
44.           rsa->e = BN_dup(e);
                       ^
45.           if (!rsa->e)
46.               goto err;

crypto/bn/bn_lib.c:314:10: Call
  312.       if (t == NULL)
  313.           return NULL;
  314.       if (!BN_copy(t, a)) {
                  ^
  315.           BN_free(t);
  316.           return NULL;

crypto/bn/bn_lib.c:322:1: Parameter `*a->d`
    320.   }
    321.   
    322. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    323.   {
    324.       bn_check_top(b);

crypto/rsa/rsa_x931g.c:60:14: Call
58.               goto err;
59.   
60.           if (!BN_X931_derive_prime_ex(rsa->p, p1, p2,
                   ^
61.                                        Xp, Xp1, Xp2, e, ctx, cb))
62.               goto err;

crypto/bn/bn_x931p.c:51:1: Parameter `*p->d`
  49.    */
  50.   
  51. > int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
  52.                               const BIGNUM *Xp, const BIGNUM *Xp1,
  53.                               const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,

crypto/bn/bn_x931p.c:91:10: Call
  89.       /* First set p to value of Rp */
  90.   
  91.       if (!BN_mod_inverse(p, p2, p1, ctx))
                 ^
  92.           goto err;
  93.   

crypto/bn/bn_gcd.c:124:1: Parameter `*in->d`
    122.                                           BN_CTX *ctx);
    123.   
    124. > BIGNUM *BN_mod_inverse(BIGNUM *in,
    125.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
    126.   {

crypto/bn/bn_gcd.c:129:10: Call
    127.       BIGNUM *rv;
    128.       int noinv;
    129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                    ^
    130.       if (noinv)
    131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `*in->d`
      133.   }
      134.   
      135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
      136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
      137.                              int *pnoinv)

crypto/bn/bn_x931p.c:94:10: Call
  92.           goto err;
  93.   
  94.       if (!BN_mul(p, p, p2, ctx))
                 ^
  95.           goto err;
  96.   

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

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

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

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

crypto/bn/bn_lib.c:733:1: Parameter `cl`
        731.    */
        732.   
        733. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        734.   {
        735.       int n, i;

crypto/bn/bn_lib.c:750:12: Call
        748.           }
        749.       }
        750.       return bn_cmp_words(a, b, cl);
                          ^
        751.   }
        752.   

crypto/bn/bn_lib.c:706:1: <Offset trace>
704.   }
705.   
706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
707.   {
708.       int i;

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

crypto/bn/bn_lib.c:715:10: Assignment
          713.       if (aa != bb)
          714.           return ((aa > bb) ? 1 : -1);
          715.       for (i = n - 2; i >= 0; i--) {
                          ^
          716.           aa = a[i];
          717.           bb = b[i];

crypto/bn/bn_lib.c:706:1: <Length trace>
704.   }
705.   
706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
707.   {
708.       int i;

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

crypto/bn/bn_lib.c:717:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_X931_derive_prime_ex` 
          715.       for (i = n - 2; i >= 0; i--) {
          716.           aa = a[i];
          717.           bb = b[i];
                              ^
          718.           if (aa != bb)
          719.               return ((aa > bb) ? 1 : -1);
