test/srptest.c:177: 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/srptest.c:177:10: Call
175.       BN_hex2bn(&s, "BEB25379D1A8581EB5A727673A2441EE");
176.       /* Set up server's password entry */
177.       if (!TEST_true(SRP_create_verifier_BN("alice", "password123", &s, &v, GN->N,
                ^
178.                                   GN->g)))
179.           goto err;

crypto/srp/srp_vfy.c:633:1: Parameter `g->top`
  631.    * BIGNUMS.
  632.    */
  633. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  634.                              BIGNUM **verifier, const BIGNUM *N,
  635.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:664:10: Call
  662.           goto err;
  663.   
  664.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  665.           BN_clear_free(*verifier);
  666.           goto err;

crypto/bn/bn_exp.c:91:1: Parameter `a->top`
    89.   }
    90.   
    91. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
    92.                  BN_CTX *ctx)
    93.   {

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:294:1: Parameter `a->top`
      292.   }
      293.   
      294. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      295.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      296.   {

crypto/bn/bn_exp.c:306:16: Call
      304.   
      305.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
      306.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      307.       }
      308.   

crypto/bn/bn_exp.c:594:1: Parameter `a->top`
        592.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        593.    */
        594. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        595.                                 const BIGNUM *m, BN_CTX *ctx,
        596.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:751:17: Call
        749.           if (!BN_to_montgomery(&am, &am, mont, ctx))
        750.               goto err;
        751.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                               ^
        752.           goto err;
        753.   

crypto/bn/bn_lib.c:877:1: Parameter `a->top`
          875.   }
          876.   
          877. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
          878.                        BN_CTX *ctx)
          879.   {

crypto/bn/bn_lib.c:880:12: Call
          878.                        BN_CTX *ctx)
          879.   {
          880.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                            ^
          881.   }
          882.   

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;
