apps/gendsa.c:120: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `DSA_generate_key`.
Showing all 25 steps of the trace


apps/gendsa.c:119:58: Call
117.   
118.       DSA_get0_pqg(dsa, &p, NULL, NULL);
119.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
                                                                ^
120.       if (!DSA_generate_key(dsa))
121.           goto end;

crypto/bn/bn_lib.c:166:9: Call
  164.       bn_check_top(a);
  165.   
  166.       if (BN_is_zero(a))
                 ^
  167.           return 0;
  168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

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

apps/gendsa.c:120:10: Call
118.       DSA_get0_pqg(dsa, &p, NULL, NULL);
119.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
120.       if (!DSA_generate_key(dsa))
                ^
121.           goto end;
122.   

crypto/dsa/dsa_key.c:18:1: Parameter `dsa->g->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->g->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 `a->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: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 `a->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:598:1: Parameter `a->top`
          596.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
          597.    */
          598. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
          599.                                 const BIGNUM *m, BN_CTX *ctx,
          600.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:751:14: Call
          749.       /* prepare a^1 in Montgomery domain */
          750.       if (a->neg || BN_ucmp(a, m) >= 0) {
          751.           if (!BN_mod(&am, a, m, ctx))
                              ^
          752.               goto err;
          753.           if (!BN_to_montgomery(&am, &am, mont, ctx))

crypto/bn/bn_div.c:137:1: Parameter `num->top`
            135.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            136.    */
            137. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            138.              BN_CTX *ctx)
            139.   {

crypto/bn/bn_div.c:204:11: Call
            202.       sdiv->neg = 0;
            203.       norm_shift += BN_BITS2;
            204.       if (!(BN_lshift(snum, num, norm_shift)))
                             ^
            205.           goto err;
            206.       snum->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
              81.   }
              82.   
              83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
              84.   {
              85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
              95.       }
              96.   
              97.       nw = n / BN_BITS2;
                         ^
              98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
              99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
              81.   }
              82.   
              83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
              84.   {
              85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
              96.   
              97.       nw = n / BN_BITS2;
              98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                             ^
              99.           return 0;
              100.       r->neg = a->neg;

crypto/bn/bn_lib.c:940:1: Parameter `*a->d`
                938.   }
                939.   
                940. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
                941.   {
                942.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
              102.       rb = BN_BITS2 - lb;
              103.       f = a->d;
              104.       t = r->d;
                         ^
              105.       t[a->top + nw] = 0;
              106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `DSA_generate_key` 
              110.           for (i = a->top - 1; i >= 0; i--) {
              111.               l = f[i];
              112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                                 ^
              113.               t[nw + i] = (l << lb) & BN_MASK2;
              114.           }
