crypto/bn/bn_prime.c:258: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 17 steps of the trace


crypto/bn/bn_prime.c:247:1: Parameter `ctx->stack.depth`
245.   }
246.   
247. > static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
248.                      const BIGNUM *a1_odd, int k, BN_CTX *ctx,
249.                      BN_MONT_CTX *mont)

crypto/bn/bn_prime.c:251:10: Call
249.                      BN_MONT_CTX *mont)
250.   {
251.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                ^
252.           return -1;
253.       if (BN_is_one(w))

crypto/bn/bn_exp.c:296:1: Parameter `ctx->stack.depth`
  294.   }
  295.   
  296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  298.   {

crypto/bn/bn_prime.c:258:14: Call
256.           return 0;               /* w == -1 (mod a), 'a' is probably prime */
257.       while (--k) {
258.           if (!BN_mod_mul(w, w, w, a, ctx)) /* w := w^2 mod a */
                    ^
259.               return -1;
260.           if (BN_is_one(w))

crypto/bn/bn_mod.c:73:1: Parameter `ctx->stack.depth`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:83:5: Call
  81.       bn_check_top(m);
  82.   
  83.       BN_CTX_start(ctx);
            ^
  84.       if ((t = BN_CTX_get(ctx)) == NULL)
  85.           goto err;

crypto/bn/bn_ctx.c:181:1: Parameter `ctx->stack.depth`
    179.   }
    180.   
    181. > void BN_CTX_start(BN_CTX *ctx)
    182.   {
    183.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:90:14: Call
  88.               goto err;
  89.       } else {
  90.           if (!BN_mul(t, a, b, ctx))
                     ^
  91.               goto err;
  92.       }

crypto/bn/bn_mul.c:497:1: Parameter `ctx->stack.depth`
    495.   #endif                          /* BN_RECURSION */
    496.   
    497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = 0;

crypto/bn/bn_mul.c:523:5: Call
    521.       top = al + bl;
    522.   
    523.       BN_CTX_start(ctx);
               ^
    524.       if ((r == a) || (r == b)) {
    525.           if ((rr = BN_CTX_get(ctx)) == NULL)

crypto/bn/bn_ctx.c:181:1: Parameter `ctx->stack.depth`
      179.   }
      180.   
      181. > void BN_CTX_start(BN_CTX *ctx)
      182.   {
      183.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mul.c:608:5: Call
    606.    err:
    607.       bn_check_top(r);
    608.       BN_CTX_end(ctx);
               ^
    609.       return ret;
    610.   }

crypto/bn/bn_ctx.c:195:1: Parameter `ctx->stack.depth`
      193.   }
      194.   
      195. > void BN_CTX_end(BN_CTX *ctx)
      196.   {
      197.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:201:27: Call
      199.           ctx->err_stack--;
      200.       else {
      201.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      202.           /* Does this stack frame have anything to release? */
      203.           if (fp < ctx->used)

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

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

crypto/bn/bn_ctx.c:273:12: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul` 
        271.   static unsigned int BN_STACK_pop(BN_STACK *st)
        272.   {
        273.       return st->indexes[--(st->depth)];
                          ^
        274.   }
        275.   
