crypto/rsa/rsa_chk.c:98: error: BUFFER_OVERRUN_L1
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: 4 by call to `BN_mul`.
Showing all 11 steps of the trace


crypto/rsa/rsa_chk.c:67:6: Call
65.   	k = BN_new();
66.   	l = BN_new();
67.   	m = BN_new();
           ^
68.   	ctx = BN_CTX_new();
69.   	if (i == NULL || j == NULL || k == NULL || l == NULL ||

crypto/bn/bn_lib.c:300:2: Assignment
  298.   		}
  299.   	ret->flags=BN_FLG_MALLOCED;
  300.   	ret->top=0;
          ^
  301.   	ret->neg=0;
  302.   	ret->max=0;

crypto/rsa/rsa_chk.c:98:6: Call
96.   	
97.   	/* n = p*q? */
98.   	r = BN_mul(i, key->p, key->q, ctx);
            ^
99.   	if (!r) { ret = -1; goto err; }
100.   	

crypto/bn/bn_mul.c:560:1: Parameter `r->top`
  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:583:3: Call
  581.   	if ((al == 0) || (bl == 0))
  582.   		{
  583.   		BN_zero(r);
           ^
  584.   		return(1);
  585.   		}

crypto/bn/bn_lib.c:569:1: Parameter `a->top`
    567.   	}
    568.   
    569. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    570.   	{
    571.   	int i,n;

crypto/bn/bn_lib.c:572:6: Call
    570.   	{
    571.   	int i,n;
    572.   	if (bn_expand(a,sizeof(BN_ULONG)*8) == NULL) return(0);
                ^
    573.   
    574.   	n=sizeof(BN_ULONG)/BN_BYTES;

crypto/bn/bn_lib.c:344:1: <Length trace>
342.   	}
343.   
344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
345.   	{
346.   	BN_ULONG *A,*a;

crypto/bn/bn_lib.c:344:1: Parameter `b->top`
      342.   	}
      343.   
      344. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      345.   	{
      346.   	BN_ULONG *A,*a;

crypto/bn/bn_lib.c:466:3: Assignment
      464.   		/* Now need to zero any data between b->top and b->max */
      465.   
      466.   		A= &(b->d[b->top]);
               ^
      467.   		for (i=(b->max - b->top)>>3; i>0; i--,A+=8)
      468.   			{

crypto/bn/bn_lib.c:470:28: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: 4 by call to `BN_mul` 
      468.   			{
      469.   			A[0]=0; A[1]=0; A[2]=0; A[3]=0;
      470.   			A[4]=0; A[5]=0; A[6]=0; A[7]=0;
                                        ^
      471.   			}
      472.   		for (i=(b->max - b->top)&7; i>0; i--,A++)
