crypto/bn/bntest.c:663: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, +oo] by call to `BN_mod_exp`.
Showing all 20 steps of the trace


crypto/bn/bntest.c:657:2: Call
655.   	e=BN_new();
656.   
657.   	BN_rand(c,30,0,1); /* must be odd for montgomery */
        ^
658.   	for (i=0; i<6; i++)
659.   		{

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include "rand.h"
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:660:3: Call
658.   	for (i=0; i<6; i++)
659.   		{
660.   		BN_rand(a,20+i*5,0,0); /**/
         ^
661.   		BN_rand(b,2+i,0,0); /**/
662.   

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include "rand.h"
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:661:3: Call
659.   		{
660.   		BN_rand(a,20+i*5,0,0); /**/
661.   		BN_rand(b,2+i,0,0); /**/
         ^
662.   
663.   		if (!BN_mod_exp(d,a,b,c,ctx))

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include "rand.h"
  64.   
  65. > int BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
  66.   	{
  67.   	unsigned char *buf=NULL;

crypto/bn/bntest.c:663:8: Call
661.   		BN_rand(b,2+i,0,0); /**/
662.   
663.   		if (!BN_mod_exp(d,a,b,c,ctx))
              ^
664.   			return(00);
665.   

crypto/bn/bn_exp.c:157:1: Parameter `*a->d`
  155.   	}
  156.   
  157. > int BN_mod_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx)
  158.   	{
  159.   	int ret;

crypto/bn/bn_exp.c:173:9: Call
  171.   
  172.   	if (BN_is_odd(m))
  173.   		{ ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL); }
                 ^
  174.   	else
  175.   #endif

crypto/bn/bn_exp.c:299:1: Parameter `*a->d`
    297.   
    298.   /* #ifdef MONT_MUL_MOD */
    299. > int BN_mod_exp_mont(BIGNUM *rr, BIGNUM *a, BIGNUM *p, BIGNUM *m, BN_CTX *ctx,
    300.   	     BN_MONT_CTX *in_mont)
    301.   	{

crypto/bn/bn_exp.c:348:7: Call
    346.   	else
    347.   		aa=a;
    348.   	if (!BN_to_montgomery(&(val[0]),aa,mont,ctx)) goto err; /* 1 */
                 ^
    349.   	if (!BN_mod_mul_montgomery(d,&(val[0]),&(val[0]),mont,ctx)) goto err; /* 2 */
    350.   

crypto/bn/bn_mont.c:71:1: Parameter `*a->d`
      69.   #define MONT_WORD
      70.   
      71. > int BN_mod_mul_montgomery(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_MONT_CTX *mont,
      72.   	     BN_CTX *ctx)
      73.   	{

crypto/bn/bn_mont.c:93:8: Call
      91.   			tmp->top--;
      92.   #else
      93.   		if (!BN_sqr(tmp,a,ctx)) goto err;
                   ^
      94.   #endif
      95.   		}

crypto/bn/bn_sqr.c:65:1: Parameter `*a->d`
        63.   /* r must not be a */
        64.   /* I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96 */
        65. > int BN_sqr(BIGNUM *r, BIGNUM *a, BN_CTX *ctx)
        66.   	{
        67.   	int max,al;

crypto/bn/bn_sqr.c:130:5: Call
        128.   				{
        129.   				if (bn_wexpand(tmp,max) == NULL) return(0);
        130.   				bn_sqr_normal(rr->d,a->d,al,tmp->d);
                   ^
        131.   				}
        132.   			}

crypto/bn/bn_sqr.c:146:1: Parameter `*a`
          144.   
          145.   /* tmp must have 2*n words */
          146. > void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp)
          147.   	{
          148.   	int i,j,max;

crypto/bn/bn_sqr.c:177:2: Call
          175.   	/* There will not be a carry */
          176.   
          177.   	bn_sqr_words(tmp,a,n);
                  ^
          178.   
          179.   	bn_add_words(r,r,tmp,max);

crypto/bn/bn_asm.c:197:1: <Length trace>
195.   	} 
196.   
197. > void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
198.           {
199.   	bn_check_num(n);

crypto/bn/bn_asm.c:197:1: Parameter `*a`
            195.   	} 
            196.   
            197. > void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
            198.           {
            199.   	bn_check_num(n);

crypto/bn/bn_asm.c:212:3: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, +oo] by call to `BN_mod_exp` 
            210.   		if (--n == 0) break;
            211.   
            212.   		sqr64(r[6],r[7],a[3]);
                     ^
            213.   		if (--n == 0) break;
            214.   
