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


crypto/bn/bntest.c:674:2: Call
672.   	e=BN_new();
673.   
674.   	BN_rand(c,1024,0,0); /**/
        ^
675.   	for (i=0; i<10; i++)
676.   		{

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:677:3: Call
675.   	for (i=0; i<10; i++)
676.   		{
677.   		BN_rand(a,475+i*10,0,0); /**/
         ^
678.   		BN_rand(b,425+i*10,0,0); /**/
679.   		a->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:678:3: Call
676.   		{
677.   		BN_rand(a,475+i*10,0,0); /**/
678.   		BN_rand(b,425+i*10,0,0); /**/
         ^
679.   		a->neg=rand_neg();
680.   		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:685:8: Call
683.   				BN_mod_mul(d,a,b,c,ctx);*/ /**/
684.   
685.   		if (!BN_mod_mul(e,a,b,c,ctx))
              ^
686.   			{
687.   			unsigned long l;

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:77:10: Call
  75.   	t= &(ctx->bn[ctx->tos++]);
  76.   	if (a == b)
  77.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
                 ^
  78.   	else
  79.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }

crypto/bn/bn_sqr.c:65:1: Parameter `*a->d`
    63.   /* r must not be a */
    64.   /* I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96 */
    65. > int BN_sqr(BIGNUM *r, BIGNUM *a, BN_CTX *ctx)
    66.   	{
    67.   	int max,al;

crypto/bn/bntest.c:708:3: Call
706.   			BIO_puts(bp,"\n");
707.   			}
708.   		BN_mul(d,a,b,ctx);
         ^
709.   		BN_sub(d,d,e);
710.   		BN_div(a,b,d,c,ctx);

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:237:2: Call
    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.   
    239.   /*	if (n == 4)

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_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);
