crypto/bn/bntest.c:663: error: BUFFER_OVERRUN_L3
  Offset: 14 (⇐ 8 + 6) Size: [0, +oo] by call to `BN_mod_exp`.
Showing all 23 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:343:3: Call
    341.   	if (BN_ucmp(a,m) >= 0)
    342.   		{
    343.   		BN_mod(&(val[0]),a,m,ctx);
             ^
    344.   		aa= &(val[0]);
    345.   		}

crypto/bn/bn_div.c:286:1: Parameter `*rem->d`
      284.   
      285.   /* rem != m */
      286. > int BN_mod(BIGNUM *rem, BIGNUM *m, BIGNUM *d, BN_CTX *ctx)
      287.   	{
      288.   #if 0 /* The old slow way */

crypto/bn/bn_div.c:312:9: Call
      310.   	return(1);
      311.   #else
      312.   	return(BN_div(NULL,rem,m,d,ctx));
                     ^
      313.   #endif
      314.   	}

crypto/bn/bn_div.c:120:1: Parameter `*rm->d`
        118.   #else
        119.   
        120. > int BN_div(BIGNUM *dv, BIGNUM *rm, BIGNUM *num, BIGNUM *divisor,
        121.   	     BN_CTX *ctx)
        122.   	{

crypto/bn/bn_exp.c:364:8: Call
    362.   		{
    363.   		BN_init(&(val[i]));
    364.   		if (!BN_mod_mul_montgomery(&(val[i]),&(val[i-1]),d,mont,ctx))
                  ^
    365.   			goto err;
    366.   		}

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:98:8: Call
      96.   	else
      97.   		{
      98.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
                    ^
      99.   		}
      100.   	/* reduce from aRR to aR */

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:674:4: Call
        672.   			bn_wexpand(t,k*2);
        673.   			bn_wexpand(rr,k*2);
        674.   			bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
                  ^
        675.   			}
        676.   		else

crypto/bn/bn_mul.c:74:1: Parameter `*a`
          72.    * a[1]*b[1]
          73.    */
          74. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
          75.   	     BN_ULONG *t)
          76.   	{

crypto/bn/bn_mul.c:158:3: Call
          156.   		
          157.   		bn_mul_comba8(r,a,b);
          158.   		bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
                   ^
          159.   		}
          160.   	else

crypto/bn/bn_asm.c:489:1: <Length trace>
487.   #endif
488.   
489. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
490.   	{
491.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:489:1: Parameter `*a`
            487.   #endif
            488.   
            489. > void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
            490.   	{
            491.   #ifdef BN_LLONG

crypto/bn/bn_asm.c:535:2: Array access: Offset: 14 (⇐ 8 + 6) Size: [0, +oo] by call to `BN_mod_exp` 
            533.   	r[5]=c3;
            534.   	c3=0;
            535.   	mul_add_c(a[6],b[0],c1,c2,c3);
                    ^
            536.   	mul_add_c(a[5],b[1],c1,c2,c3);
            537.   	mul_add_c(a[4],b[2],c1,c2,c3);
