crypto/dh/dh_key.c:109: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_rand`.
Showing all 16 steps of the trace


crypto/dh/dh_key.c:64:1: Parameter `dh->priv_key->d`
62.   }
63.   
64. > static int generate_key(DH *dh)
65.   {
66.       int ok = 0;

crypto/dh/dh_key.c:109:18: Call
107.               /* secret exponent length */
108.               l = dh->length ? dh->length : BN_num_bits(dh->p) - 1;
109.               if (!BN_rand(priv_key, l, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))
                        ^
110.                   goto err;
111.           }

crypto/bn/bn_rand.c:96:1: Parameter `*rnd->d`
  94.   }
  95.   
  96. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  97.   {
  98.       return bnrand(0, rnd, bits, top, bottom);

crypto/bn/bn_rand.c:98:12: Call
  96.   int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  97.   {
  98.       return bnrand(0, rnd, bits, top, bottom);
                    ^
  99.   }
  100.   

crypto/bn/bn_rand.c:17:1: Parameter `*rnd->d`
    15.   #include <openssl/sha.h>
    16.   
    17. > static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom)
    18.   {
    19.       unsigned char *buf = NULL;

crypto/bn/bn_rand.c:26:9: Call
    24.           if (top != BN_RAND_TOP_ANY || bottom != BN_RAND_BOTTOM_ANY)
    25.               goto toosmall;
    26.           BN_zero(rnd);
                  ^
    27.           return 1;
    28.       }

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
      461.   }
      462.   
      463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
      464.   {
      465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
      464.   {
      465.       bn_check_top(a);
      466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                     ^
      467.           return (0);
      468.       a->neg = 0;

crypto/bn/bn_lcl.h:676:1: Parameter `*a->d`
        674.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
        675.   
        676. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
        677.   {
        678.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_lcl.h:684:12: Call
        682.           return a;
        683.   
        684.       return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);
                          ^
        685.   }
        686.   

crypto/bn/bn_lib.c:323:1: Parameter `*b->d`
          321.    */
          322.   
          323. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          324.   {
          325.       bn_check_top(b);

crypto/bn/bn_lib.c:328:23: Call
          326.   
          327.       if (words > b->dmax) {
          328.           BN_ULONG *a = bn_expand_internal(b, words);
                                       ^
          329.           if (!a)
          330.               return NULL;

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

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

crypto/bn/bn_lib.c:272:5: Assignment
            270.   
            271.   #if 1
            272.       B = b->d;
                       ^
            273.       /* Check if the previous number needs to be copied */
            274.       if (B != NULL) {

crypto/bn/bn_lib.c:289:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_rand` 
            287.               a1 = B[1];
            288.               a2 = B[2];
            289.               a3 = B[3];
                                    ^
            290.               A[0] = a0;
            291.               A[1] = a1;
