crypto/bn/bn_mont.c:300: error: BUFFER_OVERRUN_L1
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse`.
Showing all 9 steps of the trace


crypto/bn/bn_mont.c:271:1: Array declaration
269.   	}
270.   
271. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
272.   	{
273.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:295:3: Assignment
293.   		buf[0]=mod->d[0]; /* tmod = N mod word size */
294.   		buf[1]=0;
295.   		tmod.d=buf;
         ^
296.   		tmod.top=1;
297.   		tmod.max=2;

crypto/bn/bn_mont.c:300:8: Call
298.   		tmod.neg=mod->neg;
299.   							/* Ri = R^-1 mod N*/
300.   		if ((BN_mod_inverse(&Ri,R,&tmod,ctx)) == NULL)
              ^
301.   			goto err;
302.   		BN_lshift(&Ri,&Ri,BN_BITS2);		/* R*Ri */

crypto/bn/bn_gcd.c:143:1: Parameter `*n->d`
  141.   
  142.   /* solves ax == 1 (mod n) */
  143. > BIGNUM *BN_mod_inverse(BIGNUM *in, BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  144.   	{
  145.   	BIGNUM *A,*B,*X,*Y,*M,*D,*R;

crypto/bn/bn_gcd.c:168:6: Call
  166.   	BN_one(Y);
  167.   	if (BN_copy(A,a) == NULL) goto err;
  168.   	if (BN_copy(B,n) == NULL) goto err;
              ^
  169.   	sign=1;
  170.   

crypto/bn/bn_lib.c:506:1: <Length trace>
504.   	}
505.   
506. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
507.   	{
508.   	int i;

crypto/bn/bn_lib.c:506:1: Parameter `*b->d`
    504.   	}
    505.   
    506. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    507.   	{
    508.   	int i;

crypto/bn/bn_lib.c:519:2: Assignment
    517.   #if 1
    518.   	A=a->d;
    519.   	B=b->d;
            ^
    520.   	for (i=b->top>>2; i>0; i--,A+=4,B+=4)
    521.   		{

crypto/bn/bn_lib.c:523:33: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse` 
    521.   		{
    522.   		BN_ULONG a0,a1,a2,a3;
    523.   		a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
                                           ^
    524.   		A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
    525.   		}
