crypto/rsa/rsa_eay.c:445: error: BUFFER_OVERRUN_L3
  Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod`.
Showing all 15 steps of the trace


crypto/rsa/rsa_eay.c:441:7: Call
439.   		}
440.   
441.   	if (!BN_mod(&r1,I,rsa->q,ctx)) goto err;
             ^
442.   	if (!rsa->meth->bn_mod_exp(&m1,&r1,rsa->dmq1,rsa->q,ctx,
443.   		rsa->_method_mod_q)) goto err;

crypto/bn/bn_div.c:286:1: Parameter `*rem->d`
  284.   
  285.   /* rem != m */
  286. > int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx)
  287.   	{
  288.   #if 0 /* The old slow way */

crypto/bn/bn_div.c:312:9: Call
  310.   	return(1);
  311.   #else
  312.   	return(BN_div(NULL,rem,m,d,ctx));
                 ^
  313.   #endif
  314.   	}

crypto/bn/bn_div.c:120:1: Parameter `*rm->d`
    118.   #else
    119.   
    120. > int BN_div(BIGNUM *dv, BIGNUM *rm, BIGNUM *num, BIGNUM *divisor,
    121.   	     BN_CTX *ctx)
    122.   	{

crypto/rsa/rsa_eay.c:445:7: Call
443.   		rsa->_method_mod_q)) goto err;
444.   
445.   	if (!BN_mod(&r1,I,rsa->p,ctx)) goto err;
             ^
446.   	if (!rsa->meth->bn_mod_exp(r0,&r1,rsa->dmp1,rsa->p,ctx,
447.   		rsa->_method_mod_p)) goto err;

crypto/bn/bn_div.c:286:1: Parameter `*rem->d`
  284.   
  285.   /* rem != m */
  286. > int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx)
  287.   	{
  288.   #if 0 /* The old slow way */

crypto/bn/bn_div.c:312:9: Call
  310.   	return(1);
  311.   #else
  312.   	return(BN_div(NULL,rem,m,d,ctx));
                 ^
  313.   #endif
  314.   	}

crypto/bn/bn_div.c:120:1: Parameter `*rm->d`
    118.   #else
    119.   
    120. > int BN_div(BIGNUM *dv, BIGNUM *rm, BIGNUM *num, BIGNUM *divisor,
    121.   	     BN_CTX *ctx)
    122.   	{

crypto/bn/bn_div.c:141:10: Call
    139.   		{
    140.   		if (rm != NULL)
    141.   			{ if (BN_copy(rm,num) == NULL) return(0); }
                    ^
    142.   		if (dv != NULL) BN_zero(dv);
    143.   		return(1);

crypto/bn/bn_lib.c:454:1: Parameter `*a->d`
      452.   	}
      453.   
      454. > BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b)
      455.   	{
      456.   	int i;

crypto/bn/bn_lib.c:462:6: Call
      460.   
      461.   	if (a == b) return(a);
      462.   	if (bn_wexpand(a,b->top) == NULL) return(NULL);
                  ^
      463.   
      464.   #if 1

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

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

crypto/bn/bn_lib.c:367:3: Assignment
        365.   memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
        366.   #if 1
        367.   		B=b->d;
                 ^
        368.   		/* Check if the previous number needs to be copied */
        369.   		if (B != NULL)

crypto/bn/bn_lib.c:377:43: Array access: Offset: [7, +oo] (⇐ [0, +oo] + 7) Size: [0, +oo] by call to `BN_mod` 
        375.   				{
        376.   				A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
        377.   				A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
                                                         ^
        378.   				A+=8;
        379.   				B+=8;
