crypto/bn/bntest.c:349: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mul`.
Showing all 15 steps of the trace


crypto/bn/bntest.c:320:3: Call
318.   	for (i=0; i<100; i++)
319.   		{
320.   		BN_rand(&b,50+i,0,0);
         ^
321.   		a.neg=rand_neg();
322.   		b.neg=rand_neg();

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  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:349:3: Call
347.   			BIO_puts(bp,"\n");
348.   			}
349.   		BN_mul(&e,&d,&b,ctx);
         ^
350.   		BN_add(&d,&e,&c);
351.   		BN_sub(&d,&d,&a);

crypto/bn/bn_mul.c:560:1: Parameter `*b->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:264:4: Call
    262.   		if (j == 0)
    263.   			{
    264.   			bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),i,p);
              ^
    265.   			memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
    266.   			}

crypto/bn/bn_mul.c:74:1: Parameter `*b`
      72.    * a[1]*b[1]
      73.    */
      74. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      75.   	     BN_ULONG *t)
      76.   	{

crypto/bn/bn_mul.c:104:5: Call
      102.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
      103.   	c1=bn_cmp_words(a,&(a[n]),n);
      104.   	c2=bn_cmp_words(&(b[n]),b,n);
                 ^
      105.   	zero=neg=0;
      106.   	switch (c1*3+c2)

crypto/bn/bn_lib.c:769:1: <Offset trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `n`
        767.   	}
        768.   
        769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
        770.   	{
        771.   	int i;

crypto/bn/bn_lib.c:777:7: Assignment
        775.   	bb=b[n-1];
        776.   	if (aa != bb) return((aa > bb)?1:-1);
        777.   	for (i=n-2; i>=0; i--)
                     ^
        778.   		{
        779.   		aa=a[i];

crypto/bn/bn_lib.c:769:1: <Length trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `*b`
        767.   	}
        768.   
        769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
        770.   	{
        771.   	int i;

crypto/bn/bn_lib.c:780:6: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mul` 
        778.   		{
        779.   		aa=a[i];
        780.   		bb=b[i];
                    ^
        781.   		if (aa != bb) return((aa > bb)?1:-1);
        782.   		}
