crypto/bn/bntest.c:389: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_div_recp`.
Showing all 16 steps of the trace


crypto/bn/bntest.c:383:3: Call
381.   	for (i=0; i<100; i++)
382.   		{
383.   		BN_rand(&b,50+i,0,0);
         ^
384.   		a.neg=rand_neg();
385.   		b.neg=rand_neg();

crypto/bn/bn_rand.c:65:1: Parameter `rnd->top`
  63.   #include <openssl/rand.h>
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:386:3: Call
384.   		a.neg=rand_neg();
385.   		b.neg=rand_neg();
386.   		BN_RECP_CTX_set(&recp,&b,ctx);
         ^
387.   		if (bp == NULL)
388.   			for (j=0; j<100; j++)

crypto/bn/bn_recp.c:94:1: Parameter `*recp->N.d`
  92.   	}
  93.   
  94. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, BIGNUM *d, BN_CTX *ctx)
  95.   	{
  96.   	BN_copy(&(recp->N),d);

crypto/bn/bn_recp.c:96:2: Call
  94.   int BN_RECP_CTX_set(BN_RECP_CTX *recp, BIGNUM *d, BN_CTX *ctx)
  95.   	{
  96.   	BN_copy(&(recp->N),d);
         ^
  97.   	BN_zero(&(recp->Nr));
  98.   	recp->num_bits=BN_num_bits(d);

crypto/bn/bn_lib.c:499:1: Parameter `*a->d`
    497.   	}
    498.   
    499. > BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b)
    500.   	{
    501.   	int i;

crypto/bn/bntest.c:389:5: Call
387.   		if (bp == NULL)
388.   			for (j=0; j<100; j++)
389.   				BN_div_recp(&d,&c,&a,&recp,ctx);
           ^
390.   		BN_div_recp(&d,&c,&a,&recp,ctx);
391.   		if (bp != NULL)

crypto/bn/bn_recp.c:127:1: Parameter `*recp->N.d`
  125.   	}
  126.   
  127. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BN_RECP_CTX *recp,
  128.   	     BN_CTX *ctx)
  129.   	{

crypto/bn/bn_recp.c:181:7: Call
  179.   	if (!BN_rshift(d,b,j+ex)) goto err;
  180.   	d->neg=0;
  181.   	if (!BN_mul(b,&(recp->N),d,ctx)) goto err;
               ^
  182.   	if (!BN_usub(r,m,b)) goto err;
  183.   	r->neg=0;

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:389:1: <Length trace>
387.   #endif
388.   
389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
390.           {
391.   	BN_ULONG t1,t2;

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

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