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


crypto/bn/bntest.c:445:2: Call
443.   	BN_init(&e);
444.   
445.   	BN_rand(&a,200,0,0);
        ^
446.   	for (i=0; i<100; i++)
447.   		{

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:454:5: Call
452.   		if (bp == NULL)
453.   			for (j=0; j<100; j++)
454.   				BN_mul(&c,&a,&b,&ctx);
           ^
455.   		BN_mul(&c,&a,&b,&ctx);
456.   		if (bp != NULL)

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_mul` 
      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);
