crypto/bn/bn_prime.c:497: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_add`.
Showing all 34 steps of the trace


crypto/bn/bn_prime.c:461:1: Parameter `rnd->top`
459.   }
460.   
461. > int bn_probable_prime_dh(BIGNUM *rnd, int bits,
462.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx)
463.   {

crypto/bn/bn_prime.c:471:10: Call
469.           goto err;
470.   
471.       if (!BN_rand(rnd, bits, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD))
                ^
472.           goto err;
473.   

crypto/bn/bn_rand.c:114:1: Parameter `rnd->top`
  112.   }
  113.   
  114. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  115.   {
  116.       return bnrand(NORMAL, rnd, bits, top, bottom);

crypto/bn/bn_rand.c:116:12: Call
  114.   int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  115.   {
  116.       return bnrand(NORMAL, rnd, bits, top, bottom);
                    ^
  117.   }
  118.   

crypto/bn/bn_rand.c:23:1: Parameter `rnd->top`
    21.   } BNRAND_FLAG;
    22.   
    23. > static int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom)
    24.   {
    25.       unsigned char *buf = NULL;

crypto/bn/bn_prime.c:476:10: Call
474.       /* we need ((rnd-rem) % add) == 0 */
475.   
476.       if (!BN_mod(t1, rnd, add, ctx))
                ^
477.           goto err;
478.       if (!BN_sub(rnd, rnd, t1))

crypto/bn/bn_div.c:209:1: Parameter `num->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_prime.c:478:10: Call
476.       if (!BN_mod(t1, rnd, add, ctx))
477.           goto err;
478.       if (!BN_sub(rnd, rnd, t1))
                ^
479.           goto err;
480.       if (rem == NULL) {

crypto/bn/bn_add.c:45:1: Parameter `a->top`
  43.   
  44.   /* signed sub of b from a. */
  45. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  46.   {
  47.       int ret, r_neg, cmp_res;

crypto/bn/bn_prime.c:481:14: Call
479.           goto err;
480.       if (rem == NULL) {
481.           if (!BN_add_word(rnd, 1))
                    ^
482.               goto err;
483.       } else {

crypto/bn/bn_word.c:98:1: Parameter `a->top`
  96.   }
  97.   
  98. > int BN_add_word(BIGNUM *a, BN_ULONG w)
  99.   {
  100.       BN_ULONG l;

crypto/bn/bn_prime.c:493:24: Call
491.       for (i = 1; i < NUMPRIMES; i++) {
492.           /* check that rnd is a prime */
493.           BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
                              ^
494.           if (mod == (BN_ULONG)-1)
495.               goto err;

crypto/bn/bn_word.c:13:1: Parameter `a->top`
  11.   #include "bn_lcl.h"
  12.   
  13. > BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w)
  14.   {
  15.   #ifndef BN_LLONG

crypto/bn/bn_prime.c:497:18: Call
495.               goto err;
496.           if (mod <= 1) {
497.               if (!BN_add(rnd, rnd, add))
                        ^
498.                   goto err;
499.               goto loop;

crypto/bn/bn_add.c:14:1: Parameter `r->top`
  12.   
  13.   /* signed add of b to a. */
  14. > int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  15.   {
  16.       int ret, r_neg, cmp_res;

crypto/bn/bn_add.c:34:13: Call
  32.           } else {
  33.               r_neg = 0;
  34.               BN_zero(r);
                    ^
  35.               ret = 1;
  36.           }

crypto/bn/bn_lib.c:361:1: Parameter `a->top`
    359.   }
    360.   
    361. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    362.   {
    363.       bn_check_top(a);

crypto/bn/bn_lib.c:364:9: Call
    362.   {
    363.       bn_check_top(a);
    364.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    365.           return 0;
    366.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `a->top`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_lcl.h:668:12: Call
      666.           return a;
      667.   
      668.       return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);
                        ^
      669.   }
      670.   

crypto/bn/bn_lib.c:245:1: Parameter `b->top`
        243.    */
        244.   
        245. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        246.   {
        247.       if (words > b->dmax) {

crypto/bn/bn_lib.c:248:23: Call
        246.   {
        247.       if (words > b->dmax) {
        248.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        249.           if (!a)
        250.               return NULL;

crypto/bn/bn_lib.c:209:1: <Offset trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `b->top`
          207.   /* This is used by bn_expand2() */
          208.   /* The caller MUST check that words > b->dmax before calling this */
          209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          210.   {
          211.       BN_ULONG *a = NULL;

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

crypto/bn/bn_lib.c:209:1: Parameter `words`
          207.   /* This is used by bn_expand2() */
          208.   /* The caller MUST check that words > b->dmax before calling this */
          209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          210.   {
          211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:224:13: Call
          222.           a = OPENSSL_secure_zalloc(words * sizeof(*a));
          223.       else
          224.           a = OPENSSL_zalloc(words * sizeof(*a));
                             ^
          225.       if (a == NULL) {
          226.           BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);

crypto/mem.c:228:1: Parameter `num`
            226.   }
            227.   
            228. > void *CRYPTO_zalloc(size_t num, const char *file, int line)
            229.   {
            230.       void *ret = CRYPTO_malloc(num, file, line);

crypto/mem.c:230:17: Call
            228.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
            229.   {
            230.       void *ret = CRYPTO_malloc(num, file, line);
                                   ^
            231.   
            232.       FAILTEST();

crypto/mem.c:201:9: Assignment
              199.   
              200.       if (num == 0)
              201.           return NULL;
                             ^
              202.   
              203.       FAILTEST();

crypto/mem.c:230:5: Assignment
            228.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
            229.   {
            230.       void *ret = CRYPTO_malloc(num, file, line);
                       ^
            231.   
            232.       FAILTEST();

crypto/mem.c:235:5: Assignment
            233.       if (ret != NULL)
            234.           memset(ret, 0, num);
            235.       return ret;
                       ^
            236.   }
            237.   

crypto/bn/bn_lib.c:224:9: Assignment
          222.           a = OPENSSL_secure_zalloc(words * sizeof(*a));
          223.       else
          224.           a = OPENSSL_zalloc(words * sizeof(*a));
                         ^
          225.       if (a == NULL) {
          226.           BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);

crypto/bn/bn_lib.c:232:9: Array access: Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_add` 
          230.       assert(b->top <= words);
          231.       if (b->top > 0)
          232.           memcpy(a, b->d, sizeof(*a) * b->top);
                         ^
          233.   
          234.       return a;
