crypto/bn/bn_prime.c:180: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `witness`.
Showing all 27 steps of the trace


crypto/bn/bn_prime.c:175:7: Call
173.   
174.   	/* Setup the montgomery structure */
175.   	if (!BN_MONT_CTX_set(mont,a,ctx2)) goto err;
             ^
176.   
177.   	for (i=0; i<checks; i++)

crypto/bn/bn_mont.c:301:1: Parameter `*mont->RR.d`
  299.   	}
  300.   
  301. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, BIGNUM *mod, BN_CTX *ctx)
  302.   	{
  303.   	BIGNUM Ri,*R;

crypto/bn/bn_mont.c:319:3: Call
  317.   
  318.   		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
  319.   		BN_zero(R);
           ^
  320.   		BN_set_bit(R,BN_BITS2);
  321.   		/* I was bad, this modification of a passed variable was

crypto/bn/bn_lib.c:567:1: Parameter `*a->d`
    565.   	}
    566.   
    567. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    568.   	{
    569.   	int i,n;

crypto/bn/bn_mont.c:320:3: Call
  318.   		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
  319.   		BN_zero(R);
  320.   		BN_set_bit(R,BN_BITS2);
           ^
  321.   		/* I was bad, this modification of a passed variable was
  322.   		 * breaking the multithreaded stuff :-(

crypto/bn/bn_lib.c:709:1: Parameter `*a->d`
    707.   	}
    708.   
    709. > int BN_set_bit(BIGNUM *a, int n)
    710.   	{
    711.   	int i,j,k;

crypto/bn/bn_prime.c:180:5: Call
178.   		{
179.   		if (!BN_rand(check,BN_num_bits(a)-1,0,0)) goto err;
180.   		j=witness(check,a,ctx,ctx2,mont);
           ^
181.   		if (j == -1) goto err;
182.   		if (j)

crypto/bn/bn_prime.c:203:1: Parameter `*mont->RR.d`
  201.   #define RECP_MUL_MOD
  202.   
  203. > static int witness(BIGNUM *a, BIGNUM *n, BN_CTX *ctx, BN_CTX *ctx2,
  204.   	     BN_MONT_CTX *mont)
  205.   	{

crypto/bn/bn_prime.c:226:7: Call
  224.   	k=BN_num_bits(n1);
  225.   
  226.   	if (!BN_to_montgomery(mont_one,BN_value_one(),mont,ctx2)) goto err;
               ^
  227.   	if (!BN_to_montgomery(mont_n1,n1,mont,ctx2)) goto err;
  228.   	if (!BN_to_montgomery(mont_a,a,mont,ctx2)) goto err;

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_prime.c:227:7: Call
  225.   
  226.   	if (!BN_to_montgomery(mont_one,BN_value_one(),mont,ctx2)) goto err;
  227.   	if (!BN_to_montgomery(mont_n1,n1,mont,ctx2)) goto err;
               ^
  228.   	if (!BN_to_montgomery(mont_a,a,mont,ctx2)) goto err;
  229.   

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_prime.c:228:7: Call
  226.   	if (!BN_to_montgomery(mont_one,BN_value_one(),mont,ctx2)) goto err;
  227.   	if (!BN_to_montgomery(mont_n1,n1,mont,ctx2)) goto err;
  228.   	if (!BN_to_montgomery(mont_a,a,mont,ctx2)) goto err;
               ^
  229.   
  230.   	BN_copy(d,mont_one);

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:769:1: <Offset trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `n`
            767.   	}
            768.   
            769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
            770.   	{
            771.   	int i;

crypto/bn/bn_lib.c:777:7: Assignment
            775.   	bb=b[n-1];
            776.   	if (aa != bb) return((aa > bb)?1:-1);
            777.   	for (i=n-2; i>=0; i--)
                         ^
            778.   		{
            779.   		aa=a[i];

crypto/bn/bn_lib.c:769:1: <Length trace>
767.   	}
768.   
769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
770.   	{
771.   	int i;

crypto/bn/bn_lib.c:769:1: Parameter `*b`
            767.   	}
            768.   
            769. > int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
            770.   	{
            771.   	int i;

crypto/bn/bn_lib.c:780:6: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, +oo] by call to `witness` 
            778.   		{
            779.   		aa=a[i];
            780.   		bb=b[i];
                        ^
            781.   		if (aa != bb) return((aa > bb)?1:-1);
            782.   		}
