/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty H-Termination with start terms of the given HASKELL could be disproven: (0) HASKELL (1) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) CR [EQUIVALENT, 0 ms] (4) HASKELL (5) BR [EQUIVALENT, 0 ms] (6) HASKELL (7) COR [EQUIVALENT, 0 ms] (8) HASKELL (9) Narrow [COMPLETE, 0 ms] (10) AND (11) QDP (12) NonTerminationLoopProof [COMPLETE, 0 ms] (13) NO (14) QDP ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\e->case k e of { IO k' -> k' f s} " is transformed to "catchHugsException0 k f s e = case k e of { IO k' -> k' f s} ; " The following Lambda expression "\fs->Hugs_Catch (m Hugs_Error (Hugs_Return . toObj)) (catchHugsException0 k f s) f (s . fromObj)" is transformed to "catchHugsException1 m k f s = Hugs_Catch (m Hugs_Error (Hugs_Return . toObj)) (catchHugsException0 k f s) f (s . fromObj); " ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (3) CR (EQUIVALENT) Case Reductions: The following Case expression "case k e of { IO k' -> k' f s} " is transformed to "catchHugsException00 f s (IO k') = k' f s; " ---------------------------------------- (4) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (5) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (6) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (7) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " ---------------------------------------- (8) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (9) Narrow (COMPLETE) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="catchHugsException",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="catchHugsException vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="catchHugsException vx3 vx4",fontsize=16,color="burlywood",shape="triangle"];47[label="vx3/IO vx30",fontsize=10,color="white",style="solid",shape="box"];4 -> 47[label="",style="solid", color="burlywood", weight=9]; 47 -> 5[label="",style="solid", color="burlywood", weight=3]; 48[label="vx3/AProVE_IO vx30",fontsize=10,color="white",style="solid",shape="box"];4 -> 48[label="",style="solid", color="burlywood", weight=9]; 48 -> 6[label="",style="solid", color="burlywood", weight=3]; 49[label="vx3/AProVE_Exception vx30",fontsize=10,color="white",style="solid",shape="box"];4 -> 49[label="",style="solid", color="burlywood", weight=9]; 49 -> 7[label="",style="solid", color="burlywood", weight=3]; 50[label="vx3/AProVE_Error vx30",fontsize=10,color="white",style="solid",shape="box"];4 -> 50[label="",style="solid", color="burlywood", weight=9]; 50 -> 8[label="",style="solid", color="burlywood", weight=3]; 5[label="catchHugsException (IO vx30) vx4",fontsize=16,color="black",shape="box"];5 -> 9[label="",style="solid", color="black", weight=3]; 6[label="catchHugsException (AProVE_IO vx30) vx4",fontsize=16,color="black",shape="box"];6 -> 10[label="",style="solid", color="black", weight=3]; 7[label="catchHugsException (AProVE_Exception vx30) vx4",fontsize=16,color="black",shape="box"];7 -> 11[label="",style="solid", color="black", weight=3]; 8[label="catchHugsException (AProVE_Error vx30) vx4",fontsize=16,color="black",shape="box"];8 -> 12[label="",style="solid", color="black", weight=3]; 9[label="(IO $ catchHugsException1 vx30 vx4)",fontsize=16,color="black",shape="box"];9 -> 13[label="",style="solid", color="black", weight=3]; 10[label="error []",fontsize=16,color="red",shape="box"];11[label="error []",fontsize=16,color="red",shape="box"];12[label="error []",fontsize=16,color="red",shape="box"];13[label="IO (catchHugsException1 vx30 vx4)",fontsize=16,color="green",shape="box"];13 -> 14[label="",style="dashed", color="green", weight=3]; 14[label="catchHugsException1 vx30 vx4",fontsize=16,color="grey",shape="box"];14 -> 15[label="",style="dashed", color="grey", weight=3]; 15[label="catchHugsException1 vx30 vx4 vx5",fontsize=16,color="grey",shape="box"];15 -> 16[label="",style="dashed", color="grey", weight=3]; 16[label="catchHugsException1 vx30 vx4 vx5 vx6",fontsize=16,color="black",shape="triangle"];16 -> 17[label="",style="solid", color="black", weight=3]; 17[label="Hugs_Catch (vx30 Hugs_Error (Hugs_Return . toObj)) (catchHugsException0 vx4 vx5 vx6) vx5 (vx6 . fromObj)",fontsize=16,color="green",shape="box"];17 -> 18[label="",style="dashed", color="green", weight=3]; 17 -> 19[label="",style="dashed", color="green", weight=3]; 17 -> 20[label="",style="dashed", color="green", weight=3]; 18[label="vx30 Hugs_Error (Hugs_Return . toObj)",fontsize=16,color="green",shape="box"];18 -> 21[label="",style="dashed", color="green", weight=3]; 18 -> 22[label="",style="dashed", color="green", weight=3]; 19[label="catchHugsException0 vx4 vx5 vx6",fontsize=16,color="grey",shape="box"];19 -> 23[label="",style="dashed", color="grey", weight=3]; 20[label="vx6 . fromObj",fontsize=16,color="grey",shape="box"];20 -> 24[label="",style="dashed", color="grey", weight=3]; 21[label="Hugs_Error",fontsize=16,color="green",shape="box"];22[label="Hugs_Return . toObj",fontsize=16,color="grey",shape="box"];22 -> 25[label="",style="dashed", color="grey", weight=3]; 23[label="catchHugsException0 vx4 vx5 vx6 vx7",fontsize=16,color="black",shape="triangle"];23 -> 26[label="",style="solid", color="black", weight=3]; 24[label="vx6 . fromObj",fontsize=16,color="black",shape="triangle"];24 -> 27[label="",style="solid", color="black", weight=3]; 25[label="Hugs_Return . toObj",fontsize=16,color="black",shape="triangle"];25 -> 28[label="",style="solid", color="black", weight=3]; 26 -> 29[label="",style="dashed", color="red", weight=0]; 26[label="catchHugsException00 vx5 vx6 (vx4 vx7)",fontsize=16,color="magenta"];26 -> 30[label="",style="dashed", color="magenta", weight=3]; 27[label="vx6 (fromObj vx8)",fontsize=16,color="green",shape="box"];27 -> 31[label="",style="dashed", color="green", weight=3]; 28[label="Hugs_Return (toObj vx9)",fontsize=16,color="green",shape="box"];28 -> 32[label="",style="dashed", color="green", weight=3]; 30[label="vx4 vx7",fontsize=16,color="green",shape="box"];30 -> 38[label="",style="dashed", color="green", weight=3]; 29[label="catchHugsException00 vx5 vx6 vx10",fontsize=16,color="burlywood",shape="triangle"];51[label="vx10/IO vx100",fontsize=10,color="white",style="solid",shape="box"];29 -> 51[label="",style="solid", color="burlywood", weight=9]; 51 -> 34[label="",style="solid", color="burlywood", weight=3]; 52[label="vx10/AProVE_IO vx100",fontsize=10,color="white",style="solid",shape="box"];29 -> 52[label="",style="solid", color="burlywood", weight=9]; 52 -> 35[label="",style="solid", color="burlywood", weight=3]; 53[label="vx10/AProVE_Exception vx100",fontsize=10,color="white",style="solid",shape="box"];29 -> 53[label="",style="solid", color="burlywood", weight=9]; 53 -> 36[label="",style="solid", color="burlywood", weight=3]; 54[label="vx10/AProVE_Error vx100",fontsize=10,color="white",style="solid",shape="box"];29 -> 54[label="",style="solid", color="burlywood", weight=9]; 54 -> 37[label="",style="solid", color="burlywood", weight=3]; 31[label="fromObj vx8",fontsize=16,color="black",shape="triangle"];31 -> 39[label="",style="solid", color="black", weight=3]; 32[label="toObj vx9",fontsize=16,color="black",shape="triangle"];32 -> 40[label="",style="solid", color="black", weight=3]; 38[label="vx7",fontsize=16,color="green",shape="box"];34[label="catchHugsException00 vx5 vx6 (IO vx100)",fontsize=16,color="black",shape="box"];34 -> 41[label="",style="solid", color="black", weight=3]; 35[label="catchHugsException00 vx5 vx6 (AProVE_IO vx100)",fontsize=16,color="black",shape="box"];35 -> 42[label="",style="solid", color="black", weight=3]; 36[label="catchHugsException00 vx5 vx6 (AProVE_Exception vx100)",fontsize=16,color="black",shape="box"];36 -> 43[label="",style="solid", color="black", weight=3]; 37[label="catchHugsException00 vx5 vx6 (AProVE_Error vx100)",fontsize=16,color="black",shape="box"];37 -> 44[label="",style="solid", color="black", weight=3]; 39 -> 31[label="",style="dashed", color="red", weight=0]; 39[label="fromObj vx8",fontsize=16,color="magenta"];40 -> 32[label="",style="dashed", color="red", weight=0]; 40[label="toObj vx9",fontsize=16,color="magenta"];41[label="vx100 vx5 vx6",fontsize=16,color="green",shape="box"];41 -> 45[label="",style="dashed", color="green", weight=3]; 41 -> 46[label="",style="dashed", color="green", weight=3]; 42[label="error []",fontsize=16,color="red",shape="box"];43[label="error []",fontsize=16,color="red",shape="box"];44[label="error []",fontsize=16,color="red",shape="box"];45[label="vx5",fontsize=16,color="green",shape="box"];46[label="vx6",fontsize=16,color="green",shape="box"];} ---------------------------------------- (10) Complex Obligation (AND) ---------------------------------------- (11) Obligation: Q DP problem: The TRS P consists of the following rules: new_fromObj(vx8, h, []) -> new_fromObj(vx8, h, []) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (12) NonTerminationLoopProof (COMPLETE) We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. Found a loop by semiunifying a rule from P directly. s = new_fromObj(vx8, h, []) evaluates to t =new_fromObj(vx8, h, []) Thus s starts an infinite chain as s semiunifies with t with the following substitutions: * Matcher: [ ] * Semiunifier: [ ] -------------------------------------------------------------------------------- Rewriting sequence The DP semiunifies directly so there is only one rewrite step from new_fromObj(vx8, h, []) to new_fromObj(vx8, h, []). ---------------------------------------- (13) NO ---------------------------------------- (14) Obligation: Q DP problem: The TRS P consists of the following rules: new_toObj(vx9, h, []) -> new_toObj(vx9, h, []) R is empty. Q is empty. We have to consider all (P,Q,R)-chains.