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:86:9: Call
84.   
85.       /* p prime? */
86.       r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
              ^
87.       if (r != 1) {
88.           ret = r;

crypto/bn/bn_prime.c:296:1: Parameter `ctx_passed->stack.depth`
  294.   }
  295.   
  296. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  297.                      BN_GENCB *cb)
  298.   {

crypto/bn/bn_prime.c:299:12: Call
  297.                      BN_GENCB *cb)
  298.   {
  299.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  300.   }
  301.   

crypto/bn/bn_prime.c:302:1: Parameter `ctx_passed->stack.depth`
    300.   }
    301.   
    302. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    303.                               int do_trial_division, BN_GENCB *cb)
    304.   {

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

crypto/bn/bn_prime.c:296:1: Parameter `ctx_passed->stack.depth`
  294.   }
  295.   
  296. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  297.                      BN_GENCB *cb)
  298.   {

crypto/bn/bn_prime.c:299:12: Call
  297.                      BN_GENCB *cb)
  298.   {
  299.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  300.   }
  301.   

crypto/bn/bn_prime.c:302:1: Parameter `ctx_passed->stack.depth`
    300.   }
    301.   
    302. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    303.                               int do_trial_division, BN_GENCB *cb)
    304.   {

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

crypto/bn/bn_mul.c:883:1: Parameter `ctx->stack.depth`
  881.   #endif                          /* BN_RECURSION */
  882.   
  883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  884.   {
  885.       int ret = 0;

crypto/bn/bn_mul.c:909:5: Call
  907.       top = al + bl;
  908.   
  909.       BN_CTX_start(ctx);
             ^
  910.       if ((r == a) || (r == b)) {
  911.           if ((rr = BN_CTX_get(ctx)) == NULL)

crypto/bn/bn_ctx.c:253:1: Parameter `ctx->stack.depth`
    251.   }
    252.   
    253. > void BN_CTX_start(BN_CTX *ctx)
    254.   {
    255.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mul.c:1033:5: Call
  1031.    err:
  1032.       bn_check_top(r);
  1033.       BN_CTX_end(ctx);
              ^
  1034.       return (ret);
  1035.   }

crypto/bn/bn_ctx.c:267:1: Parameter `ctx->stack.depth`
    265.   }
    266.   
    267. > void BN_CTX_end(BN_CTX *ctx)
    268.   {
    269.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:273:27: Call
    271.           ctx->err_stack--;
    272.       else {
    273.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                     ^
    274.           /* Does this stack frame have anything to release? */
    275.           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:12: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mul` 
      351.   static unsigned int BN_STACK_pop(BN_STACK *st)
      352.   {
      353.       return st->indexes[--(st->depth)];
                        ^
      354.   }
      355.   
