Messages

Last Msg First Msg

method

void net.miginfocom.Base64()

method	net.miginfocom.Base64__static_init
presumption	CA.length@75 <= 2³²-1
presumption	CA[i]@75 <= 255
post	CA != null
post	IA == &new int[](Base64__static_init#1)
post	new int[](Base64__static_init#1) num objects == 1
post	IA.length == 256
post	init'ed(IA[...])
post	IA[61] == 0

method	char[] encodeToChar(byte[], bool)
pre	(soft) sArr.length in {0, 3..169_538_366}
pre	(soft) init'ed(sArr[...])
presumption	(((sArr[(sLen - 1)] mod 256)4) mod 2³² \| (sArr[eLen] mod 256)1_024) mod 64 < java.lang.String:toCharArray(...)@75.length
presumption	(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256) mod 64 < java.lang.String:toCharArray(.. .)@75.length
presumption	java.lang.String:toCharArray(...)@75.length >= 1
presumption	init'ed(java.lang.String:toCharArray(...)@75[...])
presumption	shr(((sArr[(sLen - 1)] mod 256)4) mod 2³² \| (sArr[eLen] mod 256)1_024, 12) < java.lang.String:toCharArray(...)@75.length
presumption	ushr(((sArr[(sLen - 1)] mod 256)4) mod 2³² \| (sArr[eLen] mod 256)1_024, 6) mod 64 < java.lang.String:toCharArray(...)@75. length
presumption	ushr(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256, 12) mod 64 < java.lang. String:toCharArray(...)@75.length
presumption	ushr(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256, 18) mod 64 < java.lang. String:toCharArray(...)@75.length
presumption	ushr(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256, 6) mod 64 < java.lang. String:toCharArray(...)@75.length
post	return_value in Addr_Set{&new char[](encodeToCh ar#2),&new char[](encodeToChar#1)}
post	new char[](encodeToChar#1) num objects <= 1
post	new char[](encodeToChar#1).length == 0
post	new char[](encodeToChar#2) num objects <= 1
post	new char[](encodeToChar#2).length == (((One-of{sArr.length, 0} - 1)/3)4 + 4) mod 2³² + One-of{((((((One-of{sArr.length, 0} - 1)/3)4 + 4) mod 2³² - 1)/76)*2) mod 2³², 0}
post	new char[](encodeToChar#2).length in {4..231_999_870}
post	possibly_updated(new char[](encodeToChar#2)[...])
test_vector	lineSep: {0}, {1}

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that s < sArr.length

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that d < dArr.length

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that cc in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	byte[] decode(char[])
pre	(soft) init'ed(IA[...])
pre	(soft) sArr.length <= 2³²-1
pre	(soft) sArr[...] <= 255
post	return_value in Addr_Set{null,&new byte[](decode#2),&new byte[](decode#1)}
post	new byte[](decode#1) num objects <= 1
post	new byte[](decode#1).length == 0
post	new byte[](decode#2) num objects <= 1
post	new byte[](decode#2).length in {0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150...
post	possibly_updated(new byte[](decode#2)[...])
test_vector	IA[...]: {1..2³²-1}, {-2³¹. .-1}
test_vector	sArr[...]: {0..60, 62..255}, {61}

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that pad in {-2³¹-1..2³²-2}

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that len >= 0

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that s < sArr.length

overflow

Low Prob.

check that s in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	byte[] decodeFast(char[])
pre	sArr != null
pre	sArr.length in {0, 4..2³²-1}
pre	(soft) init'ed(IA[...])
pre	(soft) sArr[...] <= 255
pre	(soft) sArr[76] <= 255
post	return_value in Addr_Set{&new byte[](decodeFast #2),&new byte[](decodeFast#1)}
post	new byte[](decodeFast#1) num objects <= 1
post	new byte[](decodeFast#1).length == 0
post	new byte[](decodeFast#2) num objects <= 1
post	new byte[](decodeFast#2).length <= 2³¹
post	possibly_updated(new byte[](decodeFast#2)[...])
test_vector	IA[...]: {0..2³²-1}, {-2³¹. .-1}
test_vector	sArr.length: {77..2³²-1}, {0}

Prev Msg Next Msg

suspicious precondition

click for all messages in this file Medium Prob.

The precondition for sArr.length is not a contiguous range of values

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that (eIx - 1) >= 0

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that len >= 0

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that sIx < sArr.length

array index out of bounds

Medium Prob.

check that sIx < sArr.length

overflow

Low Prob.

check that sIx in {-2³¹-1..2³²-2}

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that d < dArr.length

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that cc in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	byte[] encodeToByte(byte[], bool)
pre	(soft) sArr.length in {0, 3..132_343_121}
pre	(soft) init'ed(sArr[...])
presumption	(((sArr[(sLen - 1)] mod 256)4) mod 2³² \| (sArr[eLen] mod 256)1_024) mod 64 < java.lang.String:toCharArray(...)@75.length
presumption	(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256) mod 64 < java.lang.String:toCharArray(.. .)@75.length
presumption	java.lang.String:toCharArray(...)@75.length >= 1
presumption	init'ed(java.lang.String:toCharArray(...)@75[...])
presumption	shr(((sArr[(sLen - 1)] mod 256)4) mod 2³² \| (sArr[eLen] mod 256)1_024, 12) < java.lang.String:toCharArray(...)@75.length
presumption	ushr(((sArr[(sLen - 1)] mod 256)4) mod 2³² \| (sArr[eLen] mod 256)1_024, 6) mod 64 < java.lang.String:toCharArray(...)@75. length
presumption	ushr(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256, 12) mod 64 < java.lang. String:toCharArray(...)@75.length
presumption	ushr(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256, 18) mod 64 < java.lang. String:toCharArray(...)@75.length
presumption	ushr(sArr[s] \| (sArr[s] mod 256)2¹⁶ \| (sArr[s] mod 256)256, 6) mod 64 < java.lang. String:toCharArray(...)@75.length
post	return_value in Addr_Set{&new byte[](encodeToBy te#2),&new byte[](encodeToByte#1)}
post	new byte[](encodeToByte#1) num objects <= 1
post	new byte[](encodeToByte#1).length == 0
post	new byte[](encodeToByte#2) num objects <= 1
post	new byte[](encodeToByte#2).length == (((One-of{sArr.length, 0} - 1)/3)4 + 4) mod 2³² + One-of{((((((One-of{sArr.length, 0} - 1)/3)4 + 4) mod 2³² - 1)/76)*2) mod 2³², 0}
post	new byte[](encodeToByte#2).length in {4..181_101_114}
post	possibly_updated(new byte[](encodeToByte#2)[...])
test_vector	lineSep: {0}, {1}

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that s < sArr.length

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that d < dArr.length

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that cc in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	byte[] decode(byte[])
pre	sArr != null
pre	(soft) init'ed(IA[...])
pre	(soft) sArr.length in {1..2³²-1}
pre	(soft) init'ed(sArr[...])
post	return_value in Addr_Set{null,&new byte[](decode#1)}
post	new byte[](decode#1) num objects <= 1
post	new byte[](decode#1).length in {0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150...
post	possibly_updated(new byte[](decode#1)[...])
test_vector	IA[...]: {1..2³²-1}, {-2³¹.. -1}
test_vector	sArr[...]: {-128..60, 62..255}, {61}

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that pad in {-2³¹-1..2³²-2}

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that len >= 0

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that s < sArr.length

overflow

Low Prob.

check that s in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	byte[] decodeFast(byte[])
pre	sArr != null
pre	sArr.length in {0, 4..2³²-1}
pre	(soft) init'ed(IA[...])
pre	(soft) sArr[...] >= 0
pre	(soft) sArr[76] >= 0
post	return_value in Addr_Set{&new byte[](decodeFast #2),&new byte[](decodeFast#1)}
post	new byte[](decodeFast#1) num objects <= 1
post	new byte[](decodeFast#1).length == 0
post	new byte[](decodeFast#2) num objects <= 1
post	new byte[](decodeFast#2).length <= 2³¹
post	possibly_updated(new byte[](decodeFast#2)[...])
test_vector	IA[...]: {0..2³²-1}, {-2³¹.. -1}
test_vector	sArr.length: {77..2³²-1}, {0}

Prev Msg Next Msg

suspicious precondition

click for all messages in this file Medium Prob.

The precondition for sArr.length is not a contiguous range of values

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that (eIx - 1) >= 0

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that len >= 0

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that d < dArr.length

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that cc in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	String encodeToString(byte[], bool)
pre	(soft) sArr.length in {0, 3..169_538_366}
pre	(soft) init'ed(sArr[...])
post	return_value == &new String(encodeToString#1)
post	new String(encodeToString#1) num objects == 1

method	byte[] decode(String)
pre	(soft) init'ed(IA[...])
presumption	java.lang.String:charAt(...)@473 <= 255
presumption	java.lang.String:charAt(...)@482 <= 255
presumption	java.lang.String:charAt(...)@494 <= 255
post	return_value in Addr_Set{null,&new byte[](decode#2),&new byte[](decode#1)}
post	new byte[](decode#1) num objects <= 1
post	new byte[](decode#1).length == 0
post	new byte[](decode#2) num objects <= 1
post	new byte[](decode#2).length in {0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150...
post	possibly_updated(new byte[](decode#2)[...])
test_vector	IA[...]: {1..2³²-1}, {-2³¹. .-1}
test_vector	java.lang.String:charAt(...)@483: {0..60, 62..2¹⁶-1}, {61}

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that pad in {-2³¹-1..2³²-2}

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that len >= 0

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that s in {-2³¹-1..2³²-2}

Prev Msg Next Msg

method	byte[] decodeFast(String)
pre	s != null
pre	(soft) init'ed(IA[...])
presumption	java.lang.String:charAt(...)@549 <= 255
presumption	java.lang.String:charAt(...)@567 <= 255
presumption	java.lang.String:length(...)@523 not in {1..3}
post	return_value in Addr_Set{&new byte[](decodeFast #2),&new byte[](decodeFast#1)}
post	new byte[](decodeFast#1) num objects <= 1
post	new byte[](decodeFast#1).length == 0
post	new byte[](decodeFast#2) num objects <= 1
post	new byte[](decodeFast#2).length <= 2³¹
post	possibly_updated(new byte[](decodeFast#2)[...])
test_vector	IA[...]: {0..2³²-1}, {-2³¹. .-1}
test_vector	java.lang.String:length(...)@523: {77.. 2³²-1}, {0}

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that len >= 0

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that sIx in {-2³¹-1..2³²-2}

Prev Msg Next Msg

Prev Msg Next Msg

array index out of bounds

click for all messages in this file Medium Prob.

check that d < dArr.length

Prev Msg Next Msg

Prev Msg Next Msg

overflow

click for all messages in this file Low Prob.

check that cc in {-2³¹-1..2³²-2}

Prev Msg Next Msg