apps/gendsa.c:128: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `DSA_generate_key`.
Showing all 38 steps of the trace


apps/gendsa.c:121:9: Call
119.       DSA_get0_pqg(dsa, &p, NULL, NULL);
120.   
121.       if (BN_num_bits(p) > OPENSSL_DSA_MAX_MODULUS_BITS)
               ^
122.           BIO_printf(bio_err,
123.                      "Warning: It is not recommended to use more than %d bit for DSA keys.\n"

crypto/bn/bn_lib.c:139:9: Call
  137.       bn_check_top(a);
  138.   
  139.       if (BN_is_zero(a))
                 ^
  140.           return 0;
  141.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:846:1: Parameter `a->top`
    844.   }
    845.   
    846. > int BN_is_zero(const BIGNUM *a)
    847.   {
    848.       return a->top == 0;

apps/gendsa.c:127:58: Call
125.                      OPENSSL_DSA_MAX_MODULUS_BITS, BN_num_bits(p));
126.   
127.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
                                                                ^
128.       if (!DSA_generate_key(dsa))
129.           goto end;

crypto/bn/bn_lib.c:139:9: Call
  137.       bn_check_top(a);
  138.   
  139.       if (BN_is_zero(a))
                 ^
  140.           return 0;
  141.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:846:1: Parameter `a->top`
    844.   }
    845.   
    846. > int BN_is_zero(const BIGNUM *a)
    847.   {
    848.       return a->top == 0;

apps/gendsa.c:128:10: Call
126.   
127.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
128.       if (!DSA_generate_key(dsa))
                ^
129.           goto end;
130.   

crypto/dsa/dsa_key.c:18:1: Parameter `dsa->p->top`
  16.   static int dsa_builtin_keygen(DSA *dsa);
  17.   
  18. > int DSA_generate_key(DSA *dsa)
  19.   {
  20.       if (dsa->meth->dsa_keygen)

crypto/dsa/dsa_key.c:22:12: Call
  20.       if (dsa->meth->dsa_keygen)
  21.           return dsa->meth->dsa_keygen(dsa);
  22.       return dsa_builtin_keygen(dsa);
                   ^
  23.   }
  24.   

crypto/dsa/dsa_key.c:25:1: Parameter `dsa->p->top`
    23.   }
    24.   
    25. > static int dsa_builtin_keygen(DSA *dsa)
    26.   {
    27.       int ok = 0;

crypto/dsa/dsa_key.c:58:14: Call
    56.           BN_with_flags(prk, priv_key, BN_FLG_CONSTTIME);
    57.   
    58.           if (!BN_mod_exp(pub_key, dsa->g, prk, dsa->p, ctx)) {
                       ^
    59.               BN_free(prk);
    60.               goto err;

crypto/bn/bn_exp.c:89:1: Parameter `m->top`
      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:134:9: Call
      132.   
      133.   #ifdef MONT_MUL_MOD
      134.       if (BN_is_odd(m)) {
                     ^
      135.   # ifdef MONT_EXP_WORD
      136.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:861:1: Parameter `a->top`
        859.   }
        860.   
        861. > int BN_is_odd(const BIGNUM *a)
        862.   {
        863.       return (a->top > 0) && (a->d[0] & 1);

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 `m->top`
        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:310:16: Call
        308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
        309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
        310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                              ^
        311.       }
        312.   

crypto/bn/bn_exp.c:745:14: Assignment
          743.           /* 2^(top*BN_BITS2) - m */
          744.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
          745.           for (i = 1; i < top; i++)
                              ^
          746.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
          747.           tmp.top = top;

crypto/bn/bn_exp.c:1062:14: Call
          1060.           bits -= window0;
          1061.           wvalue = bn_get_bits(p, bits) & wmask;
          1062.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                               ^
          1063.                                               window))
          1064.               goto err;

crypto/bn/bn_exp.c:520:1: Parameter `top`
            518.   }
            519.   
            520. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
            521.                                             unsigned char *buf, int idx,
            522.                                             int window)

crypto/bn/bn_exp.c:577:5: Assignment
            575.       }
            576.   
            577.       b->top = top;
                       ^
            578.       bn_correct_top(b);
            579.       return 1;

crypto/bn/bn_exp.c:578:5: Call
            576.   
            577.       b->top = top;
            578.       bn_correct_top(b);
                       ^
            579.       return 1;
            580.   }

crypto/bn/bn_lib.c:947:1: Parameter `a->top`
              945.   }
              946.   
              947. > void bn_correct_top(BIGNUM *a)
              948.   {
              949.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1075:22: Call
          1073.               /* Square the result window-size times */
          1074.               for (i = 0; i < window; i++)
          1075.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                       ^
          1076.                       goto err;
          1077.   

crypto/bn/bn_mont.c:26:1: Parameter `b->top`
            24.   #endif
            25.   
            26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
            27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
            28.   {

crypto/bn/bn_mont.c:56:14: Call
            54.       bn_check_top(tmp);
            55.       if (a == b) {
            56.           if (!BN_sqr(tmp, a, ctx))
                               ^
            57.               goto err;
            58.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
              15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
              16.    */
              17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
              18.   {
              19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
              23.       bn_check_top(a);
              24.   
              25.       al = a->top;
                        ^
              26.       if (al <= 0) {
              27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
              72.                   if (bn_wexpand(tmp, max) == NULL)
              73.                       goto err;
              74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                    ^
              75.               }
              76.           }

crypto/bn/bn_sqr.c:99:1: <Offset trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `n`
                97.   
                98.   /* tmp must have 2*n words */
                99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                100.   {
                101.       int i, j, max;

crypto/bn/bn_sqr.c:110:5: Assignment
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;
                110.       j = n;
                           ^
                111.   
                112.       if (--j > 0) {

crypto/bn/bn_sqr.c:112:9: Assignment
                110.       j = n;
                111.   
                112.       if (--j > 0) {
                               ^
                113.           ap++;
                114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:99:1: <Length trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `*r`
                97.   
                98.   /* tmp must have 2*n words */
                99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                100.   {
                101.       int i, j, max;

crypto/bn/bn_sqr.c:107:5: Assignment
                105.       max = n * 2;
                106.       ap = a;
                107.       rp = r;
                           ^
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;

crypto/bn/bn_sqr.c:109:5: Assignment
                107.       rp = r;
                108.       rp[0] = rp[max - 1] = 0;
                109.       rp++;
                           ^
                110.       j = n;
                111.   

crypto/bn/bn_sqr.c:114:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `DSA_generate_key` 
                112.       if (--j > 0) {
                113.           ap++;
                114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                               ^
                115.           rp += 2;
                116.       }
