crypto/bn/bn_mont.c:295: 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:270:1: Array declaration
268.   	}
269.   
270. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
271.   	{
272.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:290:3: Assignment
288.   		buf[0]=mod->d[0]; /* tmod = N mod word size */
289.   		buf[1]=0;
290.   		tmod.d=buf;
         ^
291.   		tmod.top=1;
292.   		tmod.dmax=2;

crypto/bn/bn_mont.c:295:8: Call
293.   		tmod.neg=0;
294.   							/* Ri = R^-1 mod N*/
295.   		if ((BN_mod_inverse(&Ri,R,&tmod,ctx)) == NULL)
              ^
296.   			goto err;
297.   		if (!BN_lshift(&Ri,&Ri,BN_BITS2)) goto err; /* R*Ri */

crypto/bn/bn_gcd.c:204:1: Parameter `*n->d`
  202.   
  203.   /* solves ax == 1 (mod n) */
  204. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  205.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  206.   	{

crypto/bn/bn_gcd.c:233:6: Call
  231.   	BN_zero(Y);
  232.   	if (BN_copy(B,a) == NULL) goto err;
  233.   	if (BN_copy(A,n) == NULL) goto err;
              ^
  234.   	A->neg = 0;
  235.   	if (B->neg || (BN_ucmp(B, A) >= 0))

crypto/bn/bn_lib.c:472:1: <Length trace>
470.   	}
471.   
472. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
473.   	{
474.   	int i;

crypto/bn/bn_lib.c:472:1: Parameter `*b->d`
    470.   	}
    471.   
    472. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    473.   	{
    474.   	int i;

crypto/bn/bn_lib.c:485:2: Assignment
    483.   #if 1
    484.   	A=a->d;
    485.   	B=b->d;
            ^
    486.   	for (i=b->top>>2; i>0; i--,A+=4,B+=4)
    487.   		{

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