crypto/dsa/dsa_vrf.c:89: error: BUFFER_OVERRUN_L3
  Offset: [12, +oo] (⇐ [8, +oo] + 4) Size: [0, +oo] by call to `BN_mod_mul`.
Showing all 12 steps of the trace


crypto/dsa/dsa_vrf.c:86:6: Call
84.   
85.   	/* save M in u1 */
86.   	if (BN_bin2bn(dgst,dgst_len,&u1) == NULL) goto err;
           ^
87.   
88.   	/* u1 = M * w mod q */

crypto/bn/bn_lib.c:574:1: Parameter `*ret->d`
  572.   
  573.   /* ignore negative */
  574. > BIGNUM *BN_bin2bn(unsigned char *s, int len, BIGNUM *ret)
  575.   	{
  576.   	unsigned int i,m;

crypto/dsa/dsa_vrf.c:89:7: Call
87.   
88.   	/* u1 = M * w mod q */
89.   	if (!BN_mod_mul(&u1,&u1,&u2,dsa->q,ctx)) goto err;
            ^
90.   
91.   	/* u2 = r * w mod q */

crypto/bn/bn_exp.c:66:1: Parameter `*a->d`
  64.   
  65.   /* slow but works */
  66. > int BN_mod_mul(BIGNUM *ret, BIGNUM *a, BIGNUM *b, BIGNUM *m, BN_CTX *ctx)
  67.   	{
  68.   	BIGNUM *t;

crypto/bn/bn_exp.c:79:10: Call
  77.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
  78.   	else
  79.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                 ^
  80.   	if (!BN_mod(ret,t,m,ctx)) goto err;
  81.   	r=1;

crypto/bn/bn_mul.c:560:1: Parameter `*a->d`
    558.   #endif
    559.   
    560. > int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx)
    561.   	{
    562.   	int top,al,bl;

crypto/bn/bn_mul.c:686:4: Call
    684.   			for (i=b->top; i<k; i++)
    685.   				b->d[i]=0;
    686.   			bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
              ^
    687.   			}
    688.   		rr->top=top;

crypto/bn/bn_mul.c:218:1: Parameter `n`
      216.   /* n+tn is the word length
      217.    * t needs to be n*4 is size, as does r */
      218. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
      219.   	     int n, BN_ULONG *t)
      220.   	{

crypto/bn/bn_mul.c:250:3: Call
      248.   		bn_mul_comba8(&(t[n2]),t,&(t[n]));
      249.   		bn_mul_comba8(r,a,b);
      250.   		bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn);
               ^
      251.   		memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
      252.   		}

crypto/bn/bn_mul.c:699:1: <Length trace>
697.   	}
698.   
699. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
700.   	{
701.   	BN_ULONG *rr;

crypto/bn/bn_mul.c:699:1: Parameter `*b`
        697.   	}
        698.   
        699. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        700.   	{
        701.   	BN_ULONG *rr;

crypto/bn/bn_mul.c:728:39: Array access: Offset: [12, +oo] (⇐ [8, +oo] + 4) Size: [0, +oo] by call to `BN_mod_mul` 
        726.   		rr[3]=bn_mul_add_words(&(r[3]),a,na,b[3]);
        727.   		if (--nb <= 0) return;
        728.   		rr[4]=bn_mul_add_words(&(r[4]),a,na,b[4]);
                                                     ^
        729.   		rr+=4;
        730.   		r+=4;
