crypto/rsa/rsa_chk.c:133: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 34 steps of the trace


crypto/rsa/rsa_chk.c:89:6: Call
87.   	
88.   	/* p prime? */
89.   	r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
           ^
90.   	if (r != 1)
91.   		{

crypto/bn/bn_prime.c:294:1: Parameter `ctx_passed->stack.depth`
  292.   	}
  293.   
  294. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  295.   	{
  296.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:296:9: Call
  294.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  295.   	{
  296.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  297.   	}
  298.   

crypto/bn/bn_prime.c:299:1: Parameter `ctx_passed->stack.depth`
    297.   	}
    298.   
    299. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    300.   		int do_trial_division, BN_GENCB *cb)
    301.   	{

crypto/rsa/rsa_chk.c:99:6: Call
97.   	
98.   	/* q prime? */
99.   	r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
            ^
100.   	if (r != 1)
101.   		{

crypto/bn/bn_prime.c:294:1: Parameter `ctx_passed->stack.depth`
  292.   	}
  293.   
  294. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  295.   	{
  296.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:296:9: Call
  294.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  295.   	{
  296.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  297.   	}
  298.   

crypto/bn/bn_prime.c:299:1: Parameter `ctx_passed->stack.depth`
    297.   	}
    298.   
    299. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    300.   		int do_trial_division, BN_GENCB *cb)
    301.   	{

crypto/rsa/rsa_chk.c:109:6: Call
107.   	
108.   	/* n = p*q? */
109.   	r = BN_mul(i, key->p, key->q, ctx);
            ^
110.   	if (!r) { ret = -1; goto err; }
111.   	

crypto/bn/bn_mul.c:898:1: Parameter `ctx->stack.depth`
  896.   #endif /* BN_RECURSION */
  897.   
  898. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  899.   	{
  900.   	int ret=0;

crypto/rsa/rsa_chk.c:126:6: Call
124.   
125.   	/* now compute k = lcm(i,j) */
126.   	r = BN_mul(l, i, j, ctx);
            ^
127.   	if (!r) { ret = -1; goto err; }
128.   	r = BN_gcd(m, i, j, ctx);

crypto/bn/bn_mul.c:898:1: Parameter `ctx->stack.depth`
  896.   #endif /* BN_RECURSION */
  897.   
  898. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  899.   	{
  900.   	int ret=0;

crypto/rsa/rsa_chk.c:128:6: Call
126.   	r = BN_mul(l, i, j, ctx);
127.   	if (!r) { ret = -1; goto err; }
128.   	r = BN_gcd(m, i, j, ctx);
            ^
129.   	if (!r) { ret = -1; goto err; }
130.   	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */

crypto/bn/bn_gcd.c:119:1: Parameter `ctx->stack.depth`
  117.   static BIGNUM *euclid(BIGNUM *a, BIGNUM *b);
  118.   
  119. > int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx)
  120.   	{
  121.   	BIGNUM *a,*b,*t;

crypto/bn/bn_gcd.c:127:2: Call
  125.   	bn_check_top(in_b);
  126.   
  127.   	BN_CTX_start(ctx);
          ^
  128.   	a = BN_CTX_get(ctx);
  129.   	b = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:256:1: Parameter `ctx->stack.depth`
    254.   	}
    255.   
    256. > void BN_CTX_start(BN_CTX *ctx)
    257.   	{
    258.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_gcd.c:144:2: Call
  142.   	ret=1;
  143.   err:
  144.   	BN_CTX_end(ctx);
          ^
  145.   	bn_check_top(r);
  146.   	return(ret);

crypto/bn/bn_ctx.c:271:1: Parameter `ctx->stack.depth`
    269.   	}
    270.   
    271. > void BN_CTX_end(BN_CTX *ctx)
    272.   	{
    273.   	CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/rsa/rsa_chk.c:130:6: Call
128.   	r = BN_gcd(m, i, j, ctx);
129.   	if (!r) { ret = -1; goto err; }
130.   	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
            ^
131.   	if (!r) { ret = -1; goto err; }
132.   

crypto/bn/bn_div.c:182:1: Parameter `ctx->stack.depth`
  180.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  181.    */
  182. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  183.   	   BN_CTX *ctx)
  184.   	{

crypto/rsa/rsa_chk.c:133:6: Call
131.   	if (!r) { ret = -1; goto err; }
132.   
133.   	r = BN_mod_mul(i, key->d, key->e, k, ctx);
            ^
134.   	if (!r) { ret = -1; goto err; }
135.   

crypto/bn/bn_mod.c:180:1: Parameter `ctx->stack.depth`
  178.   
  179.   /* slow but works */
  180. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  181.   	BN_CTX *ctx)
  182.   	{

crypto/bn/bn_mod.c:190:2: Call
  188.   	bn_check_top(m);
  189.   
  190.   	BN_CTX_start(ctx);
          ^
  191.   	if ((t = BN_CTX_get(ctx)) == NULL) goto err;
  192.   	if (a == b)

crypto/bn/bn_ctx.c:256:1: Parameter `ctx->stack.depth`
    254.   	}
    255.   
    256. > void BN_CTX_start(BN_CTX *ctx)
    257.   	{
    258.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:195:10: Call
  193.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
  194.   	else
  195.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                  ^
  196.   	if (!BN_nnmod(r,t,m,ctx)) goto err;
  197.   	bn_check_top(r);

crypto/bn/bn_mul.c:898:1: Parameter `ctx->stack.depth`
    896.   #endif /* BN_RECURSION */
    897.   
    898. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    899.   	{
    900.   	int ret=0;

crypto/bn/bn_mul.c:925:2: Call
    923.   	top=al+bl;
    924.   
    925.   	BN_CTX_start(ctx);
            ^
    926.   	if ((r == a) || (r == b))
    927.   		{

crypto/bn/bn_ctx.c:256:1: Parameter `ctx->stack.depth`
      254.   	}
      255.   
      256. > void BN_CTX_start(BN_CTX *ctx)
      257.   	{
      258.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mul.c:1051:2: Call
    1049.   err:
    1050.   	bn_check_top(r);
    1051.   	BN_CTX_end(ctx);
             ^
    1052.   	return(ret);
    1053.   	}

crypto/bn/bn_ctx.c:271:1: Parameter `ctx->stack.depth`
      269.   	}
      270.   
      271. > void BN_CTX_end(BN_CTX *ctx)
      272.   	{
      273.   	CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:278:21: Call
      276.   	else
      277.   		{
      278.   		unsigned int fp = BN_STACK_pop(&ctx->stack);
                                 ^
      279.   		/* Does this stack frame have anything to release? */
      280.   		if(fp < ctx->used)

crypto/bn/bn_ctx.c:352:1: <LHS trace>
350.   	}
351.   
352. > static unsigned int BN_STACK_pop(BN_STACK *st)
353.   	{
354.   	return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:352:1: Parameter `st->depth`
        350.   	}
        351.   
        352. > static unsigned int BN_STACK_pop(BN_STACK *st)
        353.   	{
        354.   	return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:354:9: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul` 
        352.   static unsigned int BN_STACK_pop(BN_STACK *st)
        353.   	{
        354.   	return st->indexes[--(st->depth)];
                       ^
        355.   	}
        356.   
