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


crypto/rsa/rsa_chk.c:84:6: Call
82.   	
83.   	/* p prime? */
84.   	r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, NULL);
           ^
85.   	if (r != 1)
86.   		{

crypto/bn/bn_prime.c:251:1: Parameter `ctx_passed->stack.depth`
  249.   	}
  250.   
  251. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:253:9: Call
  251.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  254.   	}
  255.   

crypto/bn/bn_prime.c:256:1: Parameter `ctx_passed->stack.depth`
    254.   	}
    255.   
    256. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    257.   		int do_trial_division, BN_GENCB *cb)
    258.   	{

crypto/rsa/rsa_chk.c:94:6: Call
92.   	
93.   	/* q prime? */
94.   	r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, NULL);
           ^
95.   	if (r != 1)
96.   		{

crypto/bn/bn_prime.c:251:1: Parameter `ctx_passed->stack.depth`
  249.   	}
  250.   
  251. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:253:9: Call
  251.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  254.   	}
  255.   

crypto/bn/bn_prime.c:256:1: Parameter `ctx_passed->stack.depth`
    254.   	}
    255.   
    256. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    257.   		int do_trial_division, BN_GENCB *cb)
    258.   	{

crypto/rsa/rsa_chk.c:104:6: Call
102.   	
103.   	/* n = p*q? */
104.   	r = BN_mul(i, key->p, key->q, ctx);
            ^
105.   	if (!r) { ret = -1; goto err; }
106.   	

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

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

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

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

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

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

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

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

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