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


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

crypto/bn/bn_lib.c:595:1: Parameter `*ret->d`
  593.   
  594.   /* ignore negative */
  595. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
  596.   	{
  597.   	unsigned int i,m;

crypto/dsa/dsa_vrf.c:90:7: Call
88.   
89.   	/* u1 = M * w mod q */
90.   	if (!BN_mod_mul(&u1,&u1,&u2,dsa->q,ctx)) goto err;
            ^
91.   
92.   	/* 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, const 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:236:2: Call
      234.   
      235.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
      236.   	bn_sub_words(t,      a,      &(a[n]),n); /* + */
              ^
      237.   	bn_sub_words(&(t[n]),b,      &(b[n]),n); /* - */
      238.   

crypto/bn/bn_asm.c:390:1: <Length trace>
388.   #endif
389.   
390. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
391.           {
392.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:390:1: Parameter `*b`
        388.   #endif
        389.   
        390. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
        391.           {
        392.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:405:15: Array access: Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_mod_mul` 
        403.   		if (--n <= 0) break;
        404.   
        405.   		t1=a[1]; t2=b[1];
                             ^
        406.   		r[1]=(t1-t2-c)&BN_MASK2;
        407.   		if (t1 != t2) c=(t1 < t2);
