crypto/dsa/dsa_gen.c:600: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont`.
Showing all 23 steps of the trace


crypto/dsa/dsa_gen.c:425:10: Call
423.       }
424.   
425.       if (!BN_lshift(test, BN_value_one(), L - 1))
                ^
426.           goto err;
427.       for (;;) {

crypto/bn/bn_shift.c:130:1: Parameter `r->top`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/dsa/dsa_gen.c:600:14: Call
598.           }
599.           /* g=test^r0%p */
600.           if (!BN_mod_exp_mont(g, test, r0, p, ctx, mont))
                    ^
601.               goto err;
602.           if (!BN_is_one(g))

crypto/bn/bn_exp.c:401:1: Parameter `a->top`
  399.   }
  400.   
  401. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  402.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  403.   {

crypto/bn/bn_exp.c:413:16: Call
  411.   
  412.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
  413.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                        ^
  414.       }
  415.   

crypto/bn/bn_exp.c:655:1: Parameter `a->top`
    653.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
    654.    */
    655. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    656.                                 const BIGNUM *m, BN_CTX *ctx,
    657.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:812:17: Call
    810.           if (!BN_to_montgomery(&am, &am, mont, ctx))
    811.               goto err;
    812.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                           ^
    813.           goto err;
    814.   

crypto/bn/bn_lib.c:924:1: Parameter `a->top`
      922.   }
      923.   
      924. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      925.                        BN_CTX *ctx)
      926.   {

crypto/bn/bn_lib.c:927:12: Call
      925.                        BN_CTX *ctx)
      926.   {
      927.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                        ^
      928.   }
      929.   

crypto/bn/bn_mont.c:128:1: Parameter `a->top`
        126.   #endif
        127.   
        128. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        129.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        130.   {

crypto/bn/bn_mont.c:155:14: Call
        153.       bn_check_top(tmp);
        154.       if (a == b) {
        155.           if (!BN_sqr(tmp, a, ctx))
                            ^
        156.               goto err;
        157.       } else {

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

crypto/bn/bn_sqr.c:74:5: Assignment
          72.       bn_check_top(a);
          73.   
          74.       al = a->top;
                    ^
          75.       if (al <= 0) {
          76.           r->top = 0;

crypto/bn/bn_sqr.c:123:17: Call
          121.                   if (bn_wexpand(tmp, max) == NULL)
          122.                       goto err;
          123.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                 ^
          124.               }
          125.           }

crypto/bn/bn_sqr.c:153:1: <Offset trace>
151.   
152.   /* tmp must have 2*n words */
153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
154.   {
155.       int i, j, max;

crypto/bn/bn_sqr.c:153:1: Parameter `n`
            151.   
            152.   /* tmp must have 2*n words */
            153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            154.   {
            155.       int i, j, max;

crypto/bn/bn_sqr.c:164:5: Assignment
            162.       rp[0] = rp[max - 1] = 0;
            163.       rp++;
            164.       j = n;
                       ^
            165.   
            166.       if (--j > 0) {

crypto/bn/bn_sqr.c:166:9: Assignment
            164.       j = n;
            165.   
            166.       if (--j > 0) {
                           ^
            167.           ap++;
            168.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:153:1: <Length trace>
151.   
152.   /* tmp must have 2*n words */
153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
154.   {
155.       int i, j, max;

crypto/bn/bn_sqr.c:153:1: Parameter `*r`
            151.   
            152.   /* tmp must have 2*n words */
            153. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            154.   {
            155.       int i, j, max;

crypto/bn/bn_sqr.c:161:5: Assignment
            159.       max = n * 2;
            160.       ap = a;
            161.       rp = r;
                       ^
            162.       rp[0] = rp[max - 1] = 0;
            163.       rp++;

crypto/bn/bn_sqr.c:163:5: Assignment
            161.       rp = r;
            162.       rp[0] = rp[max - 1] = 0;
            163.       rp++;
                       ^
            164.       j = n;
            165.   

crypto/bn/bn_sqr.c:168:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont` 
            166.       if (--j > 0) {
            167.           ap++;
            168.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                           ^
            169.           rp += 2;
            170.       }
