crypto/dsa/dsa_gen.c:284: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] Size: [0, +oo] by call to `BN_mod_mul_montgomery`.
Showing all 17 steps of the trace


crypto/dsa/dsa_gen.c:282:2: Call
280.   	if (!BN_rshift(m,w_1,a)) goto err;
281.   
282.   	BN_MONT_CTX_set(mont,w,ctx);
        ^
283.   	BN_to_montgomery(mont_1,BN_value_one(),mont,ctx);
284.   	BN_to_montgomery(w_1,w_1,mont,ctx);

crypto/bn/bn_mont.c:301:1: Parameter `mont->RR.top`
  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:548:1: Parameter `a->top`
    546.   	}
    547.   
    548. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    549.   	{
    550.   	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:688:1: Parameter `a->top`
    686.   	}
    687.   
    688. > int BN_set_bit(BIGNUM *a, int n)
    689.   	{
    690.   	int i,j,k;

crypto/bn/bn_mont.c:333:8: Call
  331.   		tmod.neg=mod->neg;
  332.   
  333.   		if ((BN_mod_inverse(&Ri,R,&tmod,ctx)) == NULL)
                ^
  334.   			goto err;
  335.   		BN_lshift(&Ri,&Ri,BN_BITS2);			/* R*Ri */

crypto/bn/bn_gcd.c:148:1: Parameter `a->top`
    146.   
    147.   /* solves ax == 1 (mod n) */
    148. > BIGNUM *BN_mod_inverse(BIGNUM *in, BIGNUM *a, BIGNUM *n, BN_CTX *ctx)
    149.   	{
    150.   	BIGNUM *A,*B,*X,*Y,*M,*D,*R;

crypto/dsa/dsa_gen.c:284:2: Call
282.   	BN_MONT_CTX_set(mont,w,ctx);
283.   	BN_to_montgomery(mont_1,BN_value_one(),mont,ctx);
284.   	BN_to_montgomery(w_1,w_1,mont,ctx);
        ^
285.   	for (i=1; i < n; i++)
286.   		{

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: <Offset trace>
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:560:1: Parameter `a->top`
    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:577:2: Assignment
    575.   	bn_check_top(r);
    576.   
    577.   	al=a->top;
            ^
    578.   	bl=b->top;
    579.   	r->neg=a->neg^b->neg;

crypto/bn/bn_mul.c:560:1: <Length trace>
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: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:641:4: Array access: Offset: [16, +oo] Size: [0, +oo] by call to `BN_mod_mul_montgomery` 
    639.   			{
    640.   			bn_wexpand(b,al);
    641.   			b->d[bl]=0;
              ^
    642.   			bl++;
    643.   			goto symetric;
