crypto/rsa/rsa_lib.c:353: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_inverse`.
Showing all 19 steps of the trace


crypto/rsa/rsa_lib.c:317:1: Parameter `p_ctx->stack.depth`
315.   	}
316.   
317. > int RSA_blinding_on(RSA *rsa, BN_CTX *p_ctx)
318.   	{
319.   	BIGNUM *A,*Ai = NULL;

crypto/rsa/rsa_lib.c:341:2: Call
339.   	 * of binary compatibility can't */
340.   
341.   	BN_CTX_start(ctx);
        ^
342.   	A = BN_CTX_get(ctx);
343.   	if ((RAND_status() == 0) && rsa->d != NULL && rsa->d->d != NULL)

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/rsa/rsa_lib.c:353:10: Call
351.   		if (!BN_rand_range(A,rsa->n)) goto err;
352.   		}
353.   	if ((Ai=BN_mod_inverse(NULL,A,rsa->n,ctx)) == NULL) goto err;
                ^
354.   
355.   	if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n))

crypto/bn/bn_gcd.c:206:1: Parameter `ctx->stack.depth`
  204.   
  205.   /* solves ax == 1 (mod n) */
  206. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  207.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  208.   	{

crypto/bn/bn_gcd.c:216:2: Call
  214.   	bn_check_top(n);
  215.   
  216.   	BN_CTX_start(ctx);
          ^
  217.   	A = BN_CTX_get(ctx);
  218.   	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:239:8: Call
  237.   	if (B->neg || (BN_ucmp(B, A) >= 0))
  238.   		{
  239.   		if (!BN_nnmod(B, B, A, ctx)) goto err;
                ^
  240.   		}
  241.   	sign = -1;

crypto/bn/bn_mod.c:127:1: Parameter `ctx->stack.depth`
    125.   
    126.   
    127. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
    128.   	{
    129.   	/* like BN_mod, but returns non-negative remainder

crypto/bn/bn_mod.c:132:8: Call
    130.   	 * (i.e.,  0 <= r < |d|  always holds) */
    131.   
    132.   	if (!(BN_mod(r,m,d,ctx)))
                  ^
    133.   		return 0;
    134.   	if (!r->neg)

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/bn/bn_div.c:209:2: Call
      207.   		}
      208.   
      209.   	BN_CTX_start(ctx);
              ^
      210.   	tmp=BN_CTX_get(ctx);
      211.   	snum=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_div.c:394:2: Call
      392.   		bn_check_top(rm);
      393.   		}
      394.   	BN_CTX_end(ctx);
              ^
      395.   	return(1);
      396.   err:

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_inverse` 
          351.   static unsigned int BN_STACK_pop(BN_STACK *st)
          352.   	{
          353.   	return st->indexes[--(st->depth)];
                         ^
          354.   	}
          355.   
