crypto/rsa/rsa_gen.c:131: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_generate_prime_ex`.
Showing all 16 steps of the trace


crypto/rsa/rsa_gen.c:88:1: Parameter `rsa->p->d`
86.   }
87.   
88. > static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value,
89.                                 BN_GENCB *cb)
90.   {

crypto/rsa/rsa_gen.c:131:14: Call
129.       /* generate p and q */
130.       for (;;) {
131.           if (!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
                    ^
132.               goto err;
133.           if (!BN_sub(r2, rsa->p, BN_value_one()))

crypto/bn/bn_prime.c:208:1: Parameter `*ret->d`
  206.   }
  207.   
  208. > int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
  209.                            const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
  210.   {

crypto/bn/bn_prime.c:245:18: Call
  243.       } else {
  244.           if (safe) {
  245.               if (!probable_prime_dh_safe(ret, bits, add, rem, ctx))
                          ^
  246.                   goto err;
  247.           } else {

crypto/bn/bn_prime.c:629:1: Parameter `*p->d`
    627.   }
    628.   
    629. > static int probable_prime_dh_safe(BIGNUM *p, int bits, const BIGNUM *padd,
    630.                                     const BIGNUM *rem, BN_CTX *ctx)
    631.   {

crypto/bn/bn_prime.c:665:10: Call
    663.   
    664.       /* we now have a random number 'rand' to test. */
    665.       if (!BN_lshift1(p, q))
                    ^
    666.           goto err;
    667.       if (!BN_add_word(p, 1))

crypto/bn/bn_shift.c:62:1: Parameter `*r->d`
      60.   #include "bn_lcl.h"
      61.   
      62. > int BN_lshift1(BIGNUM *r, const BIGNUM *a)
      63.   {
      64.       register BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:76:13: Call
      74.           r->top = a->top;
      75.       } else {
      76.           if (bn_wexpand(r, a->top + 1) == NULL)
                        ^
      77.               return (0);
      78.       }

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_lib.c:997:37: Call
        995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
        996.   {
        997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                    ^
        998.   }
        999.   

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
          388.    */
          389.   
          390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          391.   {
          392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
          393.   
          394.       if (words > b->dmax) {
          395.           BN_ULONG *a = bn_expand_internal(b, words);
                                       ^
          396.           if (!a)
          397.               return NULL;

crypto/bn/bn_lib.c:300:1: <Length trace>
298.   /* This is used by bn_expand2() */
299.   /* The caller MUST check that words > b->dmax before calling this */
300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
301.   {
302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:300:1: Parameter `*b->d`
            298.   /* This is used by bn_expand2() */
            299.   /* The caller MUST check that words > b->dmax before calling this */
            300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
            301.   {
            302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:335:5: Assignment
            333.   
            334.   #if 1
            335.       B = b->d;
                       ^
            336.       /* Check if the previous number needs to be copied */
            337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_generate_prime_ex` 
            350.               a1 = B[1];
            351.               a2 = B[2];
            352.               a3 = B[3];
                                    ^
            353.               A[0] = a0;
            354.               A[1] = a1;
