experiment: ci-run

workload: psqueues

strategy: quickcheck

property: OrdPsqFromListLastOccurrenceWins

mode: solve

status: failed

tool: quickcheck

counterexample: FromListArgs {fromListItems = [(4,19,3),(4,1,4),(1,-31,1)]}fromList: key 4: got Just (19,3), expected Just (1,4)


counterexample: FromListArgs {fromListItems = [(0,-3,2),(0,2,-2)]}fromList: key 0: got Just (-3,2), expected Just (2,-2)


counterexample: FromListArgs {fromListItems = [(0,6,2),(0,-44,-2)]}fromList: key 0: got Just (6,2), expected Just (-44,-2)


counterexample: FromListArgs {fromListItems = [(2,-22,0),(2,26,2)]}fromList: key 2: got Just (-22,0), expected Just (26,2)


counterexample: FromListArgs {fromListItems = [(1,-40,-3),(1,-21,-3)]}fromList: key 1: got Just (-40,-3), expected Just (-21,-3)


counterexample: FromListArgs {fromListItems = [(1,-47,-2),(1,34,-1)]}fromList: key 1: got Just (-47,-2), expected Just (34,-1)


counterexample: FromListArgs {fromListItems = [(4,23,-2),(1,50,4),(4,-31,-4)]}fromList: key 4: got Just (23,-2), expected Just (-31,-4)


counterexample: FromListArgs {fromListItems = [(3,-34,0),(3,29,-3),(4,-18,2)]}fromList: key 3: got Just (-34,0), expected Just (29,-3)


strategy: hedgehog

tool: hedgehog


strategy: falsify

tool: falsify

counterexample: FromListArgs {fromListItems = [(0,-50,-100),(0,-50,-99)]}: fromList: key 0: got Just (-50,-100), expected Just (-50,-99)


counterexample: FromListArgs {fromListItems = [(3,-50,-100),(3,-50,-99)]}: fromList: key 3: got Just (-50,-100), expected Just (-50,-99)


counterexample: FromListArgs {fromListItems = [(1,-50,-100),(1,-50,-99)]}: fromList: key 1: got Just (-50,-100), expected Just (-50,-99)


counterexample: FromListArgs {fromListItems = [(4,-50,-100),(4,-50,-99)]}: fromList: key 4: got Just (-50,-100), expected Just (-50,-99)


strategy: smallcheck

tool: smallcheck

counterexample: CounterExample ["FromListArgs {fromListItems = [(0,0,0),(0,0,1)]}"] (PropertyFalse Nothing)


property: HashPsqInsertEqualPriorityKeyTieBreak

counterexample: EqPriorityArgs {epK1 = -8, epK2 = -12, epPrio = 27, epV1 = 0, epV2 = 0}findMin: got Just (CK -8,27,0), expected Just (CK -12,27,0) (inserts: k1=-8, k2=-12, p=27)


counterexample: EqPriorityArgs {epK1 = 14, epK2 = 8, epPrio = 11, epV1 = -1, epV2 = 1}findMin: got Just (CK 14,11,-1), expected Just (CK 8,11,1) (inserts: k1=14, k2=8, p=11)


counterexample: EqPriorityArgs {epK1 = -8, epK2 = -12, epPrio = -47, epV1 = 0, epV2 = 0}findMin: got Just (CK -8,-47,0), expected Just (CK -12,-47,0) (inserts: k1=-8, k2=-12, p=-47)


counterexample: EqPriorityArgs {epK1 = 18, epK2 = -20, epPrio = -3, epV1 = 1, epV2 = 0}findMin: got Just (CK 18,-3,1), expected Just (CK -20,-3,0) (inserts: k1=18, k2=-20, p=-3)


counterexample: EqPriorityArgs {epK1 = -7, epK2 = -8, epPrio = -30, epV1 = 0, epV2 = 0}findMin: got Just (CK -7,-30,0), expected Just (CK -8,-30,0) (inserts: k1=-7, k2=-8, p=-30)


counterexample: EqPriorityArgs {epK1 = 12, epK2 = 6, epPrio = 45, epV1 = 3, epV2 = -1}findMin: got Just (CK 12,45,3), expected Just (CK 6,45,-1) (inserts: k1=12, k2=6, p=45)


counterexample: EqPriorityArgs {epK1 = 5, epK2 = 4, epPrio = 40, epV1 = -1, epV2 = 1}findMin: got Just (CK 5,40,-1), expected Just (CK 4,40,1) (inserts: k1=5, k2=4, p=40)


counterexample: EqPriorityArgs {epK1 = -1, epK2 = -18, epPrio = -6, epV1 = 0, epV2 = -1}findMin: got Just (CK -1,-6,0), expected Just (CK -18,-6,-1) (inserts: k1=-1, k2=-18, p=-6)


counterexample: EqPriorityArgs {epK1 = 18, epK2 = 0, epPrio = 46, epV1 = 3, epV2 = 2}findMin: got Just (CK 18,46,3), expected Just (CK 0,46,2) (inserts: k1=18, k2=0, p=46)


counterexample: EqPriorityArgs {epK1 = 1, epK2 = -15, epPrio = -32, epV1 = 0, epV2 = 0}findMin: got Just (CK 1,-32,0), expected Just (CK -15,-32,0) (inserts: k1=1, k2=-15, p=-32)


counterexample: CounterExample ["EqPriorityArgs {epK1 = 0, epK2 = -1, epPrio = 0, epV1 = 0, epV2 = 0}"] (PropertyFalse Nothing)


property: OrdPsqBalanceAfterOperations

status: passed