test/srptest.c:169: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `SRP_Calc_B`.
Showing all 19 steps of the trace


test/srptest.c:150:10: Call
148.       BN_hex2bn(&s, "BEB25379D1A8581EB5A727673A2441EE");
149.       /* Set up server's password entry */
150.       if (!TEST_true(SRP_create_verifier_BN("alice", "password123", &s, &v, GN->N,
                ^
151.                                             GN->g)))
152.           goto err;

crypto/srp/srp_vfy.c:668:1: Parameter `(*salt)->top`
  666.    * BIGNUMS.
  667.    */
  668. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  669.                              BIGNUM **verifier, const BIGNUM *N,
  670.                              const BIGNUM *g)

test/srptest.c:169:12: Call
167.   
168.       /* Server's first message */
169.       Bpub = SRP_Calc_B(b, GN->N, GN->g, v);
                  ^
170.       if (!TEST_true(SRP_Verify_B_mod_N(Bpub, GN->N)))
171.           goto err;

crypto/srp/srp_lib.c:87:1: Parameter `v->top`
  85.   }
  86.   
  87. > BIGNUM *SRP_Calc_B(const BIGNUM *b, const BIGNUM *N, const BIGNUM *g,
  88.                      const BIGNUM *v)
  89.   {

crypto/srp/srp_lib.c:106:13: Call
  104.       if (!BN_mod_exp(gb, g, b, N, bn_ctx)
  105.           || (k = srp_Calc_k(N, g)) == NULL
  106.           || !BN_mod_mul(kv, v, k, N, bn_ctx)
                     ^
  107.           || !BN_mod_add(B, gb, kv, N, bn_ctx)) {
  108.           BN_free(B);

crypto/bn/bn_mod.c:73:1: Parameter `a->top`
    71.   
    72.   /* slow but works */
    73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
    74.                  BN_CTX *ctx)
    75.   {

crypto/bn/bn_mod.c:87:14: Call
    85.           goto err;
    86.       if (a == b) {
    87.           if (!BN_sqr(t, a, ctx))
                       ^
    88.               goto err;
    89.       } 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 `SRP_Calc_B` 
        112.       if (--j > 0) {
        113.           ap++;
        114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                       ^
        115.           rp += 2;
        116.       }
