crypto/bn/bn_gf2m.c:807: error: INTEGER_OVERFLOW_L2
  ([0, 6+max(0, `ctx->stack.depth`)] - 1):unsigned32 by call to `BN_GF2m_mod_mul`.
Showing all 23 steps of the trace


crypto/bn/bn_gf2m.c:790:1: Parameter `ctx->stack.depth`
788.    * or y, x could equal y.
789.    */
790. > int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x,
791.                       const BIGNUM *p, BN_CTX *ctx)
792.   {

crypto/bn/bn_gf2m.c:800:5: Call
798.       bn_check_top(p);
799.   
800.       BN_CTX_start(ctx);
           ^
801.       xinv = BN_CTX_get(ctx);
802.       if (xinv == NULL)

crypto/bn/bn_ctx.c:171:1: Parameter `ctx->stack.depth`
  169.   }
  170.   
  171. > void BN_CTX_start(BN_CTX *ctx)
  172.   {
  173.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_gf2m.c:805:10: Call
803.           goto err;
804.   
805.       if (!BN_GF2m_mod_inv(xinv, x, p, ctx))
                ^
806.           goto err;
807.       if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx))

crypto/bn/bn_gf2m.c:724:1: Parameter `ctx->stack.depth`
  722.    * But it does eliminate first order deduction on the input.
  723.    */
  724. > int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  725.   {
  726.       BIGNUM *b = NULL;

crypto/bn/bn_gf2m.c:729:5: Call
  727.       int ret = 0;
  728.   
  729.       BN_CTX_start(ctx);
             ^
  730.       if ((b = BN_CTX_get(ctx)) == NULL)
  731.           goto err;

crypto/bn/bn_ctx.c:171:1: Parameter `ctx->stack.depth`
    169.   }
    170.   
    171. > void BN_CTX_start(BN_CTX *ctx)
    172.   {
    173.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_gf2m.c:755:5: Call
  753.   
  754.    err:
  755.       BN_CTX_end(ctx);
             ^
  756.       return ret;
  757.   }

crypto/bn/bn_ctx.c:185:1: Parameter `ctx->stack.depth`
    183.   }
    184.   
    185. > void BN_CTX_end(BN_CTX *ctx)
    186.   {
    187.       if (ctx == NULL)

crypto/bn/bn_gf2m.c:807:10: Call
805.       if (!BN_GF2m_mod_inv(xinv, x, p, ctx))
806.           goto err;
807.       if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx))
                ^
808.           goto err;
809.       bn_check_top(r);

crypto/bn/bn_gf2m.c:465:1: Parameter `ctx->stack.depth`
  463.    * BN_GF2m_mod_mul_arr function.
  464.    */
  465. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  466.                       const BIGNUM *p, BN_CTX *ctx)
  467.   {

crypto/bn/bn_gf2m.c:481:11: Call
  479.           goto err;
  480.       }
  481.       ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
                   ^
  482.       bn_check_top(r);
  483.    err:

crypto/bn/bn_gf2m.c:410:1: Parameter `ctx->stack.depth`
    408.    * the result in r.  r could be a or b; a could be b.
    409.    */
    410. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    411.                           const int p[], BN_CTX *ctx)
    412.   {

crypto/bn/bn_gf2m.c:421:16: Call
    419.   
    420.       if (a == b) {
    421.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                          ^
    422.       }
    423.   

crypto/bn/bn_gf2m.c:489:1: Parameter `ctx->stack.depth`
      487.   
      488.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
      489. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
      490.                           BN_CTX *ctx)
      491.   {

crypto/bn/bn_gf2m.c:496:5: Call
      494.   
      495.       bn_check_top(a);
      496.       BN_CTX_start(ctx);
                 ^
      497.       if ((s = BN_CTX_get(ctx)) == NULL)
      498.           goto err;

crypto/bn/bn_ctx.c:171:1: Parameter `ctx->stack.depth`
        169.   }
        170.   
        171. > void BN_CTX_start(BN_CTX *ctx)
        172.   {
        173.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_gf2m.c:514:5: Call
      512.       ret = 1;
      513.    err:
      514.       BN_CTX_end(ctx);
                 ^
      515.       return ret;
      516.   }

crypto/bn/bn_ctx.c:185:1: Parameter `ctx->stack.depth`
        183.   }
        184.   
        185. > void BN_CTX_end(BN_CTX *ctx)
        186.   {
        187.       if (ctx == NULL)

crypto/bn/bn_ctx.c:193:27: Call
        191.           ctx->err_stack--;
        192.       else {
        193.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                         ^
        194.           /* Does this stack frame have anything to release? */
        195.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:268:1: <LHS trace>
266.   }
267.   
268. > static unsigned int BN_STACK_pop(BN_STACK *st)
269.   {
270.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:268:1: Parameter `st->depth`
          266.   }
          267.   
          268. > static unsigned int BN_STACK_pop(BN_STACK *st)
          269.   {
          270.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:270:12: Binary operation: ([0, 6+max(0, ctx->stack.depth)] - 1):unsigned32 by call to `BN_GF2m_mod_mul` 
          268.   static unsigned int BN_STACK_pop(BN_STACK *st)
          269.   {
          270.       return st->indexes[--(st->depth)];
                            ^
          271.   }
          272.   
