crypto/bn/bn_exp.c:225: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_mod_mul_reciprocal`.
Showing all 19 steps of the trace


crypto/bn/bn_exp.c:186:1: Parameter `m->top`
184.   
185.   /* #ifdef RECP_MUL_MOD */
186. > int BN_mod_exp_recp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx)
187.   	{
188.   	int i,j,bits,ret=0,wstart,wend,window,wvalue;

crypto/bn/bn_exp.c:203:6: Call
201.   		}
202.   	BN_RECP_CTX_init(&recp);
203.   	if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
            ^
204.   
205.   	BN_init(&(val[0]));

crypto/bn/bn_recp.c:94:1: Parameter `*recp->N.d`
  92.   	}
  93.   
  94. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, BIGNUM *d, BN_CTX *ctx)
  95.   	{
  96.   	BN_copy(&(recp->N),d);

crypto/bn/bn_recp.c:96:2: Call
  94.   int BN_RECP_CTX_set(BN_RECP_CTX *recp, BIGNUM *d, BN_CTX *ctx)
  95.   	{
  96.   	BN_copy(&(recp->N),d);
         ^
  97.   	BN_zero(&(recp->Nr));
  98.   	recp->num_bits=BN_num_bits(d);

crypto/bn/bn_lib.c:499:1: Parameter `*a->d`
    497.   	}
    498.   
    499. > BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b)
    500.   	{
    501.   	int i;

crypto/bn/bn_exp.c:209:7: Call
207.   
208.   	if (!BN_mod(&(val[0]),a,m,ctx)) goto err;		/* 1 */
209.   	if (!BN_mod_mul_reciprocal(aa,&(val[0]),&(val[0]),&recp,ctx))
             ^
210.   		goto err;				/* 2 */
211.   

crypto/bn/bn_recp.c:103:1: Parameter `*recp->N.d`
  101.   	}
  102.   
  103. > int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_RECP_CTX *recp,
  104.   	     BN_CTX *ctx)
  105.   	{

crypto/bn/bn_exp.c:225:8: Call
223.   		{
224.   		BN_init(&val[i]);
225.   		if (!BN_mod_mul_reciprocal(&(val[i]),&(val[i-1]),aa,&recp,ctx))
              ^
226.   			goto err;
227.   		}

crypto/bn/bn_recp.c:103:1: Parameter `*recp->N.d`
  101.   	}
  102.   
  103. > int BN_mod_mul_reciprocal(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_RECP_CTX *recp,
  104.   	     BN_CTX *ctx)
  105.   	{

crypto/bn/bn_recp.c:120:2: Call
  118.   		a=x; /* Just do the mod */
  119.   
  120.   	BN_div_recp(NULL,r,a,recp,ctx);
          ^
  121.   	ret=1;
  122.   err:

crypto/bn/bn_recp.c:127:1: Parameter `*recp->N.d`
    125.   	}
    126.   
    127. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, BIGNUM *m, BN_RECP_CTX *recp,
    128.   	     BN_CTX *ctx)
    129.   	{

crypto/bn/bn_recp.c:181:7: Call
    179.   	if (!BN_rshift(d,b,j+ex)) goto err;
    180.   	d->neg=0;
    181.   	if (!BN_mul(b,&(recp->N),d,ctx)) goto err;
                 ^
    182.   	if (!BN_usub(r,m,b)) goto err;
    183.   	r->neg=0;

crypto/bn/bn_mul.c:560:1: Parameter `*a->d`
      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:686:4: Call
      684.   			for (i=b->top; i<k; i++)
      685.   				b->d[i]=0;
      686.   			bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
                ^
      687.   			}
      688.   		rr->top=top;

crypto/bn/bn_mul.c:218:1: Parameter `n`
        216.   /* n+tn is the word length
        217.    * t needs to be n*4 is size, as does r */
        218. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int tn,
        219.   	     int n, BN_ULONG *t)
        220.   	{

crypto/bn/bn_mul.c:236:2: Call
        234.   
        235.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
        236.   	bn_sub_words(t,      a,      &(a[n]),n); /* + */
                ^
        237.   	bn_sub_words(&(t[n]),b,      &(b[n]),n); /* - */
        238.   

crypto/bn/bn_asm.c:389:1: <Length trace>
387.   #endif
388.   
389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
390.           {
391.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:389:1: Parameter `*b`
          387.   #endif
          388.   
          389. > BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
          390.           {
          391.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:404:15: Array access: Offset: [9, +oo] (⇐ [8, +oo] + 1) Size: [0, +oo] by call to `BN_mod_mul_reciprocal` 
          402.   		if (--n <= 0) break;
          403.   
          404.   		t1=a[1]; t2=b[1];
                               ^
          405.   		r[1]=(t1-t2-c)&BN_MASK2;
          406.   		if (t1 != t2) c=(t1 < t2);
