test/sslapitest.c:3897: error: BUFFER_OVERRUN_L3
  Offset: [31, +oo] Size: [0, 8388607] by call to `SRP_create_verifier_BN`.
Showing all 23 steps of the trace


test/sslapitest.c:3897:10: Call
3895.           goto end;
3896.   
3897.       if (!TEST_true(SRP_create_verifier_BN(userid, password, &salt, &verifier,
                 ^
3898.                                             lgN->N, lgN->g)))
3899.           goto end;

crypto/srp/srp_vfy.c:662:1: Parameter `g->top`
  660.    * BIGNUMS.
  661.    */
  662. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  663.                              BIGNUM **verifier, const BIGNUM *N,
  664.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:693:10: Call
  691.           goto err;
  692.   
  693.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  694.           BN_clear_free(*verifier);
  695.           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:761:17: Call
        759.           if (!BN_to_montgomery(&am, &am, mont, ctx))
        760.               goto err;
        761.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                               ^
        762.           goto err;
        763.   

crypto/bn/bn_lib.c:839:1: Parameter `a->top`
          837.   }
          838.   
          839. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
          840.                        BN_CTX *ctx)
          841.   {

crypto/bn/bn_lib.c:842:12: Call
          840.                        BN_CTX *ctx)
          841.   {
          842.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                            ^
          843.   }
          844.   

crypto/bn/bn_mont.c:26:1: Parameter `a->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:53:14: Call
            51.       bn_check_top(tmp);
            52.       if (a == b) {
            53.           if (!BN_sqr(tmp, a, ctx))
                               ^
            54.               goto err;
            55.       } 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:105:1: <Offset trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `n`
                103.   
                104.   /* tmp must have 2*n words */
                105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                106.   {
                107.       int i, j, max;

crypto/bn/bn_sqr.c:111:5: Assignment
                109.       BN_ULONG *rp;
                110.   
                111.       max = n * 2;
                           ^
                112.       ap = a;
                113.       rp = r;

crypto/bn/bn_sqr.c:105:1: <Length trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `*r`
                103.   
                104.   /* tmp must have 2*n words */
                105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
                106.   {
                107.       int i, j, max;

crypto/bn/bn_sqr.c:113:5: Assignment
                111.       max = n * 2;
                112.       ap = a;
                113.       rp = r;
                           ^
                114.       rp[0] = rp[max - 1] = 0;
                115.       rp++;

crypto/bn/bn_sqr.c:114:13: Array access: Offset: [31, +oo] Size: [0, 8388607] by call to `SRP_create_verifier_BN` 
                112.       ap = a;
                113.       rp = r;
                114.       rp[0] = rp[max - 1] = 0;
                                   ^
                115.       rp++;
                116.       j = n;
