crypto/rsa/rsa_chk.c:122: 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:78:6: Call
76.   	
77.   	/* p prime? */
78.   	r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, NULL);
           ^
79.   	if (r != 1)
80.   		{

crypto/bn/bn_prime.c:233:1: Parameter `ctx_passed->stack.depth`
  231.   	}
  232.   
  233. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  234.   	{
  235.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:235:9: Call
  233.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  234.   	{
  235.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  236.   	}
  237.   

crypto/bn/bn_prime.c:238:1: Parameter `ctx_passed->stack.depth`
    236.   	}
    237.   
    238. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    239.   		int do_trial_division, BN_GENCB *cb)
    240.   	{

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

crypto/bn/bn_prime.c:233:1: Parameter `ctx_passed->stack.depth`
  231.   	}
  232.   
  233. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  234.   	{
  235.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:235:9: Call
  233.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  234.   	{
  235.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  236.   	}
  237.   

crypto/bn/bn_prime.c:238:1: Parameter `ctx_passed->stack.depth`
    236.   	}
    237.   
    238. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    239.   		int do_trial_division, BN_GENCB *cb)
    240.   	{

crypto/rsa/rsa_chk.c:98:6: Call
96.   	
97.   	/* n = p*q? */
98.   	r = BN_mul(i, key->p, key->q, ctx);
            ^
99.   	if (!r) { ret = -1; goto err; }
100.   	

crypto/bn/bn_mul.c:941:1: Parameter `ctx->stack.depth`
  939.   #endif /* BN_RECURSION */
  940.   
  941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  942.   	{
  943.   	int ret=0;

crypto/rsa/rsa_chk.c:115:6: Call
113.   
114.   	/* now compute k = lcm(i,j) */
115.   	r = BN_mul(l, i, j, ctx);
            ^
116.   	if (!r) { ret = -1; goto err; }
117.   	r = BN_gcd(m, i, j, ctx);

crypto/bn/bn_mul.c:941:1: Parameter `ctx->stack.depth`
  939.   #endif /* BN_RECURSION */
  940.   
  941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  942.   	{
  943.   	int ret=0;

crypto/rsa/rsa_chk.c:117:6: Call
115.   	r = BN_mul(l, i, j, ctx);
116.   	if (!r) { ret = -1; goto err; }
117.   	r = BN_gcd(m, i, j, ctx);
            ^
118.   	if (!r) { ret = -1; goto err; }
119.   	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */

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

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

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

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

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

crypto/rsa/rsa_chk.c:119:6: Call
117.   	r = BN_gcd(m, i, j, ctx);
118.   	if (!r) { ret = -1; goto err; }
119.   	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
            ^
120.   	if (!r) { ret = -1; goto err; }
121.   

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

crypto/rsa/rsa_chk.c:122:6: Call
120.   	if (!r) { ret = -1; goto err; }
121.   
122.   	r = BN_mod_mul(i, key->d, key->e, k, ctx);
            ^
123.   	if (!r) { ret = -1; goto err; }
124.   

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

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

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

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

crypto/bn/bn_mul.c:941:1: Parameter `ctx->stack.depth`
    939.   #endif /* BN_RECURSION */
    940.   
    941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    942.   	{
    943.   	int ret=0;

crypto/bn/bn_mul.c:972:2: Call
    970.   	top=al+bl;
    971.   
    972.   	BN_CTX_start(ctx);
            ^
    973.   	if ((r == a) || (r == b))
    974.   		{

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

crypto/bn/bn_mul.c:1098:2: Call
    1096.   err:
    1097.   	bn_check_top(r);
    1098.   	BN_CTX_end(ctx);
             ^
    1099.   	return(ret);
    1100.   	}

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

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

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

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

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