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


crypto/bn/bn_mont.c:329:3: Assignment
327.   		buf[1]=0;
328.   		tmod.d=buf;
329.   		tmod.top=1;
         ^
330.   		tmod.max=mod->max;
331.   		tmod.neg=mod->neg;

crypto/bn/bn_mont.c:333:8: Call
331.   		tmod.neg=mod->neg;
332.   
333.   		if ((BN_mod_inverse(&Ri,R,&tmod,ctx)) == NULL)
              ^
334.   			goto err;
335.   		BN_lshift(&Ri,&Ri,BN_BITS2);			/* R*Ri */

crypto/bn/bn_gcd.c:143:1: Parameter `n->top`
  141.   
  142.   /* solves ax == 1 (mod n) */
  143. > BIGNUM *BN_mod_inverse(BIGNUM *in, BIGNUM *a, 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:499:1: Parameter `a->max`
    497.   	}
    498.   
    499. > BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b)
    500.   	{
    501.   	int i;

crypto/bn/bn_lib.c:508:6: Call
    506.   
    507.   	if (a == b) return(a);
    508.   	if (bn_wexpand(a,b->top) == NULL) return(NULL);
                ^
    509.   
    510.   #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,*a;

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

crypto/bn/bn_lib.c:360:19: Array declaration
      358.   			return(NULL);
      359.   			}
      360.   		a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
                               ^
      361.   		if (A == NULL)
      362.   			{

crypto/bn/bn_lib.c:360:5: Assignment
      358.   			return(NULL);
      359.   			}
      360.   		a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
                 ^
      361.   		if (A == NULL)
      362.   			{

crypto/bn/bn_lib.c:448:32: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: 2 by call to `BN_mod_inverse` 
      446.   				BN_ULONG a0,a1,a2,a3;
      447.   				a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
      448.   				A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
                                            ^
      449.   				}
      450.   			switch (b->top&3)
