crypto/bn/bn_exp.c:437: error: INTEGER_OVERFLOW_L2
  ([0, 1] - [0, 1]):unsigned64 by call to `BN_mod_mul_montgomery`.
Showing all 20 steps of the trace


crypto/bn/bn_exp.c:437:7: Call
435.   	wend=0;		/* The bottom bit of the window */
436.   
437.   	if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
             ^
438.   	for (;;)
439.   		{

crypto/bn/bn_lib.c:133:2: Assignment
  131.   const BIGNUM *BN_value_one(void)
  132.   	{
  133.   	static BN_ULONG data_one=1L;
          ^
  134.   	static BIGNUM const_one={&data_one,1,1,0,BN_FLG_STATIC_DATA};
  135.   

crypto/bn/bn_exp.c:437:7: Call
435.   	wend=0;		/* The bottom bit of the window */
436.   
437.   	if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
             ^
438.   	for (;;)
439.   		{

crypto/bn/bn_mont.c:72:1: Parameter `*a->d`
  70.   #define MONT_WORD /* use the faster word-based algorithm */
  71.   
  72. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  73.   			  BN_MONT_CTX *mont, BN_CTX *ctx)
  74.   	{

crypto/bn/bn_mont.c:89:8: Call
  87.   	else
  88.   		{
  89.   		if (!BN_mul(tmp,a,b,ctx)) goto err;
               ^
  90.   		}
  91.   	/* reduce from aRR to aR */

crypto/bn/bn_mul.c:941:1: Parameter `*a->d`
    939.   #endif /* BN_RECURSION */
    940.   
    941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    942.   	{
    943.   	int ret=0;

crypto/bn/bn_mul.c:1030:5: Call
    1028.   				bn_wexpand(t,k*4);
    1029.   				bn_wexpand(rr,k*4);
    1030.   				bn_mul_part_recursive(rr->d,a->d,b->d,
                ^
    1031.   					j,al-j,bl-j,t->d);
    1032.   				}

crypto/bn/bn_mul.c:548:1: Parameter `*a`
      546.   /* n+tn is the word length
      547.    * t needs to be n*4 is size, as does r */
      548. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      549.   	     int tna, int tnb, BN_ULONG *t)
      550.   	{

crypto/bn/bn_mul.c:566:5: Call
      564.   
      565.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
      566.   	c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
                 ^
      567.   	c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
      568.   	zero=neg=0;

crypto/bn/bn_lib.c:880:1: Parameter `*b`
        878.      All lengths are the number of BN_ULONGs...  */
        879.   
        880. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
        881.   	int cl, int dl)
        882.   	{

crypto/bn/bn_mul.c:572:3: Call
      570.   		{
      571.   	case -4:
      572.   		bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
               ^
      573.   		bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
      574.   		break;

crypto/bn/bn_mul.c:80:1: Parameter `*b`
        78.      assembler counterparts for the systems that use assembler files.  */
        79.   
        80. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
        81.   	const BN_ULONG *a, const BN_ULONG *b,
        82.   	int cl, int dl)

crypto/bn/bn_mul.c:87:6: Call
        85.   
        86.   	assert(cl >= 0);
        87.   	c = bn_sub_words(r, a, b, cl);
                   ^
        88.   
        89.   	if (dl == 0)

crypto/bn/bn_asm.c:385:1: <LHS trace>
383.   #endif /* !BN_LLONG */
384.   
385. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
386.           {
387.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:385:1: Parameter `*a`
          383.   #endif /* !BN_LLONG */
          384.   
          385. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
          386.           {
          387.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:395:3: Assignment
          393.   	for (;;)
          394.   		{
          395.   		t1=a[0]; t2=b[0];
                   ^
          396.   		r[0]=(t1-t2-c)&BN_MASK2;
          397.   		if (t1 != t2) c=(t1 < t2);

crypto/bn/bn_asm.c:385:1: <RHS trace>
383.   #endif /* !BN_LLONG */
384.   
385. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
386.           {
387.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:385:1: Parameter `*b`
          383.   #endif /* !BN_LLONG */
          384.   
          385. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
          386.           {
          387.   	BN_ULONG t1,t2;

crypto/bn/bn_asm.c:395:12: Assignment
          393.   	for (;;)
          394.   		{
          395.   		t1=a[0]; t2=b[0];
                            ^
          396.   		r[0]=(t1-t2-c)&BN_MASK2;
          397.   		if (t1 != t2) c=(t1 < t2);

crypto/bn/bn_asm.c:396:3: Binary operation: ([0, 1] - [0, 1]):unsigned64 by call to `BN_mod_mul_montgomery` 
          394.   		{
          395.   		t1=a[0]; t2=b[0];
          396.   		r[0]=(t1-t2-c)&BN_MASK2;
                   ^
          397.   		if (t1 != t2) c=(t1 < t2);
          398.   		if (--n <= 0) break;
