crypto/bn/bntest.c:1132: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqr`.
Showing all 13 steps of the trace


crypto/bn/bntest.c:1111:1: Parameter `ctx->stack.depth`
1109.   	}
1110.   
1111. > int test_gf2m_mod_sqr(BIO *bp,BN_CTX *ctx)
1112.   	{
1113.   	BIGNUM *a,*b[2],*c,*d;

crypto/bn/bntest.c:1132:4: Call
1130.   		for (j=0; j < 2; j++)
1131.   			{
1132.   			BN_GF2m_mod_sqr(c, a, b[j], ctx);
           ^
1133.   			BN_copy(d, a);
1134.   			BN_GF2m_mod_mul(d, a, d, b[j], ctx);

crypto/bn/bn_gf2m.c:551:1: Parameter `ctx->stack.depth`
  549.    * BN_GF2m_mod_sqr_arr function.
  550.    */
  551. > int	BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  552.   	{
  553.   	int ret = 0;

crypto/bn/bn_gf2m.c:566:8: Call
  564.   		goto err;
  565.   		}
  566.   	ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
                ^
  567.   	bn_check_top(r);
  568.   err:

crypto/bn/bn_gf2m.c:519:1: Parameter `ctx->stack.depth`
    517.   
    518.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
    519. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
    520.   	{
    521.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:525:2: Call
    523.   
    524.   	bn_check_top(a);
    525.   	BN_CTX_start(ctx);
            ^
    526.   	if ((s = BN_CTX_get(ctx)) == NULL) return 0;
    527.   	if (!bn_wexpand(s, 2 * a->top)) goto err;

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_gf2m.c:541:2: Call
    539.   	ret = 1;
    540.   err:
    541.   	BN_CTX_end(ctx);
            ^
    542.   	return ret;
    543.   	}

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