details

property	value
status	complete
benchmark	FiniteMap_intersectFM_C_7.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n181.star.cs.uiowa.edu
space	full_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	169.13 seconds
cpu usage	210.879
user time	206.707
system time	4.17186
max virtual memory	1.8285568E7
max residence set size	7459760.0

stage attributes

key	value
starexec-result	MAYBE

output

206.69/167.95 MAYBE 209.27/168.69 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 209.27/168.69 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 209.27/168.69 209.27/168.69 209.27/168.69 H-Termination with start terms of the given HASKELL could not be shown: 209.27/168.69 209.27/168.69 (0) HASKELL 209.27/168.69 (1) LR [EQUIVALENT, 0 ms] 209.27/168.69 (2) HASKELL 209.27/168.69 (3) CR [EQUIVALENT, 0 ms] 209.27/168.69 (4) HASKELL 209.27/168.69 (5) IFR [EQUIVALENT, 0 ms] 209.27/168.69 (6) HASKELL 209.27/168.69 (7) BR [EQUIVALENT, 0 ms] 209.27/168.69 (8) HASKELL 209.27/168.69 (9) COR [EQUIVALENT, 0 ms] 209.27/168.69 (10) HASKELL 209.27/168.69 (11) LetRed [EQUIVALENT, 0 ms] 209.27/168.69 (12) HASKELL 209.27/168.69 (13) NumRed [SOUND, 0 ms] 209.27/168.69 (14) HASKELL 209.27/168.69 209.27/168.69 209.27/168.69 ---------------------------------------- 209.27/168.69 209.27/168.69 (0) 209.27/168.69 Obligation: 209.27/168.69 mainModule Main 209.27/168.69 module FiniteMap where { 209.27/168.69 import qualified Main; 209.27/168.69 import qualified Maybe; 209.27/168.69 import qualified Prelude; 209.27/168.69 data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) ; 209.27/168.69 209.27/168.69 instance (Eq a, Eq b) => Eq FiniteMap a b where { 209.27/168.69 (==) fm_1 fm_2 = sizeFM fm_1 == sizeFM fm_2 && fmToList fm_1 == fmToList fm_2; 209.27/168.69 } 209.27/168.69 addToFM :: Ord b => FiniteMap b a -> b -> a -> FiniteMap b a; 209.27/168.69 addToFM fm key elt = addToFM_C (\old new ->new) fm key elt; 209.27/168.69 209.27/168.69 addToFM_C :: Ord a => (b -> b -> b) -> FiniteMap a b -> a -> b -> FiniteMap a b; 209.27/168.69 addToFM_C combiner EmptyFM key elt = unitFM key elt; 209.27/168.69 addToFM_C combiner (Branch key elt size fm_l fm_r) new_key new_elt | new_key < key = mkBalBranch key elt (addToFM_C combiner fm_l new_key new_elt) fm_r 209.27/168.69 | new_key > key = mkBalBranch key elt fm_l (addToFM_C combiner fm_r new_key new_elt) 209.27/168.69 | otherwise = Branch new_key (combiner elt new_elt) size fm_l fm_r; 209.27/168.69 209.27/168.69 deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b; 209.27/168.69 deleteMax (Branch key elt _ fm_l EmptyFM) = fm_l; 209.27/168.69 deleteMax (Branch key elt _ fm_l fm_r) = mkBalBranch key elt fm_l (deleteMax fm_r); 209.27/168.69 209.27/168.69 deleteMin :: Ord b => FiniteMap b a -> FiniteMap b a; 209.27/168.69 deleteMin (Branch key elt _ EmptyFM fm_r) = fm_r; 209.27/168.69 deleteMin (Branch key elt _ fm_l fm_r) = mkBalBranch key elt (deleteMin fm_l) fm_r; 209.27/168.69 209.27/168.69 emptyFM :: FiniteMap a b; 209.27/168.69 emptyFM = EmptyFM; 209.27/168.69 209.27/168.69 findMax :: FiniteMap a b -> (a,b); 209.27/168.69 findMax (Branch key elt _ _ EmptyFM) = (key,elt); 209.27/168.69 findMax (Branch key elt _ _ fm_r) = findMax fm_r; 209.27/168.69 209.27/168.69 findMin :: FiniteMap a b -> (a,b); 209.27/168.69 findMin (Branch key elt _ EmptyFM _) = (key,elt); 209.27/168.69 findMin (Branch key elt _ fm_l _) = findMin fm_l; 209.27/168.69 209.27/168.69 fmToList :: FiniteMap b a -> [(b,a)]; 209.27/168.69 fmToList fm = foldFM (\key elt rest ->(key,elt) : rest) [] fm; 209.27/168.69 209.27/168.69 foldFM :: (c -> b -> a -> a) -> a -> FiniteMap c b -> a; 209.27/168.69 foldFM k z EmptyFM = z; 209.27/168.69 foldFM k z (Branch key elt _ fm_l fm_r) = foldFM k (k key elt (foldFM k z fm_r)) fm_l; 209.27/168.69 209.27/168.69 glueBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b; 209.27/168.69 glueBal EmptyFM fm2 = fm2; 209.27/168.69 glueBal fm1 EmptyFM = fm1; 209.27/168.69 glueBal fm1 fm2 | sizeFM fm2 > sizeFM fm1 = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) 209.27/168.69 | otherwise = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 where { 209.27/168.69 mid_elt1 = (\(_,mid_elt1) ->mid_elt1) vv2; 209.27/168.69 mid_elt2 = (\(_,mid_elt2) ->mid_elt2) vv3; 209.27/168.69 mid_key1 = (\(mid_key1,_) ->mid_key1) vv2; 209.27/168.69 mid_key2 = (\(mid_key2,_) ->mid_key2) vv3; 209.27/168.69 vv2 = findMax fm1; 209.27/168.69 vv3 = findMin fm2; 209.27/168.69 }; 209.27/168.69 209.27/168.69 glueVBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b; 209.27/168.69 glueVBal EmptyFM fm2 = fm2; 209.27/168.69 glueVBal fm1 EmptyFM = fm1; 209.27/168.69 glueVBal fm_l@(Branch key_l elt_l _ fm_ll fm_lr) fm_r@(Branch key_r elt_r _ fm_rl fm_rr) | sIZE_RATIO * size_l < size_r = mkBalBranch key_r elt_r (glueVBal fm_l fm_rl) fm_rr 209.27/168.69 | sIZE_RATIO * size_r < size_l = mkBalBranch key_l elt_l fm_ll (glueVBal fm_lr fm_r) 209.27/168.69 | otherwise = glueBal fm_l fm_r where { 209.27/168.69 size_l = sizeFM fm_l; 209.27/168.69 size_r = sizeFM fm_r; 209.27/168.69 }; 209.27/168.69 209.27/168.69 intersectFM_C :: Ord d => (b -> c -> a) -> FiniteMap d b -> FiniteMap d c -> FiniteMap d a; 209.27/168.69 intersectFM_C combiner fm1 EmptyFM = emptyFM; 209.27/168.69 intersectFM_C combiner EmptyFM fm2 = emptyFM; 209.27/168.69 intersectFM_C combiner fm1 (Branch split_key elt2 _ left right) | Maybe.isJust maybe_elt1 = mkVBalBranch split_key (combiner elt1 elt2) (intersectFM_C combiner lts left) (intersectFM_C combiner gts right) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52