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


crypto/bn/bntest.c:638:2: Call
636.   	e=BN_new();
637.   
638.   	BN_rand(c,30,0,1); /* must be odd for montgomery */
        ^
639.   	for (i=0; i<6; i++)
640.   		{

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/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:641:3: Call
639.   	for (i=0; i<6; i++)
640.   		{
641.   		BN_rand(a,20+i*5,0,0); /**/
         ^
642.   		BN_rand(b,2+i,0,0); /**/
643.   

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/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:642:3: Call
640.   		{
641.   		BN_rand(a,20+i*5,0,0); /**/
642.   		BN_rand(b,2+i,0,0); /**/
         ^
643.   
644.   		if (!BN_mod_exp(d,a,b,c,ctx))

crypto/bn/bn_rand.c:65:1: Parameter `*rnd->d`
  63.   #include <openssl/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:644:8: Call
642.   		BN_rand(b,2+i,0,0); /**/
643.   
644.   		if (!BN_mod_exp(d,a,b,c,ctx))
              ^
645.   			return(00);
646.   

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:419:8: Call
    417.   		
    418.   		/* wvalue will be an odd number < 2^window */
    419.   		if (!BN_mod_mul_montgomery(r,r,&(val[wvalue>>1]),mont,ctx))
                  ^
    420.   			goto err;
    421.   

crypto/bn/bn_mont.c:71:1: Parameter `*b->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 `*b->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:264:4: Call
          262.   		if (j == 0)
          263.   			{
          264.   			bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),i,p);
                    ^
          265.   			memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
          266.   			}

crypto/bn/bn_mul.c:74:1: Parameter `*b`
            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:104:5: Call
            102.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
            103.   	c1=bn_cmp_words(a,&(a[n]),n);
            104.   	c2=bn_cmp_words(&(b[n]),b,n);
                       ^
            105.   	zero=neg=0;
            106.   	switch (c1*3+c2)

crypto/bn/bn_lib.c:748:1: <Offset trace>
746.   	}
747.   
748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
749.   	{
750.   	int i;

crypto/bn/bn_lib.c:748:1: Parameter `n`
              746.   	}
              747.   
              748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
              749.   	{
              750.   	int i;

crypto/bn/bn_lib.c:756:7: Assignment
              754.   	bb=b[n-1];
              755.   	if (aa != bb) return((aa > bb)?1:-1);
              756.   	for (i=n-2; i>=0; i--)
                           ^
              757.   		{
              758.   		aa=a[i];

crypto/bn/bn_lib.c:748:1: <Length trace>
746.   	}
747.   
748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
749.   	{
750.   	int i;

crypto/bn/bn_lib.c:748:1: Parameter `*b`
              746.   	}
              747.   
              748. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
              749.   	{
              750.   	int i;

crypto/bn/bn_lib.c:759:6: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `BN_mod_exp` 
              757.   		{
              758.   		aa=a[i];
              759.   		bb=b[i];
                          ^
              760.   		if (aa != bb) return((aa > bb)?1:-1);
              761.   		}
