test/srptest.c:68: 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:63:9: Call
61.       /* Server random */
62.       RAND_bytes(rand_tmp, sizeof(rand_tmp));
63.       b = BN_bin2bn(rand_tmp, sizeof(rand_tmp), NULL);
              ^
64.       /* TODO - check b != 0 */
65.       showbn("b", b);

crypto/bn/bn_lib.c:559:9: Assignment
  557.       n = len;
  558.       if (n == 0) {
  559.           ret->top = 0;
                 ^
  560.           return (ret);
  561.       }

test/srptest.c:68:12: Call
66.   
67.       /* Server's first message */
68.       Bpub = SRP_Calc_B(b, GN->N, GN->g, v);
                 ^
69.       showbn("B", Bpub);
70.   

crypto/srp/srp_lib.c:175:1: Parameter `v->top`
  173.   }
  174.   
  175. > BIGNUM *SRP_Calc_B(BIGNUM *b, BIGNUM *N, BIGNUM *g, BIGNUM *v)
  176.   {
  177.       BIGNUM *kv = NULL, *gb = NULL;

crypto/srp/srp_lib.c:193:13: Call
  191.       if (!BN_mod_exp(gb, g, b, N, bn_ctx)
  192.           || (k = srp_Calc_k(N, g)) == NULL
  193.           || !BN_mod_mul(kv, v, k, N, bn_ctx)
                     ^
  194.           || !BN_mod_add(B, gb, kv, N, bn_ctx)) {
  195.           BN_free(B);

crypto/bn/bn_mod.c:179:1: Parameter `a->top`
    177.   
    178.   /* slow but works */
    179. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
    180.                  BN_CTX *ctx)
    181.   {

crypto/bn/bn_mod.c:193:14: Call
    191.           goto err;
    192.       if (a == b) {
    193.           if (!BN_sqr(t, a, ctx))
                        ^
    194.               goto err;
    195.       } 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 `SRP_Calc_B` 
        166.       if (--j > 0) {
        167.           ap++;
        168.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                       ^
        169.           rp += 2;
        170.       }
