Session.name = Formal_SSA
Loading theory "AuxLemmas" (required by "AdditionalLemmas" via "WellFormed" via "Interpretation" via "WCFG" via "BasicDefs")
loading_theory = AuxLemmas
Loading theory "Char_ord"
loading_theory = Char_ord
Loading theory "Com" (required by "AdditionalLemmas" via "WellFormed" via "Interpretation" via "WCFG")
loading_theory = Com
Loading theory "Graph" (required by "GraphSpec")
loading_theory = Graph
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=97name=theoryelapsed=0.113
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=127name=theoryelapsed=0.139
instantiation
  char :: linorder
  less_eq_char == less_eq :: char \<Rightarrow> char \<Rightarrow> bool
  less_char == less :: char \<Rightarrow> char \<Rightarrow> bool
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=201name=definitionelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=256name=definitionelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=33name=theoryelapsed=0.173
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=389name=lemmaelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=600name=lemmaelapsed=0.010
instantiation
  char :: distrib_lattice
  inf_char == inf :: char \<Rightarrow> char \<Rightarrow> char
  sup_char == sup :: char \<Rightarrow> char \<Rightarrow> char
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=172name=lemmaelapsed=0.024
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=854name=definitionelapsed=0.022
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=22name=theoryelapsed=0.220
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1145name=lemmaelapsed=0.021
ML_statistics = :now=1464804819.86tasks_ready=35tasks_pending=26tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=0size_allocation=309329920size_allocation_free=8726432size_heap=309329920size_heap_free_last_full_GC=0size_heap_free_last_GC=0threads_in_ML=5threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=10.308time_GC=0user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=891name=definitionelapsed=0.020
instantiation
  String.literal :: linorder
  less_eq_literal == less_eq ::
    String.literal \<Rightarrow> String.literal \<Rightarrow> bool
  less_literal == less ::
    String.literal \<Rightarrow> String.literal \<Rightarrow> bool
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2010name=lemmaelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=1105name=lift_definitionelapsed=0.031
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=1202name=lift_definitionelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2293name=lemmaelapsed=0.029
### theory "Char_ord"
### 0.350s elapsed time, 0.896s cpu time, 0.000s GC time
Loading theory "List_lexord"
loading_theory = List_lexord
### theory "AuxLemmas"
### 0.342s elapsed time, 0.880s cpu time, 0.000s GC time
Loading theory "BasicDefs" (required by "AdditionalLemmas" via "WellFormed" via "Interpretation" via "WCFG")
loading_theory = BasicDefs
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=121name=theoryelapsed=0.093
instantiation
  list :: (ord) ord
  less_eq_list == less_eq ::
    'a list \<Rightarrow> 'a list \<Rightarrow> bool
  less_list == less :: 'a list \<Rightarrow> 'a list \<Rightarrow> bool
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=199name=definitionelapsed=0.026
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=274name=definitionelapsed=0.020
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=1269name=instanceelapsed=0.011
instantiation
  list :: (linorder) distrib_lattice
  inf_list == inf :: 'a list \<Rightarrow> 'a list \<Rightarrow> 'a list
  sup_list == sup :: 'a list \<Rightarrow> 'a list \<Rightarrow> 'a list
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=30name=theoryelapsed=0.194
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=1602name=definitionelapsed=0.039
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=1643name=definitionelapsed=0.037
instantiation
  list :: (order) order_bot
  bot_list == bot :: 'a list
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=2324name=definitionelapsed=0.018
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=2401name=lemmaelapsed=0.011
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=2605name=lemmaelapsed=0.020
### theory "List_lexord"
### 0.356s elapsed time, 1.148s cpu time, 0.000s GC time
Loading theory "Mapping" (required by "RBT_Mapping")
loading_theory = Mapping
ML_statistics = :now=1464804820.36tasks_ready=190tasks_pending=25tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=0size_allocation=955252736size_allocation_free=163480400size_heap=955252736size_heap_free_last_full_GC=0size_heap_free_last_GC=0threads_in_ML=5threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=11.58time_GC=0user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=153name=theoryelapsed=0.127
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=616name=lemmaelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=819name=lemmaelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=1413name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=1413name=lemmaelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=1619name=lemmaelapsed=0.031
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=1619name=lemmaelapsed=0.032
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=1941name=lemmaelapsed=0.031
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2186name=lemmaelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2750name=lemmaelapsed=0.033
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2954name=lemmaelapsed=0.046
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2954name=lemmaelapsed=0.011
ML_statistics = :now=1464804820.86tasks_ready=224tasks_pending=25tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=0size_allocation=1667235840size_allocation_free=304683480size_heap=1667235840size_heap_free_last_full_GC=0size_heap_free_last_GC=0threads_in_ML=5threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=12.844time_GC=0user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3284name=lemmaelapsed=0.046
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=341name=recordelapsed=1.027
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3284name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=221name=datatypeelapsed=1.171
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3649name=typedefelapsed=0.019
locale valid_graph =
  fixes G :: "('v, 'w) graph" 
  assumes "valid_graph G"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=489name=localeelapsed=0.049
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=679name=abbreviationelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3649name=typedefelapsed=0.066
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=711name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=1027name=definitionelapsed=0.034
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=1131name=definitionelapsed=0.037
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=1301name=definitionelapsed=0.065
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3730name=setup_liftingelapsed=0.184
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=1470name=definitionelapsed=0.359
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=1639name=definitionelapsed=0.012
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=1784name=definitionelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3769name=lift_definitionelapsed=0.353
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3769name=lift_definitionelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3859name=lift_definitionelapsed=0.019
locale valid_graph =
  fixes G :: "('v, 'w) graph" 
  assumes "valid_graph G"
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3859name=lift_definitionelapsed=0.035
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=3970name=definitionelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4173name=lift_definitionelapsed=0.024
ML_statistics = :now=1464804821.63tasks_ready=372tasks_pending=25tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=1size_allocation=2097152000size_allocation_free=2097152000size_heap=2150629376size_heap_free_last_full_GC=0size_heap_free_last_GC=2098063528threads_in_ML=1threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=14.46time_GC=0.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4303name=lift_definitionelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4430name=lift_definitionelapsed=0.037
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4598name=lift_definitionelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4688name=lift_definitionelapsed=0.022
Found termination order:
  "(\<lambda>p. size_list (\<lambda>p. size (snd p)) (fst (snd p))) <*mlex*>
   {}"
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4843name=lift_definitionelapsed=0.018
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=4207name=funelapsed=0.195
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=4995name=lift_definitionelapsed=0.028
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=5196name=definitionelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=5149name=lift_definitionelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=5524name=lemmaelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=5276name=lift_definitionelapsed=0.029
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=5909name=lemmaelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=5488name=lift_definitionelapsed=0.028
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7139name=lemmaelapsed=0.024
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=5673name=definitionelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=5977name=definitionelapsed=0.010
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8626name=lemmaelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=6329name=definitionelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=6467name=definitionelapsed=0.011
locale valid_mgraph =
  fixes G :: "('v, 'w) graph" 
  assumes "valid_mgraph G"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9497name=localeelapsed=0.055
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9571name=definitionelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=6663name=lift_definitionelapsed=0.026
### theory "Graph"
### 2.371s elapsed time, 7.284s cpu time, 0.320s GC time
Loading theory "RBT_Set"
loading_theory = RBT_Set
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=6982name=definitionelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=7132name=definitionelapsed=0.011
instantiation
  mapping :: (type, type) equal
  equal_mapping == equal_class.equal ::
    ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping \<Rightarrow> bool
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=7308name=definitionelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=917name=datatypeelapsed=1.903
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=423name=datatypeelapsed=1.170
ML_statistics = :now=1464804822.14tasks_ready=545tasks_pending=25tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=1size_allocation=2097152000size_allocation_free=920302664size_heap=2150629376size_heap_free_last_full_GC=0size_heap_free_last_GC=2098063528threads_in_ML=5threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=16.22time_GC=0.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
Found termination order: "{}"
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=1111name=funelapsed=0.097
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=11050name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=125name=theoryelapsed=0.202
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=13081name=lemmaelapsed=0.013
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=564name=definitionelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=669name=definitionelapsed=0.019
### Code generator: dropping subsumed code equation
### {} \<equiv> set []
### Code generator: dropping subsumed code equation
### Set.is_empty (set ?xs) \<equiv> List.null ?xs
### Code generator: dropping subsumed code equation
### - List.coset ?xs \<equiv> set ?xs
### Code generator: dropping subsumed code equation
### - set ?xs \<equiv> List.coset ?xs
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=13821name=lemmaelapsed=0.016
### Code generator: dropping subsumed code equation
### ?x \<in> List.coset ?xs \<equiv> \<not> List.member ?xs ?x
### Code generator: dropping subsumed code equation
### ?x \<in> set ?xs \<equiv> List.member ?xs ?x
### Code generator: dropping subsumed code equation
### insert ?x (List.coset ?xs) \<equiv> List.coset (removeAll ?x ?xs)
### Code generator: dropping subsumed code equation
### insert ?x (set ?xs) \<equiv> set (List.insert ?x ?xs)
Found termination order: "(\<lambda>p. size_list size (fst p)) <*mlex*> {}"
### Code generator: dropping subsumed code equation
### Set.remove ?x (List.coset ?xs) \<equiv> List.coset (List.insert ?x ?xs)
### Code generator: dropping subsumed code equation
### Set.remove ?x (set ?xs) \<equiv> set (removeAll ?x ?xs)
### Code generator: dropping subsumed code equation
### UNIV \<equiv> List.coset []
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14087name=lemmaelapsed=0.015
### Code generator: dropping subsumed code equation
### Set.filter ?P (set ?xs) \<equiv> set (List.filter ?P ?xs)
### Code generator: dropping subsumed code equation
### ?f ` set ?xs \<equiv> set (map ?f ?xs)
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=1224name=funelapsed=0.159
### Code generator: dropping subsumed code equation
### List.coset [] \<subseteq> set [] \<equiv> False
### Code generator: dropping subsumed code equation
### ?A \<subseteq> List.coset ?ys \<equiv> \<forall>y\<in>set ?ys. y \<notin> ?A
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14328name=lemmaelapsed=0.012
### Code generator: dropping subsumed code equation
### set ?xs \<subseteq> ?B \<equiv> \<forall>x\<in>set ?xs. x \<in> ?B
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=1335name=lemmaelapsed=0.013
### Code generator: dropping subsumed code equation
### Ball (set ?xs) ?P \<equiv> list_all ?P ?xs
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14493name=lemmaelapsed=0.010
### Code generator: dropping subsumed code equation
### Bex (set ?xs) ?P \<equiv> list_ex ?P ?xs
### Code generator: dropping subsumed code equation
### can_select ?P (set ?A) \<equiv> list_ex1 ?P ?A
### Code generator: dropping subsumed code equation
### List.coset ?xs \<union> ?A \<equiv>
### List.coset [x\<leftarrow>?xs . x \<notin> ?A]
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14836name=lemmaelapsed=0.010
### Code generator: dropping subsumed code equation
### set ?xs \<union> ?A \<equiv> fold insert ?xs ?A
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=1539name=lemmaelapsed=0.016
### Code generator: dropping subsumed code equation
### ?A - List.coset ?xs \<equiv> set [x\<leftarrow>?xs . x \<in> ?A]
### Code generator: dropping subsumed code equation
### ?A - set ?xs \<equiv> fold Set.remove ?xs ?A
### Code generator: dropping subsumed code equation
### ?A \<inter> List.coset ?xs \<equiv> fold Set.remove ?xs ?A
### Code generator: dropping subsumed code equation
### ?A \<inter> set ?xs \<equiv> set [x\<leftarrow>?xs . x \<in> ?A]
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=1677name=lemmaelapsed=0.013
### Code generator: dropping subsumed code equation
### card (set ?xs) \<equiv> length (remdups ?xs)
### Code generator: dropping subsumed code equation
### the_elem (set [?x]) \<equiv> ?x
### Code generator: dropping subsumed code equation
### Pow (set (?x # ?xs)) \<equiv>
### let A = Pow (set ?xs) in A \<union> insert ?x ` A
### Code generator: dropping subsumed code equation
### Pow (set []) \<equiv> {{}}
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=1827name=lemmaelapsed=0.011
### Code generator: dropping subsumed code equation
### setsum ?g (set ?xs) \<equiv> listsum (map ?g (remdups ?xs))
### Code generator: dropping subsumed code equation
### setprod ?g (set ?xs) \<equiv> listprod (map ?g (remdups ?xs))
### Code generator: dropping subsumed code equation
### Product_Type.product (set ?xs) (set ?ys) \<equiv>
### set (concat (map (\<lambda>x. map (Pair x) ?ys) ?xs))
### Code generator: dropping subsumed code equation
### Id_on (set ?xs) \<equiv> set (map (\<lambda>x. (x, x)) ?xs)
### Code generator: dropping subsumed code equation
### ?R `` ?S \<equiv>
### List.map_project (\<lambda>(x, y). if x \<in> ?S then Some y else None) ?R
### Code generator: dropping subsumed code equation
### (set ?xs)\<^sup>+ \<equiv> ntrancl (card (set ?xs) - 1) (set ?xs)
### Code generator: dropping subsumed code equation
### set ?xys O set ?yzs \<equiv>
### set (concat
###       (map (\<lambda>xy.
###                concat
###                 (map (\<lambda>yz.
###                          if snd xy = fst yz then [(fst xy, snd yz)] else [])
###                   ?yzs))
###         ?xys))
### Code generator: dropping subsumed code equation
### wf (set ?xs) \<equiv> acyclic (set ?xs)
### Code generator: dropping subsumed code equation
### Min (set (?x # ?xs)) \<equiv> fold min ?xs ?x
### Code generator: dropping subsumed code equation
### \<Sqinter>\<^sub>f\<^sub>i\<^sub>nset (?x # ?xs) \<equiv> fold inf ?xs ?x
Found termination order: "{}"
### Equation not headed by constant, in theorem:
### INFIMUM \<equiv> INFIMUM
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=2366name=lemmaelapsed=0.011
### Code generator: dropping subsumed code equation
### Max (set (?x # ?xs)) \<equiv> fold max ?xs ?x
### Code generator: dropping subsumed code equation
### \<Squnion>\<^sub>f\<^sub>i\<^sub>nset (?x # ?xs) \<equiv> fold sup ?xs ?x
### Equation not headed by constant, in theorem:
### SUPREMUM \<equiv> SUPREMUM
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=1368name=funelapsed=0.239
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=2508name=lemmaelapsed=0.012
### Code generator: dropping subsumed code equation
### \<Inter>set ?xs \<equiv> fold op \<inter> ?xs UNIV
### Code generator: dropping subsumed code equation
### \<Union>set ?xs \<equiv> fold op \<union> ?xs {}
### Code generator: dropping subsumed code equation
### sorted_list_of_set (set ?xs) \<equiv> sort (remdups ?xs)
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=18492name=lemmaelapsed=0.017
### Code generator: dropping subsumed code equation
### List.map_project ?f (set ?xs) \<equiv> set (List.map_filter ?f ?xs)
### Code generator: dropping subsumed code equation
### Bleast (set ?xs) ?P \<equiv>
### case List.filter ?P (sort ?xs) of [] \<Rightarrow> abort_Bleast (set ?xs) ?P
### | x # xs \<Rightarrow> x
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=2835name=lemmaelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19406name=lemmaelapsed=0.017
ML_statistics = :now=1464804822.64tasks_ready=769tasks_pending=25tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=1size_allocation=2677014528size_allocation_free=506278320size_heap=2730491904size_heap_free_last_full_GC=0size_heap_free_last_GC=2098063528threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=17.78time_GC=0.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19754name=lemmaelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=3291name=lemmaelapsed=0.014
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=3670name=definitionelapsed=0.026
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=20764name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=3976name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21074name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4498name=definitionelapsed=0.029
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4973name=lemmaelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=22880name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5267name=lemmaelapsed=0.015
Found termination order: "(\<lambda>p. size_list size (fst p)) <*mlex*> {}"
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23191name=lemmaelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23191name=lemmaelapsed=0.013
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5577name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=1472name=funelapsed=0.276
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5871name=lemmaelapsed=0.012
locale combine_mapping_abel_semigroup =
  fixes f :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" 
  assumes "combine_mapping_abel_semigroup op *"
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23368name=localeelapsed=0.031
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6272name=definitionelapsed=0.027
### theory "BasicDefs"
### 2.909s elapsed time, 9.332s cpu time, 0.320s GC time
Loading theory "CFG" (required by "AdditionalLemmas" via "WellFormed" via "Interpretation" via "CFGExit")
loading_theory = CFG
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6461name=definitionelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6569name=lemmaelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23430name=sublocaleelapsed=0.042
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6712name=lemmaelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23528name=lemmaelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23847name=lemmaelapsed=0.011
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6996name=lemmaelapsed=0.011
### Missing patterns in function definition:
### rbt_min_opt rbt.Empty = undefined
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=24067name=hide_constelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=20name=theoryelapsed=0.094
### theory "Mapping"
### 2.633s elapsed time, 8.468s cpu time, 0.320s GC time
Loading theory "RBT_Mapping"
loading_theory = RBT_Mapping
locale CFG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
  assumes "CFG sourcenode targetnode valid_edge (_Entry_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=91name=localeelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=516name=definitionelapsed=0.017
Proofs for inductive predicate(s) "path"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=872name=inductiveelapsed=0.077
### Ambiguous input (line 48 of "~~/afp/thys/Slicing/Basic/CFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.path" ("_position" n) ("\<^const>List.list.Nil")
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path" ("_position" n) ("\<^const>List.list.Nil")
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.path" ("_position" n) ("\<^const>List.list.Nil")
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop" ("_position" n))))
###     ("_position" n')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804823.14tasks_ready=853tasks_pending=23tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=1size_allocation=3375366144size_allocation_free=86827616size_heap=3428843520size_heap_free_last_full_GC=0size_heap_free_last_GC=2098063528threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=20.356time_GC=0.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### Ambiguous input (line 51 of "~~/afp/thys/Slicing/Basic/CFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.path" ("_position" n) ("_position" as)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("_Ball" ("_position" a)
###           ("_applC" ("_position" set) ("_position" as))
###           ("_applC" ("_position" valid_edge) ("_position" a)))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("_Ball" ("_position" a) ("_applC" ("_position" set) ("_position" as))
###       ("_applC" ("_position" valid_edge) ("_position" a)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2094name=lemmaelapsed=0.010
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=503name=datatypeelapsed=1.137
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3259name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3838name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=7214name=funelapsed=0.281
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=165name=theoryelapsed=0.247
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4690name=lemmaelapsed=0.012
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=7511name=lemmaelapsed=0.025
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=287name=lift_definitionelapsed=0.028
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=379name=code_datatypeelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5695name=definitionelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8167name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5795name=definitionelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5888name=definitionelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9671name=definitionelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9779name=lemmaelapsed=0.011
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9925name=lemmaelapsed=0.017
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=10149name=lemmaelapsed=0.015
### theory "CFG"
### 0.515s elapsed time, 1.680s cpu time, 0.000s GC time
Loading theory "CFGExit" (required by "AdditionalLemmas" via "WellFormed" via "Interpretation")
loading_theory = CFGExit
### Missing patterns in function definition:
### rbt_max_opt rbt.Empty = undefined
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=3408name=textelapsed=0.011
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=4427name=textelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1name=theoryelapsed=0.090
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=5182name=textelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=5657name=textelapsed=0.020
### theory "RBT_Mapping"
### 0.549s elapsed time, 1.780s cpu time, 0.000s GC time
Loading theory "CFG_wf" (required by "AdditionalLemmas" via "WellFormed" via "CFGExit_wf")
loading_theory = CFG_wf
locale CFGExit =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes "CFGExit sourcenode targetnode kind valid_edge (_Entry_) (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=91name=localeelapsed=0.088
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1334name=definitionelapsed=0.020
ML_statistics = :now=1464804823.64tasks_ready=1004tasks_pending=18tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=1size_allocation=4052746240size_allocation_free=202330560size_heap=4106223616size_heap_free_last_full_GC=0size_heap_free_last_GC=2098063528threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=21.644time_GC=0.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=36name=theoryelapsed=0.118
Found termination order: "size <*mlex*> {}"
### theory "CFGExit"
### 0.992s elapsed time, 1.656s cpu time, 0.696s GC time
Loading theory "Postdomination" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "PDG" via "StandardControlDependence")
loading_theory = Postdomination
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=10560name=funelapsed=1.012
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=10857name=lemmaelapsed=0.021
locale CFG_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
  assumes
    "CFG_wf sourcenode targetnode kind valid_edge (_Entry_) Def Use
      state_val"
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=123name=localeelapsed=0.806
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=13063name=lift_definitionelapsed=0.019
### theory "CFG_wf"
### 0.948s elapsed time, 1.576s cpu time, 0.696s GC time
Loading theory "CFGExit_wf" (required by "AdditionalLemmas" via "WellFormed")
loading_theory = CFGExit_wf
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=31name=theoryelapsed=0.085
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=13684name=lift_definitionelapsed=0.015
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=13757name=lift_definitionelapsed=0.015
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=14891name=lift_definitionelapsed=0.015
locale Postdomination =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes
    "Postdomination sourcenode targetnode kind valid_edge (_Entry_)
      (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=118name=localeelapsed=0.057
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=14964name=lift_definitionelapsed=0.015
### Ambiguous input (line 17 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 6 parse trees:
### ("\<^const>Pure.eq"
###   ("\<^fixed>postdominate" ("_position" n') ("_position" n))
###   ("\<^const>HOL.conj" ("_applC" ("_position" valid_node) ("_position" n))
###     ("\<^const>HOL.conj"
###       ("_applC" ("_position" valid_node) ("_position" n'))
###       ("\<^const>HOL.All_binder" ("_position" as)
###         ("\<^const>Set.member"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_node) ("_position" n))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_node) ("_position" n'))
###           ("\<^const>HOL.All_binder" ("_position" as)
###             ("\<^const>Set.member"
###               ("\<^const>local.path" ("_position" n) ("_position" as)
###                 ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>postdominate" ("_position" n') ("_position" n))
###   ("\<^const>HOL.conj" ("_applC" ("_position" valid_node) ("_position" n))
###     ("\<^const>HOL.conj"
###       ("_applC" ("_position" valid_node) ("_position" n'))
###       ("\<^const>HOL.All_binder" ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^fixed>Exit"))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_node) ("_position" n))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_node) ("_position" n'))
###           ("\<^const>HOL.All_binder" ("_position" as)
###             ("\<^const>HOL.implies"
###               ("\<^const>local.path" ("_position" n) ("_position" as)
###                 ("\<^fixed>Exit"))
###               ("\<^const>Set.member" ("_position" n')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes)
###                     ("_position" as)))))))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>postdominate" ("_position" n') ("_position" n))
###   ("\<^const>HOL.conj" ("_applC" ("_position" valid_node) ("_position" n))
###     ("\<^const>HOL.conj"
###       ("_applC" ("_position" valid_node) ("_position" n'))
###       ("\<^const>HOL.All_binder" ("_position" as)
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.implies" ("\<^fixed>Exit")
###             ("\<^const>Set.member" ("_position" n')
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_node) ("_position" n))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_node) ("_position" n'))
###           ("\<^const>HOL.All_binder" ("_position" as)
###             ("\<^const>local.path" ("_position" n) ("_position" as)
###               ("\<^const>HOL.implies" ("\<^fixed>Exit")
###                 ("\<^const>Set.member" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes)
###                       ("_position" as))))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Found termination order: "{}"
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=548name=definitionelapsed=0.037
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=16114name=code_datatypeelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=731name=funelapsed=1.406
### Ambiguous input (line 182 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.postdominate" ("\<^fixed>Exit")
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n))
###       ("\<^const>HOL.Trueprop" ("_position" False)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.postdominate" ("\<^fixed>Exit") ("_position" n)))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 214 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" ax)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit_wf.thyoffset=1name=theoryelapsed=0.160
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=19444name=lemmaelapsed=0.013
locale CFGExit_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and Exit :: "'node" 
  assumes
    "CFGExit_wf sourcenode targetnode kind valid_edge (_Entry_) Def Use
      state_val (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit_wf.thyoffset=120name=localeelapsed=0.067
### theory "CFGExit_wf"
### 0.241s elapsed time, 0.964s cpu time, 0.000s GC time
Loading theory "DynDataDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "Slice" via "DataDependence")
loading_theory = DynDataDependence
locale StrongPostdomination =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes
    "StrongPostdomination sourcenode targetnode kind valid_edge (_Entry_)
      (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=12284name=localeelapsed=0.070
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=20585name=lemmaelapsed=0.017
### Ambiguous input (line 334 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 20 parse trees (10 displayed):
### ("\<^const>Pure.eq"
###   ("\<^fixed>strong_postdominate" ("_position" n') ("_position" n))
###   ("\<^const>HOL.conj"
###     ("\<^const>local.postdominate" ("_position" n') ("_position" n))
###     ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###       ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###         ("\<^const>HOL.implies"
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("\<^const>local.path" ("_position" n) ("_position" as)
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("_applC" ("_position" length) ("_position" as))))
###             ("_position" k))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>strong_postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.postdominate" ("_position" n') ("_position" n))
###         ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###           ("\<^const>HOL.All_binder"
###             ("_idts" ("_position" as) ("_position" nx))
###             ("\<^const>HOL.implies"
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("\<^const>local.path" ("_position" n) ("_position" as)
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("_applC" ("_position" length) ("_position" as))))
###                 ("_position" k))
###               ("\<^const>Set.member" ("_position" n')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes)
###                     ("_position" as)))))))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>strong_postdominate" ("_position" n') ("_position" n))
###   ("\<^const>local.postdominate" ("_position" n')
###     ("\<^const>HOL.conj" ("_position" n)
###       ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("\<^const>local.path" ("_position" n) ("_position" as)
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("_applC" ("_position" length) ("_position" as))))
###               ("_position" k))
###             ("\<^const>Set.member" ("_position" n')
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>strong_postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>local.postdominate" ("_position" n')
###         ("\<^const>HOL.conj" ("_position" n)
###           ("_Ex_greater_eq" ("_position" k)
###             ("\<^const>Groups.one_class.one")
###             ("\<^const>HOL.All_binder"
###               ("_idts" ("_position" as) ("_position" nx))
###               ("\<^const>HOL.implies"
###                 ("\<^const>Orderings.ord_class.greater_eq"
###                   ("\<^const>local.path" ("_position" n) ("_position" as)
###                     ("\<^const>HOL.conj" ("_position" nx)
###                       ("_applC" ("_position" length) ("_position" as))))
###                   ("_position" k))
###                 ("\<^const>Set.member" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes)
###                       ("_position" as))))))))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>strong_postdominate" ("_position" n') ("_position" n))
###   ("\<^const>HOL.conj"
###     ("\<^const>local.postdominate" ("_position" n') ("_position" n))
###     ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###       ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k)))
###             ("\<^const>Set.member" ("_position" n')
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>strong_postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.postdominate" ("_position" n') ("_position" n))
###         ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###           ("\<^const>HOL.All_binder"
###             ("_idts" ("_position" as) ("_position" nx))
###             ("\<^const>local.path" ("_position" n) ("_position" as)
###               ("\<^const>HOL.implies"
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>Orderings.ord_class.greater_eq"
###                     ("_applC" ("_position" length) ("_position" as))
###                     ("_position" k)))
###                 ("\<^const>Set.member" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes)
###                       ("_position" as))))))))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>strong_postdominate" ("_position" n') ("_position" n))
###   ("\<^const>local.postdominate" ("_position" n')
###     ("\<^const>HOL.conj" ("_position" n)
###       ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.implies"
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>Orderings.ord_class.greater_eq"
###                   ("_applC" ("_position" length) ("_position" as))
###                   ("_position" k)))
###               ("\<^const>Set.member" ("_position" n')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes)
###                     ("_position" as)))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>strong_postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>local.postdominate" ("_position" n')
###         ("\<^const>HOL.conj" ("_position" n)
###           ("_Ex_greater_eq" ("_position" k)
###             ("\<^const>Groups.one_class.one")
###             ("\<^const>HOL.All_binder"
###               ("_idts" ("_position" as) ("_position" nx))
###               ("\<^const>local.path" ("_position" n) ("_position" as)
###                 ("\<^const>HOL.implies"
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>Orderings.ord_class.greater_eq"
###                       ("_applC" ("_position" length) ("_position" as))
###                       ("_position" k)))
###                   ("\<^const>Set.member" ("_position" n')
###                     ("_applC" ("_position" set)
###                       ("_applC" ("_position" sourcenodes)
###                         ("_position" as)))))))))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>strong_postdominate" ("_position" n') ("_position" n))
###   ("\<^const>HOL.conj"
###     ("\<^const>local.postdominate" ("_position" n') ("_position" n))
###     ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###       ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###         ("\<^const>HOL.implies"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k))))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>strong_postdominate" ("_position" n')
###     ("\<^const>Pure.eq" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.postdominate" ("_position" n') ("_position" n))
###         ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###           ("\<^const>HOL.All_binder"
###             ("_idts" ("_position" as) ("_position" nx))
###             ("\<^const>HOL.implies"
###               ("\<^const>local.path" ("_position" n) ("_position" as)
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>Orderings.ord_class.greater_eq"
###                     ("_applC" ("_position" length) ("_position" as))
###                     ("_position" k))))
###               ("\<^const>Set.member" ("_position" n')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes)
###                     ("_position" as)))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=40name=theoryelapsed=0.075
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=12739name=definitionelapsed=0.071
locale CFG_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
  assumes
    "CFG_wf sourcenode targetnode kind valid_edge (_Entry_) Def Use
      state_val"
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=87name=contextelapsed=0.011
### Ambiguous input (line 341 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("_applC" ("_position" length) ("_position" as))))
###         ("_position" k))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k))))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" nx))
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("_applC" ("_position" length) ("_position" as)) ("_position" k)))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804824.83tasks_ready=1107tasks_pending=15tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=2size_allocation=4088397824size_allocation_free=2961189312size_heap=4085252096size_heap_free_last_full_GC=0size_heap_free_last_GC=4089356080threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=23.884time_GC=1.016user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13021name=lemmaelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=110name=definitionelapsed=0.031
### Ambiguous input (line 15 of "~~/afp/thys/Slicing/Basic/DynDataDependence.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n')
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" as))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_applC" ("_position" sourcenode) ("_position" a))
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>List.list.Cons"
###       ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###         ("_position" n') ("_position" a))
###       ("_position" as)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_applC" ("_position" sourcenode) ("_position" a))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Overloaded constant as head in equation, in theorem:
### INFIMUM (Set ?t) ?f \<equiv> fold_keys (inf \<circ> ?f) ?t top
### Ambiguous input (line 20 of "~~/afp/thys/Slicing/Basic/DynDataDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###     ("_position" n')
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n') ("_position" a))
###     ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=24645name=lemmaelapsed=0.010
### Ambiguous input (line 34 of "~~/afp/thys/Slicing/Basic/DynDataDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###     ("_position" n')
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n') ("_position" a))
###     ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1064name=lemmaelapsed=0.010
### theory "DynDataDependence"
### 0.153s elapsed time, 0.608s cpu time, 0.000s GC time
Loading theory "DataDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "Slice")
loading_theory = DataDependence
### Overloaded constant as head in equation, in theorem:
### SUPREMUM (Set ?t) ?f \<equiv> fold_keys (sup \<circ> ?f) ?t bot
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19776name=lemmaelapsed=0.010
### theory "Postdomination"
### 0.505s elapsed time, 2.020s cpu time, 0.000s GC time
Loading theory "DynStandardControlDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "PDG" via "StandardControlDependence")
loading_theory = DynStandardControlDependence
### theory "RBT_Set"
### 2.897s elapsed time, 8.312s cpu time, 0.696s GC time
Loading theory "DynWeakControlDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "PDG" via "WeakControlDependence")
loading_theory = DynWeakControlDependence
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/DataDependence.thyoffset=39name=theoryelapsed=0.072
locale CFG_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
  assumes
    "CFG_wf sourcenode targetnode kind valid_edge (_Entry_) Def Use
      state_val"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/DataDependence.thyoffset=105name=contextelapsed=0.014
### Ambiguous input (line 9 of "~~/afp/thys/Slicing/StaticIntra/DataDependence.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>data_dependence" ("_position" n) ("_position" V)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>local.dyn_data_dependence" ("_position" n)
###           ("_position" V) ("_position" n') ("_position" as))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>data_dependence" ("_position" n) ("_position" V)
###     ("_position" n'))
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n') ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^fixed>data_dependence" ("_position" n) ("_position" V)
###           ("_position" n'))))
###     ("_position" as)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence"
###     ("\<^fixed>data_dependence" ("_position" n) ("_position" V)
###       ("\<^const>Pure.eq" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" n))))
###     ("_position" V) ("_position" n') ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=48name=theoryelapsed=0.073
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=52name=theoryelapsed=0.078
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/DataDependence.thyoffset=127name=definitionelapsed=0.034
### Ambiguous input (line 11 of "~~/afp/thys/Slicing/StaticIntra/DataDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.data_dependence" ("_position" n) ("_position" V)
###     ("\<^const>HOL.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a') ("_position" as'))
###         ("\<^const>HOL.conj"
###           ("\<^const>Set.member" ("_position" V)
###             ("_applC" ("_position" Def) ("_position" n)))
###           ("\<^const>HOL.conj"
###             ("\<^const>Set.member" ("_position" V)
###               ("_applC" ("_position" Use) ("_position" n')))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path" ("_position" n)
###                 ("\<^const>List.list.Cons" ("_position" a')
###                   ("_position" as'))
###                 ("_position" n'))
###               ("_Ball" ("_position" n'')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes) ("_position" as')))
###                 ("\<^const>Set.not_member" ("_position" V)
###                   ("_applC" ("_position" Def) ("_position" n'')))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.data_dependence" ("_position" n) ("_position" V)
###       ("_position" n'))
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a') ("_position" as'))
###       ("\<^const>HOL.conj"
###         ("\<^const>Set.member" ("_position" V)
###           ("_applC" ("_position" Def) ("_position" n)))
###         ("\<^const>HOL.conj"
###           ("\<^const>Set.member" ("_position" V)
###             ("_applC" ("_position" Use) ("_position" n')))
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" n)
###               ("\<^const>List.list.Cons" ("_position" a') ("_position" as'))
###               ("_position" n'))
###             ("_Ball" ("_position" n'')
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as')))
###               ("\<^const>Set.not_member" ("_position" V)
###                 ("_applC" ("_position" Def) ("_position" n''))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
locale StrongPostdomination =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes
    "StrongPostdomination sourcenode targetnode kind valid_edge (_Entry_)
      (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=110name=contextelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/DataDependence.thyoffset=307name=lemmaelapsed=0.013
locale Postdomination =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes
    "Postdomination sourcenode targetnode kind valid_edge (_Entry_)
      (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=118name=contextelapsed=0.018
### theory "DataDependence"
### 0.139s elapsed time, 0.556s cpu time, 0.000s GC time
Loading theory "Distance" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "Slice")
loading_theory = Distance
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=148name=definitionelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=146name=definitionelapsed=0.044
### theory "DynWeakControlDependence"
### 0.149s elapsed time, 0.604s cpu time, 0.000s GC time
Loading theory "WeakControlDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "PDG")
loading_theory = WeakControlDependence
### Ambiguous input (line 30 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_standard_control_dependence" ("_position" n)
###     ("_position" n')
###     ("\<^const>HOL.eq" ("_position" as)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" n'))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.not_equal" ("_position" n) ("_position" n'))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_position" n)))
###             ("\<^const>HOL.conj"
###               ("\<^const>Set.not_member" ("_position" n')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes) ("_position" as))))
###               ("_Ball" ("_position" n'')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" targetnodes) ("_position" as)))
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("_position" n''))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.dyn_standard_control_dependence" ("_position" n)
###       ("_position" n') ("_position" as))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.not_equal" ("_position" n) ("_position" n'))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.Not"
###             ("\<^const>local.postdominate" ("_position" n')
###               ("_position" n)))
###           ("\<^const>HOL.conj"
###             ("\<^const>Set.not_member" ("_position" n')
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as))))
###             ("_Ball" ("_position" n'')
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" targetnodes) ("_position" as)))
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_position" n'')))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1060name=lemmaelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=47name=theoryelapsed=0.077
### Ambiguous input (line 217 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" ax) ("_position" ax'))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>Set.member" ("_position" ax)
###           ("_applC" ("_position" set) ("_position" as')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_applC" ("_position" sourcenode) ("_position" ax')))
###           ("_applC" ("_position" valid_edge) ("_position" ax'))))
###       ("_applC"
###         ("\<^const>local.postdominate" ("_position" n)
###           ("_position" targetnode))
###         ("_position" ax')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" ax) ("_position" ax'))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>Set.member" ("_position" ax)
###           ("_applC" ("_position" set) ("_position" as')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_applC" ("_position" sourcenode) ("_position" ax')))
###           ("_applC" ("_position" valid_edge) ("_position" ax'))))
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_applC" ("_position" targetnode) ("_position" ax'))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 219 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_standard_control_dependence" ("_position" n')
###     ("_position" n)
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" as'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_standard_control_dependence" ("_position" n')
###       ("_position" n) ("_position" a))
###     ("_position" as')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
locale CFG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
  assumes "CFG sourcenode targetnode valid_edge (_Entry_)"
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=8592name=lemmaelapsed=0.018
### Ambiguous input (line 37 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 3 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.eq" ("_applC" ("_position" length) ("_position" as))
###           ("_position" x)))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.All_binder" ("_position" as')
###             ("\<^const>Orderings.ord_class.less_eq"
###               ("\<^const>local.path" ("_position" n) ("_position" as')
###                 ("\<^const>HOL.implies" ("_position" n') ("_position" x)))
###               ("_applC" ("_position" length) ("_position" as'))))))))
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" distance)
###       ("_cargs" ("_position" n)
###         ("_cargs" ("_position" n') ("_position" x))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.eq" ("_applC" ("_position" length) ("_position" as))
###           ("_position" x)))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.All_binder" ("_position" as')
###             ("\<^const>HOL.implies"
###               ("\<^const>local.path" ("_position" n) ("_position" as')
###                 ("_position" n'))
###               ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###                 ("_applC" ("_position" length) ("_position" as')))))))))
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" distance)
###       ("_cargs" ("_position" n)
###         ("_cargs" ("_position" n') ("_position" x))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.eq" ("_applC" ("_position" length) ("_position" as))
###           ("_position" x)))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.All_binder" ("_position" as')
###             ("\<^const>local.path" ("_position" n) ("_position" as')
###               ("\<^const>HOL.implies" ("_position" n')
###                 ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###                   ("_applC" ("_position" length) ("_position" as'))))))))))
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" distance)
###       ("_cargs" ("_position" n)
###         ("_cargs" ("_position" n') ("_position" x))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Proofs for inductive predicate(s) "distance"
### theory "DynStandardControlDependence"
### 0.211s elapsed time, 0.848s cpu time, 0.000s GC time
Loading theory "StandardControlDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "PDG")
loading_theory = StandardControlDependence
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thyoffset=47name=theoryelapsed=0.073
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=1436name=inductiveelapsed=0.047
locale StrongPostdomination =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes
    "StrongPostdomination sourcenode targetnode kind valid_edge (_Entry_)
      (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thyoffset=159name=contextelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=3223name=lemmaelapsed=0.010
### Ambiguous input (line 14 of "~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_weak_control_dependence"
###     ("\<^fixed>weak_control_dependence" ("_position" n)
###       ("\<^const>Pure.eq" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" n))))
###     ("_position" n') ("_position" as)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_weak_control_dependence" ("_position" n)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^fixed>weak_control_dependence" ("_position" n)
###           ("_position" n'))))
###     ("_position" as)))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>weak_control_dependence" ("_position" n)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>local.dyn_weak_control_dependence" ("_position" n)
###           ("_position" n') ("_position" as))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>weak_control_dependence" ("_position" n) ("_position" n'))
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.dyn_weak_control_dependence" ("_position" n)
###       ("_position" n') ("_position" as))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=5455name=lemmaelapsed=0.010
### theory "Distance"
### 0.179s elapsed time, 0.712s cpu time, 0.000s GC time
Loading theory "Observable" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "Slice")
loading_theory = Observable
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thyoffset=51name=theoryelapsed=0.073
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thyoffset=195name=definitionelapsed=0.048
### Ambiguous input (line 17 of "~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.weak_control_dependence" ("_position" n)
###     ("\<^const>HOL.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" a') ("_position" as)))
###         ("\<^const>HOL.conj"
###           ("\<^const>Set.not_member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes)
###                 ("\<^const>List.list.Cons" ("_position" a)
###                   ("_position" as)))))
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" n)
###               ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###               ("_position" n'))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("_applC" ("_position" targetnode) ("_position" a)))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a'))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" sourcenode) ("_position" a'))
###                     ("_position" n))
###                   ("\<^const>HOL.Not"
###                     ("\<^const>local.strong_postdominate" ("_position" n')
###                       ("_applC" ("_position" targetnode)
###                         ("_position" a')))))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.weak_control_dependence" ("_position" n)
###       ("_position" n'))
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" a) ("_idts" ("_position" a') ("_position" as)))
###       ("\<^const>HOL.conj"
###         ("\<^const>Set.not_member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes)
###               ("\<^const>List.list.Cons" ("_position" a)
###                 ("_position" as)))))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n)
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###             ("_position" n'))
###           ("\<^const>HOL.conj"
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("_applC" ("_position" targetnode) ("_position" a)))
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" valid_edge) ("_position" a'))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" sourcenode) ("_position" a'))
###                   ("_position" n))
###                 ("\<^const>HOL.Not"
###                   ("\<^const>local.strong_postdominate" ("_position" n')
###                     ("_applC" ("_position" targetnode)
###                       ("_position" a'))))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
locale Postdomination =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Exit :: "'node" 
  assumes
    "Postdomination sourcenode targetnode kind valid_edge (_Entry_)
      (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thyoffset=171name=contextelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thyoffset=391name=lemmaelapsed=0.016
### Ambiguous input (line 26 of "~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.weak_control_dependence" ("_position" n)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("\<^fixed>Exit"))
###       ("\<^const>HOL.Trueprop" ("_position" False)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.weak_control_dependence" ("_position" n)
###       ("\<^fixed>Exit")))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### theory "WeakControlDependence"
### 0.177s elapsed time, 0.708s cpu time, 0.000s GC time
Loading theory "SemanticsCFG" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations" via "Slice")
loading_theory = SemanticsCFG
### Ambiguous input (line 14 of "~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>standard_control_dependence" ("_position" n)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>local.dyn_standard_control_dependence" ("_position" n)
###           ("_position" n') ("_position" as))))))
### ("\<^const>Pure.eq"
###   ("\<^fixed>standard_control_dependence" ("_position" n) ("_position" n'))
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.dyn_standard_control_dependence" ("_position" n)
###       ("_position" n') ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_standard_control_dependence" ("_position" n)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^fixed>standard_control_dependence" ("_position" n)
###           ("_position" n'))))
###     ("_position" as)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_standard_control_dependence"
###     ("\<^fixed>standard_control_dependence" ("_position" n)
###       ("\<^const>Pure.eq" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" n))))
###     ("_position" n') ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thyoffset=249name=definitionelapsed=0.040
### Ambiguous input (line 16 of "~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.standard_control_dependence" ("_position" n)
###     ("\<^const>HOL.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" a') ("_position" as)))
###         ("\<^const>HOL.conj"
###           ("\<^const>Set.not_member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes)
###                 ("\<^const>List.list.Cons" ("_position" a)
###                   ("_position" as)))))
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" n)
###               ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###               ("_position" n'))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_applC" ("_position" targetnode) ("_position" a)))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a'))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" sourcenode) ("_position" a'))
###                     ("_position" n))
###                   ("\<^const>HOL.Not"
###                     ("\<^const>local.postdominate" ("_position" n')
###                       ("_applC" ("_position" targetnode)
###                         ("_position" a')))))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.standard_control_dependence" ("_position" n)
###       ("_position" n'))
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" a) ("_idts" ("_position" a') ("_position" as)))
###       ("\<^const>HOL.conj"
###         ("\<^const>Set.not_member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes)
###               ("\<^const>List.list.Cons" ("_position" a)
###                 ("_position" as)))))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n)
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###             ("_position" n'))
###           ("\<^const>HOL.conj"
###             ("\<^const>local.postdominate" ("_position" n')
###               ("_applC" ("_position" targetnode) ("_position" a)))
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" valid_edge) ("_position" a'))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" sourcenode) ("_position" a'))
###                   ("_position" n))
###                 ("\<^const>HOL.Not"
###                   ("\<^const>local.postdominate" ("_position" n')
###                     ("_applC" ("_position" targetnode)
###                       ("_position" a'))))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=41name=theoryelapsed=0.074
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thyoffset=430name=lemmaelapsed=0.016
locale CFG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
  assumes "CFG sourcenode targetnode valid_edge (_Entry_)"
### Ambiguous input (line 25 of "~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.standard_control_dependence" ("_position" n)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("\<^fixed>Exit"))
###       ("\<^const>HOL.Trueprop" ("_position" False)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.standard_control_dependence" ("_position" n)
###       ("\<^fixed>Exit")))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Proofs for inductive predicate(s) "obsp"
### Ambiguous input (line 31 of "~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.standard_control_dependence" ("_position" n)
###     ("\<^const>HOL.eq" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("_position" n'))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.not_equal" ("_position" n) ("_position" n'))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.Not"
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("_position" n)))
###               ("\<^const>HOL.conj"
###                 ("\<^const>Set.not_member" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as))))
###                 ("_Ball" ("_position" n'')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" targetnodes) ("_position" as)))
###                   ("\<^const>local.postdominate" ("_position" n')
###                     ("_position" n'')))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.standard_control_dependence" ("_position" n)
###       ("_position" n'))
###     ("\<^const>HOL.Ex_binder" ("_position" as)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" n'))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.not_equal" ("_position" n) ("_position" n'))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_position" n)))
###             ("\<^const>HOL.conj"
###               ("\<^const>Set.not_member" ("_position" n')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes) ("_position" as))))
###               ("_Ball" ("_position" n'')
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" targetnodes) ("_position" as)))
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("_position" n''))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thyoffset=1002name=lemmaelapsed=0.013
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/Basic/SemanticsCFG.thyoffset=42name=theoryelapsed=0.073
### theory "StandardControlDependence"
### 0.185s elapsed time, 0.736s cpu time, 0.000s GC time
Loading theory "PDG" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations")
loading_theory = PDG
ML_statistics = :now=1464804825.34tasks_ready=1251tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=2size_allocation=4088397824size_allocation_free=2126138168size_heap=4085252096size_heap_free_last_full_GC=0size_heap_free_last_GC=4089356080threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=25.488time_GC=1.016user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### Ambiguous input (line 13 of "~~/afp/thys/Slicing/Basic/SemanticsCFG.thy") produces 6 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>identifies" ("_position" n) ("_position" c)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>sem" ("_position" c) ("_position" s) ("_position" c')
###           ("_position" s')))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" as))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.conj" ("_position" n')
###               ("_applC" ("_position" transfers)
###                 ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                   ("_position" s)))))
###           ("_position" s'))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" preds)
###             ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###               ("_position" s)))
###           ("\<^fixed>identifies" ("_position" n') ("_position" c')))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>identifies" ("_position" n) ("_position" c)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>sem" ("_position" c) ("_position" s) ("_position" c')
###           ("_position" s')))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" as))
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" transfers)
###                 ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                   ("_position" s)))
###               ("_position" s'))
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" preds)
###                 ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                   ("_position" s)))
###               ("\<^fixed>identifies" ("_position" n')
###                 ("_position" c')))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>identifies" ("_position" n) ("_position" c)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>sem" ("_position" c) ("_position" s) ("_position" c')
###           ("_position" s')))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" as))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" n'))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" transfers)
###               ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                 ("_position" s)))
###             ("_position" s'))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" preds)
###               ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                 ("_position" s)))
###             ("\<^fixed>identifies" ("_position" n') ("_position" c'))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>identifies" ("_position" n) ("_position" c)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>sem" ("_position" c) ("_position" s) ("_position" c')
###           ("_position" s')))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" as))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" transfers)
###                 ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                   ("_position" s)))
###               ("_position" s'))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" preds)
###             ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###               ("_position" s)))
###           ("\<^fixed>identifies" ("_position" n') ("_position" c')))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>identifies" ("_position" n) ("_position" c)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>sem" ("_position" c) ("_position" s) ("_position" c')
###           ("_position" s')))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" as))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" transfers)
###                   ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                     ("_position" s)))
###                 ("_position" s'))
###               ("_applC" ("_position" preds)
###                 ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                   ("_position" s))))))
###         ("\<^fixed>identifies" ("_position" n') ("_position" c'))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>identifies" ("_position" n) ("_position" c)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>sem" ("_position" c) ("_position" s) ("_position" c')
###           ("_position" s')))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" as))
###       ("\<^fixed>identifies"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" transfers)
###                   ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                     ("_position" s)))
###                 ("_position" s'))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" preds)
###                   ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###                     ("_position" s)))
###                 ("_position" n')))))
###         ("_position" c')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=108name=inductive_setelapsed=0.099
locale CFG_semantics_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and
    sem ::
      "'com
       \<Rightarrow> 'state
                     \<Rightarrow> 'com
                                   \<Rightarrow> 'state \<Rightarrow> bool"
      
    and identifies :: "'node \<Rightarrow> 'com \<Rightarrow> bool" 
  assumes
    "CFG_semantics_wf sourcenode targetnode kind valid_edge (_Entry_) sem
      identifies"
command_timing = :file=~~/afp/thys/Slicing/Basic/SemanticsCFG.thyoffset=81name=localeelapsed=0.093
### theory "SemanticsCFG"
### 0.170s elapsed time, 0.688s cpu time, 0.000s GC time
Loading theory "WeakOrderDependence" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations")
loading_theory = WeakOrderDependence
### theory "Observable"
### 0.228s elapsed time, 0.908s cpu time, 0.000s GC time
Loading theory "Slice" (required by "AdditionalLemmas" via "WellFormed" via "CDepInstantiations")
loading_theory = Slice
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakOrderDependence.thyoffset=38name=theoryelapsed=0.076
### Ambiguous input (line 11 of "~~/afp/thys/Slicing/StaticIntra/WeakOrderDependence.thy") produces 2 parse trees:
### ("\<^const>Pure.eq"
###   ("\<^fixed>weak_order_dependence" ("_position" n) ("_position" n\<^sub>1)
###     ("_position" n\<^sub>2))
###   ("\<^const>HOL.conj"
###     ("\<^const>HOL.not_equal" ("_position" n\<^sub>1)
###       ("_position" n\<^sub>2))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("_position" n\<^sub>1))
###           ("\<^const>Set.not_member" ("_position" n\<^sub>2)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as))))))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" n) ("_position" as)
###               ("_position" n\<^sub>2))
###             ("\<^const>Set.not_member" ("_position" n\<^sub>1)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as))))))
###         ("\<^const>HOL.Ex_binder" ("_position" a)
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq" ("_position" n)
###                 ("_applC" ("_position" sourcenode) ("_position" a)))
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.Ex_binder" ("_position" as)
###                   ("\<^const>HOL.conj"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as) ("_position" n\<^sub>1))
###                     ("\<^const>HOL.All_binder" ("_position" as')
###                       ("\<^const>HOL.implies"
###                         ("\<^const>local.path"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_position" as') ("_position" n\<^sub>2))
###                         ("\<^const>Set.member" ("_position" n\<^sub>1)
###                           ("_applC" ("_position" set)
###                             ("_applC" ("_position" sourcenodes)
###                               ("_position" as'))))))))
###                 ("\<^const>HOL.Ex_binder" ("_position" as)
###                   ("\<^const>HOL.conj"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as) ("_position" n\<^sub>2))
###                     ("\<^const>HOL.All_binder" ("_position" as')
###                       ("\<^const>HOL.implies"
###                         ("\<^const>local.path"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_position" as') ("_position" n\<^sub>1))
###                         ("\<^const>Set.member" ("_position" n\<^sub>2)
###                           ("_applC" ("_position" set)
###                             ("_applC" ("_position" sourcenodes)
###                               ("_position" as'))))))))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>weak_order_dependence" ("_position" n) ("_position" n\<^sub>1)
###     ("\<^const>Pure.eq" ("_position" n\<^sub>2)
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.not_equal" ("_position" n\<^sub>1)
###           ("_position" n\<^sub>2))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.Ex_binder" ("_position" as)
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path" ("_position" n) ("_position" as)
###                 ("_position" n\<^sub>1))
###               ("\<^const>Set.not_member" ("_position" n\<^sub>2)
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes) ("_position" as))))))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("\<^const>HOL.conj"
###                 ("\<^const>local.path" ("_position" n) ("_position" as)
###                   ("_position" n\<^sub>2))
###                 ("\<^const>Set.not_member" ("_position" n\<^sub>1)
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes)
###                       ("_position" as))))))
###             ("\<^const>HOL.Ex_binder" ("_position" a)
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" n)
###                     ("_applC" ("_position" sourcenode) ("_position" a)))
###                   ("\<^const>HOL.disj"
###                     ("\<^const>HOL.Ex_binder" ("_position" as)
###                       ("\<^const>HOL.conj"
###                         ("\<^const>local.path"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_position" as) ("_position" n\<^sub>1))
###                         ("\<^const>HOL.All_binder" ("_position" as')
###                           ("\<^const>HOL.implies"
###                             ("\<^const>local.path"
###                               ("_applC" ("_position" targetnode)
###                                 ("_position" a))
###                               ("_position" as') ("_position" n\<^sub>2))
###                             ("\<^const>Set.member" ("_position" n\<^sub>1)
###                               ("_applC" ("_position" set)
###                                 ("_applC" ("_position" sourcenodes)
###                                   ("_position" as'))))))))
###                     ("\<^const>HOL.Ex_binder" ("_position" as)
###                       ("\<^const>HOL.conj"
###                         ("\<^const>local.path"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_position" as) ("_position" n\<^sub>2))
###                         ("\<^const>HOL.All_binder" ("_position" as')
###                           ("\<^const>HOL.implies"
###                             ("\<^const>local.path"
###                               ("_applC" ("_position" targetnode)
###                                 ("_position" a))
###                               ("_position" as') ("_position" n\<^sub>1))
###                             ("\<^const>Set.member" ("_position" n\<^sub>2)
###                               ("_applC" ("_position" set)
###                                 ("_applC" ("_position" sourcenodes)
###                                   ("_position" as'))))))))))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakOrderDependence.thyoffset=235name=definitionelapsed=0.066
Proofs for inductive predicate(s) "wod_backward_slicep"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=1138name=datatypeelapsed=1.046
### Ambiguous input (line 46 of "~~/afp/thys/Slicing/While/Com.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq" ("_position" Skip)
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("\<^fixed>num_inner_nodes" ("_position" Skip))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 47 of "~~/afp/thys/Slicing/While/Com.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 48 of "~~/afp/thys/Slicing/While/Com.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^fixed>num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Groups.plus_class.plus"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>1))))
###     ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 49 of "~~/afp/thys/Slicing/While/Com.thy") produces 14 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^fixed>num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^fixed>num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>2)
###               ("\<^const>Groups.one_class.one"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^fixed>num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>2)
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^fixed>num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>2)
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^fixed>num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>2)
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Groups.plus_class.plus"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>1))))
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>2)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^fixed>num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2)))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2)))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^fixed>num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2))))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^fixed>num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2))))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Groups.plus_class.plus"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^fixed>num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^fixed>num_inner_nodes" ("_position" c\<^sub>2))))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 50 of "~~/afp/thys/Slicing/While/Com.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c))
###       ("\<^fixed>num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c)
###           ("_Numeral" ("_constify" ("_position" 2))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c)))
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c)
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>num_inner_nodes"
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^fixed>num_inner_nodes" ("_position" c))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^fixed>num_inner_nodes" ("_position" c))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Groups.plus_class.plus"
###     ("\<^fixed>num_inner_nodes"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.cmd.While" ("_position" b) ("_position" c))
###         ("\<^fixed>num_inner_nodes" ("_position" c))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=41name=theoryelapsed=0.409
### Ambiguous input (line 19 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>control_dependence" ("_position" n)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n') ("\<^fixed>Exit"))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>control_dependence" ("_position" n) ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.not_equal" ("_position" n') ("\<^fixed>Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^fixed>control_dependence" ("_position" n)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop" ("_position" n'))))
###     ("\<^fixed>Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakOrderDependence.thyoffset=797name=inductive_setelapsed=0.219
### Ambiguous input (line 21 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 10 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("_applC"
###       ("\<^fixed>control_dependence" ("_position" n)
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("_applC" ("_position" CFG.path)
###                 ("_cargs" ("_position" sourcenode)
###                   ("_cargs" ("_position" targetnode)
###                     ("_cargs" ("_position" valid_edge)
###                       ("_cargs" ("_position" n) ("_position" as))))))))))
###       ("_position" n'))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("_applC"
###       ("\<^fixed>control_dependence" ("_position" n)
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("_applC" ("_position" CFG.path)
###                 ("_cargs" ("_position" sourcenode)
###                   ("_cargs" ("_position" targetnode)
###                     ("_cargs" ("_position" valid_edge)
###                       ("_position" n)))))))))
###       ("_cargs" ("_position" as) ("_position" n')))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("_applC"
###       ("\<^fixed>control_dependence" ("_position" n)
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("_applC" ("_position" CFG.path)
###                 ("_cargs" ("_position" sourcenode)
###                   ("_cargs" ("_position" targetnode)
###                     ("_position" valid_edge))))))))
###       ("_cargs" ("_position" n)
###         ("_cargs" ("_position" as) ("_position" n'))))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("_applC"
###       ("\<^fixed>control_dependence" ("_position" n)
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("_applC" ("_position" CFG.path)
###                 ("_cargs" ("_position" sourcenode)
###                   ("_position" targetnode)))))))
###       ("_cargs" ("_position" valid_edge)
###         ("_cargs" ("_position" n)
###           ("_cargs" ("_position" as) ("_position" n')))))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("_applC"
###       ("\<^fixed>control_dependence" ("_position" n)
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("_applC" ("_position" CFG.path) ("_position" sourcenode))))))
###       ("_cargs" ("_position" targetnode)
###         ("_cargs" ("_position" valid_edge)
###           ("_cargs" ("_position" n)
###             ("_cargs" ("_position" as) ("_position" n'))))))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("_applC"
###       ("\<^fixed>control_dependence" ("_position" n)
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.Ex_binder" ("_position" as)
###               ("_position" CFG.path)))))
###       ("_cargs" ("_position" sourcenode)
###         ("_cargs" ("_position" targetnode)
###           ("_cargs" ("_position" valid_edge)
###             ("_cargs" ("_position" n)
###               ("_cargs" ("_position" as) ("_position" n')))))))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>control_dependence" ("_position" n)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" CFG.path)
###               ("_cargs" ("_position" sourcenode)
###                 ("_cargs" ("_position" targetnode)
###                   ("_cargs" ("_position" valid_edge)
###                     ("_cargs" ("_position" n)
###                       ("_cargs" ("_position" as) ("_position" n')))))))
###             ("\<^const>HOL.not_equal" ("_position" as)
###               ("\<^const>List.list.Nil"))))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>control_dependence" ("_position" n) ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_position" as)
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" CFG.path)
###           ("_cargs" ("_position" sourcenode)
###             ("_cargs" ("_position" targetnode)
###               ("_cargs" ("_position" valid_edge)
###                 ("_cargs" ("_position" n)
###                   ("_cargs" ("_position" as) ("_position" n')))))))
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^fixed>control_dependence" ("_position" n)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.Ex_binder" ("_position" as)
###             ("_applC" ("_position" CFG.path)
###               ("_cargs" ("_position" sourcenode)
###                 ("_cargs" ("_position" targetnode)
###                   ("_cargs" ("_position" valid_edge)
###                     ("_cargs" ("_position" n)
###                       ("_cargs" ("_position" as) ("_position" n')))))))))))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^fixed>control_dependence" ("_position" n)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.Ex_binder" ("_position" as)
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" CFG.path)
###                 ("_cargs" ("_position" sourcenode)
###                   ("_cargs" ("_position" targetnode)
###                     ("_cargs" ("_position" valid_edge)
###                       ("_cargs" ("_position" n)
###                         ("_cargs" ("_position" as) ("_position" n')))))))
###               ("_position" as))))))
###     ("\<^const>List.list.Nil")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakOrderDependence.thyoffset=1185name=lemmaelapsed=0.031
### theory "WeakOrderDependence"
### 0.398s elapsed time, 1.584s cpu time, 0.000s GC time
Loading theory "Sublist"
loading_theory = Sublist
ML_statistics = :now=1464804825.84tasks_ready=1286tasks_pending=7tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=2size_allocation=4088397824size_allocation_free=1279160896size_heap=4085252096size_heap_free_last_full_GC=0size_heap_free_last_GC=4089356080threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=27.096time_GC=1.016user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=1401name=funelapsed=0.199
### Ambiguous input (line 54 of "~~/afp/thys/Slicing/While/Com.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.greater" ("_position" c)
###       ("\<^const>Groups.zero_class.zero"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.greater"
###     ("\<^const>Com.num_inner_nodes" ("_position" c))
###     ("\<^const>Groups.zero_class.zero")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 57 of "~~/afp/thys/Slicing/While/Com.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c)
###         ("\<^const>Groups.zero_class.zero"))))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("\<^const>Com.num_inner_nodes" ("_position" c))
###       ("\<^const>Groups.zero_class.zero")))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
locale PDG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and Exit :: "'node" 
    and
    control_dependence :: "'node \<Rightarrow> 'node \<Rightarrow> bool" 
  assumes
    "PDG sourcenode targetnode kind valid_edge (_Entry_) Def Use state_val
      (_Exit_) control_dependence"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=163name=localeelapsed=0.141
### Ambiguous input (line 35 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 2 parse trees:
### ("\<^const>Pure.eq" ("\<^fixed>cdep_edge" ("_position" n) ("_position" n'))
###   ("_applC" ("_position" PDG_edge)
###     ("_cargs" ("_position" n)
###       ("_cargs" ("_position" None) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>cdep_edge" ("_position" n)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("_applC" ("_position" PDG_edge)
###         ("_cargs" ("_position" n)
###           ("_cargs" ("_position" None) ("_position" n')))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 36 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 2 parse trees:
### ("\<^const>Pure.eq"
###   ("\<^fixed>ddep_edge" ("_position" n) ("_position" V) ("_position" n'))
###   ("_applC" ("_position" PDG_edge)
###     ("_cargs" ("_position" n)
###       ("_cargs" ("_applC" ("_position" Some) ("_position" V))
###         ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>ddep_edge" ("_position" n) ("_position" V)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("_applC" ("_position" PDG_edge)
###         ("_cargs" ("_position" n)
###           ("_cargs" ("_applC" ("_position" Some) ("_position" V))
###             ("_position" n')))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 40 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>control_dependence" ("_position" n)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>cdep_edge" ("_position" n) ("_position" n'))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>control_dependence" ("_position" n) ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>cdep_edge" ("_position" n) ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>cdep_edge"
###     ("\<^fixed>control_dependence" ("_position" n)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop" ("_position" n))))
###     ("_position" n')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38name=theoryelapsed=0.437
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=212name=theoryelapsed=0.087
### Ambiguous input (line 43 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.data_dependence" ("_position" n) ("_position" V)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^fixed>ddep_edge" ("_position" n) ("_position" V)
###           ("_position" n'))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.data_dependence" ("_position" n) ("_position" V)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>ddep_edge" ("_position" n) ("_position" V)
###       ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>ddep_edge"
###     ("\<^const>local.data_dependence" ("_position" n) ("_position" V)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop" ("_position" n))))
###     ("_position" V) ("_position" n')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Proofs for inductive predicate(s) "PDG_edge"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=488name=interpretationelapsed=0.065
locale BackwardSlice =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and backward_slice :: "'node set \<Rightarrow> 'node set" 
  assumes
    "BackwardSlice sourcenode targetnode kind valid_edge (_Entry_) Def Use
      state_val backward_slice"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=130name=localeelapsed=0.108
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=865name=inductiveelapsed=0.158
Found termination order: "(\<lambda>p. size (fst p)) <*mlex*> {}"
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=1885name=funelapsed=0.180
### theory "Com"
### 6.449s elapsed time, 20.276s cpu time, 1.016s GC time
Loading theory "Labels" (required by "AdditionalLemmas" via "WellFormed")
loading_theory = Labels
Proofs for inductive predicate(s) "PDG_path"
  Proving monotonicity ...
  Proving the introduction rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=2243name=definitionelapsed=0.047
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=3068name=definitionelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=23name=theoryelapsed=0.078
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=1311name=inductiveelapsed=0.100
### Ambiguous input (line 59 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.cdep_edge" ("_position" n)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>local.PDG_path" ("_position" n) ("_position" n'))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.cdep_edge" ("_position" n) ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.PDG_path" ("_position" n) ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.PDG_path"
###     ("\<^const>local.cdep_edge" ("_position" n)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop" ("_position" n))))
###     ("_position" n')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=3443name=lemmaelapsed=0.010
### Ambiguous input (line 64 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.ddep_edge" ("_position" n) ("_position" V)
###     ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>local.PDG_path" ("_position" n) ("_position" n'))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.ddep_edge" ("_position" n) ("_position" V)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.PDG_path" ("_position" n) ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.PDG_path"
###     ("\<^const>local.ddep_edge" ("_position" n) ("_position" V)
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop" ("_position" n))))
###     ("_position" n')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 27 of "~~/afp/thys/Slicing/While/Labels.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" labels)
###       ("_cargs" ("_position" c\<^sub>2)
###         ("_cargs" ("_position" l) ("_position" c)))))
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" labels)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("_cargs"
###           ("\<^const>Groups.plus_class.plus" ("_position" l)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_position" c))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" labels)
###       ("_cargs" ("_position" c\<^sub>2)
###         ("_cargs" ("_position" l) ("_position" c)))))
###   ("\<^const>HOL.Trueprop"
###     ("_applC" ("_position" labels)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("_cargs"
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Groups.plus_class.plus" ("_position" l)
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###             ("\<^const>Groups.one_class.one"))
###           ("_position" c))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=3785name=lemmaelapsed=0.014
Proofs for inductive predicate(s) "labels"
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=5522name=lemmaelapsed=0.667
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2064name=lemmaelapsed=0.661
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=4132name=lemmaelapsed=0.671
  Proving monotonicity ...
  Proving the introduction rules ...
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6279name=lemmaelapsed=0.013
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=4859name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=5612name=lemmaelapsed=0.010
### Ambiguous input (line 146 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 4 parse trees:
### ("\<^const>Pure.eq" ("_applC" ("_position" PDG_BS) ("_position" S))
###   ("_Coll" ("_position" n')
###     ("\<^const>HOL.Ex_binder" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>Set.member"
###           ("\<^const>local.PDG_path" ("_position" n')
###             ("\<^const>HOL.conj" ("_position" n) ("_position" n)))
###           ("_position" S))
###         ("_applC" ("_position" valid_node) ("_position" n))))))
### ("\<^const>Pure.eq" ("_applC" ("_position" PDG_BS) ("_position" S))
###   ("_Coll" ("_position" n')
###     ("\<^const>HOL.Ex_binder" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.PDG_path" ("_position" n')
###           ("\<^const>HOL.conj" ("_position" n)
###             ("\<^const>Set.member" ("_position" n) ("_position" S))))
###         ("_applC" ("_position" valid_node) ("_position" n))))))
### ("\<^const>Pure.eq" ("_applC" ("_position" PDG_BS) ("_position" S))
###   ("_Coll" ("_position" n')
###     ("\<^const>HOL.Ex_binder" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>local.PDG_path" ("_position" n') ("_position" n))
###         ("\<^const>HOL.conj"
###           ("\<^const>Set.member" ("_position" n) ("_position" S))
###           ("_applC" ("_position" valid_node) ("_position" n)))))))
### ("\<^const>Pure.eq" ("_applC" ("_position" PDG_BS) ("_position" S))
###   ("_Coll" ("_position" n')
###     ("\<^const>HOL.Ex_binder" ("_position" n)
###       ("\<^const>local.PDG_path" ("_position" n')
###         ("\<^const>HOL.conj" ("_position" n)
###           ("\<^const>HOL.conj"
###             ("\<^const>Set.member" ("_position" n) ("_position" S))
###             ("_applC" ("_position" valid_node) ("_position" n))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=147name=inductiveelapsed=0.763
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=4366name=definitionelapsed=0.058
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16388name=lemmaelapsed=0.012
Found termination order: "length <*mlex*> {}"
### theory "Labels"
### 0.885s elapsed time, 1.508s cpu time, 0.624s GC time
Loading theory "WCFG" (required by "AdditionalLemmas" via "WellFormed" via "Interpretation")
loading_theory = WCFG
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6937name=funelapsed=0.102
Proofs for inductive predicate(s) "silent_move"
ML_statistics = :now=1464804826.97tasks_ready=1409tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=3size_allocation=3923771392size_allocation_free=3923771392size_heap=4093640704size_heap_free_last_full_GC=0size_heap_free_last_GC=3925360360threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=29.424time_GC=1.64user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=7563name=definitionelapsed=0.011
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18435name=inductiveelapsed=0.082
Proofs for inductive predicate(s) "silent_moves"
locale StandardControlDependencePDG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and Exit :: "'node" 
  assumes
    "StandardControlDependencePDG sourcenode targetnode kind valid_edge
      (_Entry_) Def Use state_val (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=4839name=localeelapsed=0.140
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18784name=inductiveelapsed=0.099
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=6305name=definitionelapsed=0.054
Found termination order: "(\<lambda>p. length (snd p)) <*mlex*> {}"
Proofs for inductive predicate(s) "observable_move"
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=11518name=funelapsed=0.147
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=12246name=definitionelapsed=0.014
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20name=theoryelapsed=0.268
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=25283name=inductiveelapsed=0.092
Proofs for inductive predicate(s) "observable_moves"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=25635name=inductiveelapsed=0.103
locale WeakControlDependencePDG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and Exit :: "'node" 
  assumes
    "WeakControlDependencePDG sourcenode targetnode kind valid_edge
      (_Entry_) Def Use state_val (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=6859name=localeelapsed=0.225
Proofs for inductive predicate(s) "list_emb"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
### Ambiguous input (line 659 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" backward_slice) ("_position" S))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" V)
###             ("_applC" ("_position" Use) ("_position" n'))))
###         ("_asm"
###           ("\<^const>HOL.Trueprop"
###             ("_Ball" ("_position" nx)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))
###               ("\<^const>Set.not_member" ("_position" V)
###                 ("_applC" ("_position" Def) ("_position" nx)))))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^fixed>relevant_vars"
###         ("_applC" ("_position" S) ("_position" n))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" backward_slice) ("_position" S))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" V)
###             ("_applC" ("_position" Use) ("_position" n'))))
###         ("_asm"
###           ("\<^const>HOL.Trueprop"
###             ("_Ball" ("_position" nx)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))
###               ("\<^const>Set.not_member" ("_position" V)
###                 ("_applC" ("_position" Def) ("_position" nx)))))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^fixed>relevant_vars" ("_position" S))
###         ("_position" n)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Proofs for inductive predicate(s) "relevant_varsp"
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18463name=inductiveelapsed=0.046
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=8329name=definitionelapsed=0.073
ML_statistics = :now=1464804827.47tasks_ready=1594tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=3size_allocation=3923771392size_allocation_free=2937410624size_heap=4093640704size_heap_free_last_full_GC=0size_heap_free_last_GC=3925360360threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=30.968time_GC=1.64user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### theory "PDG"
### 2.163s elapsed time, 6.616s cpu time, 0.624s GC time
Loading theory "GraphSpec"
loading_theory = GraphSpec
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21439name=lemmaelapsed=0.011
### Partially applied constant "HOL.eq" on left hand side of equation, in theorem:
### sublisteq (?x # ?xs) (?y # ?ys) \<equiv>
### if ?x = ?y then sublisteq ?xs ?ys else sublisteq (?x # ?xs) ?ys
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=28012name=inductive_setelapsed=0.180
### Ambiguous input (line 665 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 675 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 675 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 775 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 7 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n))
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n))
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.relevant_vars"
###       ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n))
###         ("\<^const>local.relevant_vars" ("_position" S))))
###     ("_position" n')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32968name=lemmaelapsed=0.013
### Ambiguous input (line 793 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### theory "Sublist"
### 1.784s elapsed time, 5.096s cpu time, 0.624s GC time
### Ambiguous input (line 795 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n'')))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s')))
###           ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n''))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s')))
###           ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=33477name=lemmaelapsed=0.024
### Ambiguous input (line 903 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38093name=lemmaelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=323name=byelapsed=0.038
### Ambiguous input (line 966 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq"
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S))))
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n')
###             ("_applC" ("_position" backward_slice) ("_position" S))))))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("_Ball" ("_position" V)
###           ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###             ("_position" n))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s) ("_position" V)))
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s') ("_position" V))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("_applC" ("_position" valid_node) ("_position" n)))
###         ("_asm"
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" valid_node) ("_position" n')))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Set.member"
###       ("_tuple" ("_tuple" ("_position" n) ("_tuple_arg" ("_position" s)))
###         ("_tuple_arg"
###           ("_tuple" ("_position" n') ("_tuple_arg" ("_position" s')))))
###       ("_applC" ("_position" WS) ("_position" S)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq"
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S))))
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n')
###             ("_applC" ("_position" backward_slice) ("_position" S))))))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("_Ball" ("_position" V)
###           ("\<^const>local.relevant_vars"
###             ("_applC" ("_position" S) ("_position" n)))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s) ("_position" V)))
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s') ("_position" V))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("_applC" ("_position" valid_node) ("_position" n)))
###         ("_asm"
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" valid_node) ("_position" n')))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Set.member"
###       ("_tuple" ("_tuple" ("_position" n) ("_tuple_arg" ("_position" s)))
###         ("_tuple_arg"
###           ("_tuple" ("_position" n') ("_tuple_arg" ("_position" s')))))
###       ("_applC" ("_position" WS) ("_position" S)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Proofs for inductive predicate(s) "WSp"
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=360name=showelapsed=0.023
  Proving monotonicity ...
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1333name=showelapsed=0.023
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2155name=byelapsed=0.050
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=1325name=interpretelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=99name=datatypeelapsed=0.623
### Ambiguous input (line 12 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>label_incr" ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>HOL.eq" ("_position" i)
###       ("\<^const>WCFG.w_node.Node"
###         ("\<^const>Groups.plus_class.plus" ("_position" l)
###           ("_position" i))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>label_incr" ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_position" i))
###     ("\<^const>WCFG.w_node.Node"
###       ("\<^const>Groups.plus_class.plus" ("_position" l) ("_position" i)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 13 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>label_incr" ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>HOL.eq" ("_position" i) ("\<^const>WCFG.w_node.Entry"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>label_incr" ("\<^const>WCFG.w_node.Entry") ("_position" i))
###     ("\<^const>WCFG.w_node.Entry")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 14 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>label_incr" ("\<^const>WCFG.w_node.Exit")
###     ("\<^const>HOL.eq" ("_position" i) ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^fixed>label_incr" ("\<^const>WCFG.w_node.Exit") ("_position" i))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=41069name=inductive_setelapsed=0.257
### Ambiguous input (line 973 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Set.member"
###       ("_tuple" ("_tuple" ("_position" n) ("_tuple_arg" ("_position" s)))
###         ("_tuple_arg"
###           ("_tuple" ("_position" n') ("_tuple_arg" ("_position" s')))))
###       ("_applC" ("_position" WS) ("_position" S))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S))))
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n')
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("_Ball" ("_position" V)
###           ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###             ("_position" n))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s) ("_position" V)))
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s') ("_position" V)))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_node) ("_position" n))
###           ("_applC" ("_position" valid_node) ("_position" n')))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Set.member"
###       ("_tuple" ("_tuple" ("_position" n) ("_tuple_arg" ("_position" s)))
###         ("_tuple_arg"
###           ("_tuple" ("_position" n') ("_tuple_arg" ("_position" s')))))
###       ("_applC" ("_position" WS) ("_position" S))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S))))
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n')
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("_Ball" ("_position" V)
###           ("\<^const>local.relevant_vars"
###             ("_applC" ("_position" S) ("_position" n)))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s) ("_position" V)))
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s') ("_position" V)))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_node) ("_position" n))
###           ("_applC" ("_position" valid_node) ("_position" n')))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=41361name=lemmaelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=1325name=interpretelapsed=0.149
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=41574name=lemmaelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=1490name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44908name=lemmaelapsed=0.011
Found termination order: "{}"
ML_statistics = :now=1464804827.97tasks_ready=1672tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=3size_allocation=3923771392size_allocation_free=1804014912size_heap=4093640704size_heap_free_last_full_GC=0size_heap_free_last_GC=3925360360threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=32.576time_GC=1.64user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=198name=funelapsed=0.116
### Ambiguous input (line 17 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Exit") ("_position" n))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2501name=showelapsed=0.024
### Ambiguous input (line 20 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>HOL.eq" ("_position" i) ("\<^const>WCFG.w_node.Exit"))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###       ("\<^const>WCFG.w_node.Exit")))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 23 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Entry"))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Entry") ("_position" n))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Entry"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45739name=lemmaelapsed=0.016
### Ambiguous input (line 26 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>HOL.eq" ("_position" i) ("\<^const>WCFG.w_node.Entry"))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Entry"))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###       ("\<^const>WCFG.w_node.Entry")))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("\<^const>WCFG.w_node.Entry"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 30 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>HOL.eq" ("_position" c)
###         ("\<^const>WCFG.label_incr" ("_position" n') ("_position" c)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" c))
###       ("\<^const>WCFG.label_incr" ("_position" n') ("_position" c))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>HOL.eq" ("_position" c) ("_position" n')))
###       ("_position" c)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq" ("_position" c) ("_position" n'))
###         ("_position" c))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" c))
###         ("_position" n'))
###       ("_position" c)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n) ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=537name=showelapsed=0.019
### Ambiguous input (line 33 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 10 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>HOL.eq" ("_position" i)
###         ("\<^const>WCFG.label_incr" ("_position" m)
###           ("\<^const>Groups.plus_class.plus" ("_position" i)
###             ("_position" j))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###       ("\<^const>WCFG.label_incr" ("_position" m)
###         ("\<^const>Groups.plus_class.plus" ("_position" i)
###           ("_position" j)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>HOL.eq" ("_position" i) ("_position" m)))
###       ("\<^const>Groups.plus_class.plus" ("_position" i) ("_position" j))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq" ("_position" i) ("_position" m))
###         ("\<^const>Groups.plus_class.plus" ("_position" i)
###           ("_position" j)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###         ("_position" m))
###       ("\<^const>Groups.plus_class.plus" ("_position" i) ("_position" j))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>HOL.eq" ("_position" i)
###         ("\<^const>WCFG.label_incr" ("_position" m)
###           ("\<^const>Groups.plus_class.plus" ("_position" i)
###             ("_position" j))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("_position" n) ("_position" m)) ("_position" j))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###       ("\<^const>WCFG.label_incr" ("_position" m)
###         ("\<^const>Groups.plus_class.plus" ("_position" i)
###           ("_position" j)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("_position" n) ("_position" m)) ("_position" j))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>HOL.eq" ("_position" i) ("_position" m)))
###       ("\<^const>Groups.plus_class.plus" ("_position" i) ("_position" j))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("_position" n) ("_position" m)) ("_position" j))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq" ("_position" i) ("_position" m))
###         ("\<^const>Groups.plus_class.plus" ("_position" i)
###           ("_position" j)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("_position" n) ("_position" m)) ("_position" j))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###         ("_position" m))
###       ("\<^const>Groups.plus_class.plus" ("_position" i) ("_position" j))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("_position" n) ("_position" m)) ("_position" j))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=773name=lemmaelapsed=0.013
### Ambiguous input (line 36 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 10 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus" ("_position" j) ("_position" i))
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq" ("_position" j) ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m)
###         ("\<^const>Groups.plus_class.plus" ("_position" j) ("_position" i)))
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq" ("_position" j) ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.label_incr" ("_position" m)
###         ("\<^const>HOL.eq"
###           ("\<^const>Groups.plus_class.plus" ("_position" j)
###             ("_position" i))
###           ("_position" n)))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq" ("_position" j) ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq"
###           ("\<^const>Groups.plus_class.plus" ("_position" j)
###             ("_position" i))
###           ("_position" n))
###         ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq" ("_position" j) ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" m)
###           ("\<^const>Groups.plus_class.plus" ("_position" j)
###             ("_position" i)))
###         ("_position" n))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq" ("_position" j) ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus" ("_position" j) ("_position" i))
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i)))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j))
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m)
###         ("\<^const>Groups.plus_class.plus" ("_position" j) ("_position" i)))
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j))
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.label_incr" ("_position" m)
###         ("\<^const>HOL.eq"
###           ("\<^const>Groups.plus_class.plus" ("_position" j)
###             ("_position" i))
###           ("_position" n)))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j))
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr" ("_position" m)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq"
###           ("\<^const>Groups.plus_class.plus" ("_position" j)
###             ("_position" i))
###           ("_position" n))
###         ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j))
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" m)
###           ("\<^const>Groups.plus_class.plus" ("_position" j)
###             ("_position" i)))
###         ("_position" n))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" m) ("_position" j))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=860name=lemmaelapsed=0.013
### Ambiguous input (line 40 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.w_node.Node"
###         ("\<^const>Groups.minus_class.minus" ("_position" l)
###           ("_position" i))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_position" n))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" n)
###       ("\<^const>WCFG.w_node.Node"
###         ("\<^const>Groups.minus_class.minus" ("_position" l)
###           ("_position" i))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=745name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=51227name=definitionelapsed=0.041
### Ambiguous input (line 43 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" l)
###       ("_position" i))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_position" n))
###       ("_position" i)))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" l)
###       ("_position" i))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 47 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_position" n))
###         ("_position" i)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Orderings.ord_class.greater" ("_position" i)
###           ("\<^const>Groups.zero_class.zero")))))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Orderings.ord_class.greater" ("_position" i)
###           ("\<^const>Groups.zero_class.zero")))))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 51 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" n) ("_position" i))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Orderings.ord_class.greater" ("_position" i)
###           ("\<^const>Groups.zero_class.zero")))))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>HOL.eq" ("_position" i)
###           ("\<^const>WCFG.w_node.Node"
###             ("\<^const>Groups.zero_class.zero")))))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Orderings.ord_class.greater" ("_position" i)
###           ("\<^const>Groups.zero_class.zero")))))
###   ("\<^const>HOL.Trueprop" ("_position" False)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=51569name=lemmaelapsed=0.017
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=1466name=showelapsed=0.022
### Ambiguous input (line 72 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Update"
###       ("_lambda" ("_position" s)
###         ("_Update" ("_position" s)
###           ("_updbind" ("_position" V)
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" e) ("_position" s)))))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^fixed>While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("_Update" ("_position" s)
###             ("_updbind" ("_position" V)
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" e) ("_position" s)))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Update"
###       ("_lambda" ("_position" s)
###         ("_applC" ("_position" s)
###           ("\<^const>Com.cmd.LAss" ("_position" V)
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" e) ("_position" s)))))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^fixed>While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("_applC" ("_position" s)
###             ("\<^const>Com.cmd.LAss" ("_position" V)
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" e) ("_position" s)))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 75 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^fixed>While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 78 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n')
###           ("\<^const>WCFG.w_node.Exit")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_position" n) ("_position" et) ("_position" n'))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n')
###           ("\<^const>WCFG.w_node.Exit")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 93 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" et) ("_position" n'))
###       ("\<^const>Groups.one_class.one"))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.one_class.one")))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" et)
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.one_class.one"))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Groups.one_class.one"))
###           ("_position" et) ("_position" n')))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 81 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_position" n) ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.w_node.Node"
###             ("\<^const>Groups.zero_class.zero"))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.label_incr"
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 84 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" et) ("_position" n'))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" et)
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("_position" et) ("_position" n')))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.label_incr"
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("_position" et) ("_position" n'))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 96 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 16 parse trees (10 displayed):
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" et) ("_position" n'))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" et)
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" et)
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_position" et) ("_position" n')))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" et) ("_position" n'))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_position" et) ("_position" n')))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" et) ("_position" n'))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
Proofs for inductive predicate(s) "trans_observable_moves"
### Ambiguous input (line 87 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" true)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" true)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 100 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^fixed>While_CFG" ("_position" c')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" true)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^fixed>While_CFG" ("_position" c')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" true)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 103 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^fixed>While_CFG" ("_position" c')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" false)))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 90 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 8 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" false)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" false)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" false)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^fixed>While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" false)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 106 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^fixed>While_CFG" ("_position" c')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 109 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c') ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" n')
###             ("\<^const>WCFG.w_node.Exit"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.While" ("_position" b)
###         ("\<^fixed>While_CFG" ("_position" c')
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_position" et) ("_position" n')))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c') ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" n')
###             ("\<^const>WCFG.w_node.Exit"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^fixed>While_CFG" ("_position" c')
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" et)
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("_Numeral" ("_constify" ("_position" 2))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c') ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" n')
###             ("\<^const>WCFG.w_node.Exit"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c') ("_position" n)
###         ("_position" et) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" n')
###             ("\<^const>WCFG.w_node.Exit"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^fixed>While_CFG"
###         ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" et) ("_position" n'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 113 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c') ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^fixed>While_CFG" ("_position" c')
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" et)
###         ("\<^const>WCFG.w_node.Node"
###           ("\<^const>Groups.zero_class.zero"))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^fixed>While_CFG" ("_position" c') ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^fixed>While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
Proofs for inductive predicate(s) "While_CFG"
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=1125name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=53303name=inductiveelapsed=0.124
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=53659name=definitionelapsed=0.030
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2431name=showelapsed=0.025
### Ambiguous input (line 1271 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("_position" n')))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as)))
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as')))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_position" S) ("_position" as)))
###                 ("_position" s))))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_position" S) ("_position" as')))
###                   ("_position" s'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("\<^const>Set.member" ("_position" n') ("_position" S)))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("_Ball" ("_position" V)
###                     ("_applC"
###                       ("\<^const>local.relevant_vars" ("_position" S))
###                       ("_position" n))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s) ("_position" V)))
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s')
###                           ("_position" V)))))))))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("_position" n')))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as)))
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as')))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_position" S) ("_position" as)))
###                 ("_position" s))))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_position" S) ("_position" as')))
###                   ("_position" s'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("\<^const>Set.member" ("_position" n') ("_position" S)))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("_Ball" ("_position" V)
###                     ("\<^const>local.relevant_vars"
###                       ("_applC" ("_position" S) ("_position" n)))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s) ("_position" V)))
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s')
###                           ("_position" V)))))))))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54831name=lemmaelapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2143name=interpretelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58282name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2179name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=1362name=inductiveelapsed=0.260
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64326name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2388name=interpretelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=2959name=lemmaselapsed=0.020
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2424name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3020name=lemmaselapsed=0.010
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2635name=interpretelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75300name=theoremelapsed=0.016
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2671name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2884name=interpretelapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2920name=showelapsed=0.661
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=3118name=byelapsed=0.014
### Ambiguous input (line 365 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 12 parse trees (10 displayed):
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("_position" prog))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("_position" prog)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###       ("\<^const>HOL.disj"
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###         ("\<^const>WCFG.While_CFG" ("_position" prog)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###       ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###         ("_position" et)
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>WCFG.While_CFG" ("_position" prog)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("_position" prog))
###       ("_position" n) ("_position" et)
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>WCFG.While_CFG" ("_position" prog)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.disj"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)))
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("_position" n))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###       ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###         ("_position" et)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("_position" prog))
###       ("_position" n) ("_position" et)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_position" prog))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12719name=lemmaelapsed=0.034
ML_statistics = :now=1464804829.11tasks_ready=1702tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=4size_allocation=3831496704size_allocation_free=3831496704size_heap=4102029312size_heap_free_last_full_GC=0size_heap_free_last_GC=3832899112threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=35.768time_GC=2.268user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21172name=lemmaelapsed=0.010
### theory "WCFG"
### 2.166s elapsed time, 6.656s cpu time, 0.628s GC time
Loading theory "Interpretation" (required by "AdditionalLemmas" via "WellFormed")
loading_theory = Interpretation
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=3962name=byelapsed=0.076
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=4635name=applyelapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=4776name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=5667name=applyelapsed=0.041
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6121name=proofelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=54name=theoryelapsed=0.175
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6171name=thuselapsed=0.018
### Ambiguous input (line 21 of "~~/afp/thys/Slicing/While/Interpretation.thy") produces 2 parse trees:
### ("\<^const>Pure.eq"
###   ("_applC" ("_position" valid_edge)
###     ("_cargs" ("_position" prog) ("_position" a)))
###   ("_applC"
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("_applC" ("_position" sourcenode) ("_position" a))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("_position" targetnode))
###     ("_position" a)))
### ("\<^const>Pure.eq"
###   ("_applC" ("_position" valid_edge)
###     ("_cargs" ("_position" prog) ("_position" a)))
###   ("\<^const>WCFG.While_CFG" ("_position" prog)
###     ("_applC" ("_position" sourcenode) ("_position" a))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("_applC" ("_position" targetnode) ("_position" a))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=418name=definitionelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=538name=definitionelapsed=0.012
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6277name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6277name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1507name=interpretationelapsed=0.028
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6725name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=2256name=interpretationelapsed=0.012
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6725name=obtainelapsed=0.021
### theory "Interpretation"
### 0.288s elapsed time, 1.092s cpu time, 0.000s GC time
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7430name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6892name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7495name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6992name=haveelapsed=0.015
locale BackwardSlice_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and backward_slice :: "'node set \<Rightarrow> 'node set" 
    and
    sem ::
      "'com
       \<Rightarrow> 'state
                     \<Rightarrow> 'com
                                   \<Rightarrow> 'state \<Rightarrow> bool"
      
    and identifies :: "'node \<Rightarrow> 'com \<Rightarrow> bool" 
  assumes
    "BackwardSlice_wf sourcenode targetnode kind valid_edge (_Entry_) Def
      Use state_val backward_slice sem identifies"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=81975name=localeelapsed=1.070
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=5870name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7018name=ultimatelyelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=82685name=theoremelapsed=0.011
### theory "Slice"
### 4.004s elapsed time, 11.916s cpu time, 1.252s GC time
Loading theory "CDepInstantiations" (required by "AdditionalLemmas" via "WellFormed")
loading_theory = CDepInstantiations
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7029name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8881name=thuselapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=7385name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8948name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8948name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=9467name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9146name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9259name=obtainelapsed=0.021
ML_statistics = :now=1464804829.61tasks_ready=1678tasks_pending=2tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=4size_allocation=3831496704size_allocation_free=3138058544size_heap=4102029312size_heap_free_last_full_GC=0size_heap_free_last_GC=3832899112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=37.252time_GC=2.268user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=10319name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9259name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=10730name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9390name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=11007name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9424name=ultimatelyelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=11296name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9435name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=11607name=byelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=11770name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=11893name=byelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=12231name=byelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=12058name=byelapsed=0.025
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=12397name=byelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=12603name=byelapsed=0.031
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=13510name=byelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=13955name=byelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14213name=byelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14586name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=63name=theoryelapsed=0.295
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=14970name=byelapsed=0.034
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=15119name=byelapsed=0.036
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=15233name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=15352name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=15575name=byelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=15922name=byelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=16080name=byelapsed=0.012
locale StandardControlDependencePDG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and Exit :: "'node" 
  assumes
    "StandardControlDependencePDG sourcenode targetnode kind valid_edge
      (_Entry_) Def Use state_val (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=189name=contextelapsed=0.084
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=16197name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=16317name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=17139name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=17245name=byelapsed=0.011
### Ambiguous input (line 18 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>Pure.eq" ("\<^fixed>PDG_path'" ("_position" n) ("_position" n'))
###   ("_applC" ("_position" PDG.PDG_path)
###     ("_cargs" ("_position" sourcenode)
###       ("_cargs" ("_position" targetnode)
###         ("_cargs" ("_position" valid_edge)
###           ("_cargs" ("_position" Def)
###             ("_cargs" ("_position" Use)
###               ("_cargs" ("_position" standard_control_dependence)
###                 ("_cargs" ("_position" n) ("_position" n'))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^fixed>PDG_path'" ("_position" n)
###     ("\<^const>Pure.eq" ("_position" n')
###       ("_applC" ("_position" PDG.PDG_path)
###         ("_cargs" ("_position" sourcenode)
###           ("_cargs" ("_position" targetnode)
###             ("_cargs" ("_position" valid_edge)
###               ("_cargs" ("_position" Def)
###                 ("_cargs" ("_position" Use)
###                   ("_cargs" ("_position" standard_control_dependence)
###                     ("_cargs" ("_position" n) ("_position" n'))))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=384name=abbreviationelapsed=0.047
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=17624name=byelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=18681name=byelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=18931name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=18987name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=3570name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=20540name=haveelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=20891name=byelapsed=0.027
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=20654name=ultimatelyelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4114name=interpretelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=20665name=showelapsed=0.023
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4153name=haveelapsed=0.021
locale WeakControlDependencePDG =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
    and Exit :: "'node" 
  assumes
    "WeakControlDependencePDG sourcenode targetnode kind valid_edge
      (_Entry_) Def Use state_val (_Exit_)"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=13610name=contextelapsed=0.122
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21331name=henceelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4261name=haveelapsed=0.018
ML_statistics = :now=1464804830.11tasks_ready=1584tasks_pending=2tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=4size_allocation=3831496704size_allocation_free=2569921136size_heap=4102029312size_heap_free_last_full_GC=0size_heap_free_last_GC=3832899112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=38.856time_GC=2.268user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21453name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4347name=ultimatelyelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=4358name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21497name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=22294name=byelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21765name=henceelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21859name=showelapsed=0.019
locale CFG_wf =
  fixes sourcenode :: "'edge \<Rightarrow> 'node" 
    and targetnode :: "'edge \<Rightarrow> 'node" 
    and kind :: "'edge \<Rightarrow> 'state edge_kind" 
    and valid_edge :: "'edge \<Rightarrow> bool" 
    and Entry :: "'node" 
    and Def :: "'node \<Rightarrow> 'var set" 
    and Use :: "'node \<Rightarrow> 'var set" 
    and state_val :: "'state \<Rightarrow> 'var \<Rightarrow> 'val" 
  assumes
    "CFG_wf sourcenode targetnode kind valid_edge (_Entry_) Def Use
      state_val"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=26647name=contextelapsed=0.037
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=22805name=byelapsed=0.022
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5161name=showelapsed=0.020
### theory "CDepInstantiations"
### 0.717s elapsed time, 2.860s cpu time, 0.000s GC time
Loading theory "WellFormed" (required by "AdditionalLemmas")
loading_theory = WellFormed
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5421name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5766name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23288name=byelapsed=0.030
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6026name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=1951name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/BasicDefs.thyoffset=2071name=byelapsed=0.017
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=6955name=byelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23819name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23977name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=1401name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=1218name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2247name=proofelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=1815name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=1891name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2296name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=1907name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2379name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2461name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=1940name=showelapsed=0.018
### Ambiguous input (line 97 of "~~/afp/thys/Slicing/Basic/CFG.thy") produces 3 parse trees:
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path" ("_position" n)
###       ("\<^const>List.append" ("_position" asx)
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("_applC" ("_position" sourcenode) ("_position" a))))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n)
###         ("\<^const>List.append" ("_position" asx)
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###         ("_position" n')))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n) ("_position" asx)
###         ("_applC" ("_position" sourcenode) ("_position" a))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path"
###       ("\<^const>local.path" ("_position" n)
###         ("\<^const>List.append" ("_position" asx)
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop" ("_position" n))))
###       ("_position" asx)
###       ("_applC" ("_position" sourcenode) ("_position" a)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 98 of "~~/afp/thys/Slicing/Basic/CFG.thy") produces 2 parse trees:
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path" ("_position" n)
###       ("\<^const>List.append" ("_position" asx)
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop"
###           ("_applC" ("_position" valid_edge) ("_position" a)))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n)
###         ("\<^const>List.append" ("_position" asx)
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###         ("_position" n')))
###     ("\<^const>HOL.Trueprop"
###       ("_applC" ("_position" valid_edge) ("_position" a)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 99 of "~~/afp/thys/Slicing/Basic/CFG.thy") produces 3 parse trees:
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path"
###       ("\<^const>local.path" ("_position" n)
###         ("\<^const>List.append" ("_position" asx)
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###         ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" targetnode) ("_position" a)))))
###       ("_position" as') ("_position" n'))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>local.path" ("_position" n)
###       ("\<^const>List.append" ("_position" asx)
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###       ("\<^const>Pure.imp" ("\<^const>HOL.Trueprop" ("_position" n'))
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" a))
###             ("_position" as') ("_position" n')))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path" ("_position" n)
###         ("\<^const>List.append" ("_position" asx)
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as')))
###         ("_position" n')))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" a))
###         ("_position" as') ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3457name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2720name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3457name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2888name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3529name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2976name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3564name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3019name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3700name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3035name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3801name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3120name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4038name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=53name=theoryelapsed=0.338
### Ambiguous input (line 15 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" lhs)
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))
###     ("_Finset" ("_position" V))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Update" ("_position" lhs)
###       ("_updbind" ("_position" V) ("_position" e)))
###     ("_Finset" ("_position" V))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3135name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4038name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3151name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4127name=haveelapsed=0.018
ML_statistics = :now=1464804830.62tasks_ready=1589tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=4size_allocation=3831496704size_allocation_free=1961363112size_heap=4102029312size_heap_free_last_full_GC=0size_heap_free_last_GC=3832899112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=40.448time_GC=2.268user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4162name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3236name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4299name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4560name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4641name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4402name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4945name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5318name=thuselapsed=0.018
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=226name=funelapsed=0.144
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5026name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5461name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5026name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5557name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5189name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5674name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=7861name=applyelapsed=0.013
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8117name=byelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=671name=showelapsed=0.020
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=445name=funelapsed=0.120
### Ambiguous input (line 29 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" rhs)
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))
###     ("_applC" ("_position" rhs_aux) ("_position" e))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Update" ("_position" rhs)
###       ("_updbind" ("_position" V) ("_position" e)))
###     ("_applC" ("_position" rhs_aux) ("_position" e))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8433name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=7932name=applyelapsed=0.066
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8482name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9404name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8600name=considerelapsed=0.023
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9508name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8698name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=1219name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6201name=byelapsed=0.012
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=1493name=byelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=1683name=byelapsed=0.010
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=1798name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6426name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=607name=funelapsed=0.146
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7341name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6599name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6690name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7507name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7598name=showelapsed=0.020
Found termination order: "{}"
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=10475name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2348name=funelapsed=0.085
ML_statistics = :now=1464804831.12tasks_ready=1644tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=4size_allocation=3831496704size_allocation_free=969366968size_heap=4102029312size_heap_free_last_full_GC=0size_heap_free_last_GC=3832899112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=43.644time_GC=2.268user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=2206name=byelapsed=0.072
Found termination order: "{}"
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=2036name=byelapsed=0.141
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2464name=funelapsed=0.086
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8337name=thuselapsed=0.016
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=2718name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8413name=thuselapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Mapping.thyoffset=2893name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8643name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17145name=interpretationelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=710name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8953name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=710name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=795name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=9099name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17145name=interpretationelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1010name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=9141name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=19236name=interpretationelapsed=0.010
### theory "WellFormed"
### 1.076s elapsed time, 4.292s cpu time, 0.000s GC time
Loading theory "AdditionalLemmas"
loading_theory = AdditionalLemmas
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1010name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=9231name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1087name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1206name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1206name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=1281name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2173name=applyelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=51name=theoryelapsed=0.088
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2573name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=182name=abbreviationelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2249name=applyelapsed=0.039
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2645name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=359name=definitionelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2302name=applyelapsed=0.010
### Ambiguous input (line 18 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###       ("_position" as) ("\<^const>WCFG.w_node.Node" ("_position" l))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog) ("_position" c\<^sub>2))
###       ("_position" n) ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###       ("_position" as) ("\<^const>WCFG.w_node.Node" ("_position" l))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" prog)
###       ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###         ("_position" n) ("_position" as)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2661name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2859name=obtainelapsed=0.020
### Ambiguous input (line 40 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###         ("_position" as) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" as)
###             ("\<^const>List.list.Nil"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n'))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###         ("_position" as) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" as)
###             ("\<^const>List.list.Nil"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###         ("_position" as) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" as)
###             ("\<^const>List.list.Nil"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###         ("_position" as) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" as)
###             ("\<^const>List.list.Nil"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("_position" n')))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###         ("_position" as) ("_position" n')))
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" n)
###           ("\<^const>WCFG.w_node.Entry")))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.not_equal" ("_position" as)
###             ("\<^const>List.list.Nil"))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr" ("_position" n)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("_position" n'))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2690name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1370name=lemmaelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2859name=obtainelapsed=0.016
### Ambiguous input (line 77 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" n'))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.one_class.one"))
###           ("_position" n')))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3036name=lemmaelapsed=0.013
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11209name=applyelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2975name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2975name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=3137name=haveelapsed=0.019
### Ambiguous input (line 132 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" n'))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("_position" n')))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_position" n')))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5519name=lemmaelapsed=0.053
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=3201name=showelapsed=0.020
### Ambiguous input (line 193 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.While" ("_position" b)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l')))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8552name=lemmaelapsed=0.014
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11280name=applyelapsed=0.073
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11465name=byelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12757name=haveelapsed=0.022
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11781name=showelapsed=0.018
### Ambiguous input (line 243 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.conj"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###         ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog))
###         ("\<^const>WCFG.w_node.Entry") ("_position" as)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit")))
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog))
###         ("\<^const>WCFG.w_node.Entry") ("_position" as)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.conj"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###         ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.imp"
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit")))
###       ("\<^const>HOL.Ex_binder" ("_position" as)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10646name=lemmaelapsed=0.013
ML_statistics = :now=1464804831.62tasks_ready=1658tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=4size_allocation=3832545280size_allocation_free=287488416size_heap=4103077888size_heap_free_last_full_GC=0size_heap_free_last_GC=3832899112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=45.236time_GC=2.268user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12861name=showelapsed=0.448
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11831name=showelapsed=0.445
### Ambiguous input (line 619 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog) ("_position" n)
###       ("_position" as) ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog))
###     ("_position" n) ("_position" as) ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30253name=lemmaelapsed=0.445
### Ambiguous input (line 643 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.w_node.Entry") ("_position" as) ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog))
###     ("\<^const>WCFG.w_node.Entry") ("_position" as) ("_position" n)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=27name=theoryelapsed=4.575
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11949name=considerelapsed=0.024
### theory "AdditionalLemmas"
### 0.763s elapsed time, 1.752s cpu time, 0.420s GC time
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=1745name=thuselapsed=0.018
locale graph =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
  assumes "graph \<alpha> invar"
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12047name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=327name=localeelapsed=0.031
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=13476name=interpretelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=2007name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=13476name=interpretelapsed=0.023
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=14471name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=2158name=haveelapsed=0.016
### Introduced fixed type variable(s): 'b in "x__" or "xs__"
locale graph_empty =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and empty :: "unit \<Rightarrow> 'G" 
  assumes "graph_empty \<alpha> invar empty"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=625name=localeelapsed=0.043
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=13538name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=14530name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=2326name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=2477name=showelapsed=0.014
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=14642name=showelapsed=0.017
### Ambiguous input (line 26 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies" ("\<^fixed>Exit")
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^fixed>Exit"))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=15678name=fixelapsed=0.019
locale graph_add_node =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and add_node :: "'V \<Rightarrow> 'G \<Rightarrow> 'G" 
  assumes "graph_add_node \<alpha> invar add_node"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=874name=localeelapsed=0.047
### Introduced fixed type variable(s): 'b in "x__" or "xs__"
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=914name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1766name=fixelapsed=0.016
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=15737name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1816name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1054name=obtainelapsed=0.014
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=15849name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1948name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1054name=obtainelapsed=0.016
locale graph_delete_node =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and delete_node :: "'V \<Rightarrow> 'G \<Rightarrow> 'G" 
  assumes "graph_delete_node \<alpha> invar delete_node"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=1177name=localeelapsed=0.046
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3152name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2048name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1124name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3247name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2160name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1171name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3298name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2235name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1171name=obtainelapsed=0.015
locale graph_add_edge =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    add_edge ::
      "'V \<Rightarrow> 'W \<Rightarrow> 'V
   \<Rightarrow> 'G \<Rightarrow> 'G"
      
  assumes "graph_add_edge \<alpha> invar add_edge"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=1504name=localeelapsed=0.050
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2256name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1252name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3371name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2297name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3371name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1252name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4169name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1461name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3465name=obtainelapsed=0.020
locale graph_delete_edge =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    delete_edge ::
      "'V \<Rightarrow> 'W \<Rightarrow> 'V
   \<Rightarrow> 'G \<Rightarrow> 'G"
      
  assumes "graph_delete_edge \<alpha> invar delete_edge"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=1841name=localeelapsed=0.050
locale graph_nodes_it_defs =
  fixes
    nodes_list_it ::
      "'G \<Rightarrow> ('V list \<Rightarrow> bool)
                        \<Rightarrow> ('V
 \<Rightarrow> 'V list \<Rightarrow> 'V list)
\<Rightarrow> 'V list \<Rightarrow> 'V list"
      
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1551name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4271name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3465name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=2302name=definitionelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3673name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4271name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=17032name=byelapsed=0.019
### Ambiguous input (line 159 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" as') ("_idts" ("_position" a) ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as')
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a))
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_applC" ("_position" targetnode) ("_position" a))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" as') ("_idts" ("_position" a) ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as')
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.Not"
###             ("\<^const>local.postdominate" ("_position" n')
###               ("_applC" ("_position" sourcenode) ("_position" a))))
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_applC" ("_position" targetnode) ("_position" a))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" as') ("_idts" ("_position" a) ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as')
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a))
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate"
###             ("\<^const>local.postdominate" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("_position" n')))
###             ("_applC" ("_position" targetnode) ("_position" a))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3729name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4355name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6433name=showelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4355name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3821name=haveelapsed=0.018
locale graph_nodes_it =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    nodes_list_it ::
      "'G \<Rightarrow> ('V list \<Rightarrow> bool)
                        \<Rightarrow> ('V
 \<Rightarrow> 'V list \<Rightarrow> 'V list)
\<Rightarrow> 'V list \<Rightarrow> 'V list"
      
  assumes "graph_nodes_it \<alpha> invar nodes_list_it"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=2364name=localeelapsed=0.050
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4445name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3908name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=17132name=interpretelapsed=0.021
locale graph_edges_it_defs =
  fixes
    edges_list_it ::
      "'G \<Rightarrow> (('V \<times> 'W \<times> 'V) list
                         \<Rightarrow> bool)
                        \<Rightarrow> ('V \<times> 'W \<times> 'V
 \<Rightarrow> ('V \<times> 'W \<times> 'V) list
               \<Rightarrow> ('V \<times> 'W \<times> 'V) list)
\<Rightarrow> ('V \<times> 'W \<times> 'V) list
              \<Rightarrow> ('V \<times> 'W \<times> 'V) list"
      
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=17267name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4528name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3992name=showelapsed=0.017
### Ambiguous input (line 191 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as'')
###     ("\<^const>local.path" ("_position" n) ("_position" as'')
###       ("\<^const>HOL.implies" ("\<^fixed>Exit")
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as'')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as'')
###         ("\<^fixed>Exit"))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as'')
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as'')
###         ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as''))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7243name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=3359name=definitionelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4528name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7479name=haveelapsed=0.025
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=17518name=interpretelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4689name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7647name=haveelapsed=0.016
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=17653name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4689name=obtainelapsed=0.015
### Ambiguous input (line 194 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as'')
###     ("\<^const>local.path" ("_position" n'') ("_position" as'')
###       ("\<^const>HOL.implies" ("\<^fixed>Exit")
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as'')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n'') ("_position" as'')
###         ("\<^fixed>Exit"))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as'')
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n'') ("_position" as'')
###         ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as''))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=17838name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4885name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7706name=haveelapsed=0.019
locale graph_edges_it =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    edges_list_it ::
      "'G \<Rightarrow> (('V \<times> 'W \<times> 'V) list
                         \<Rightarrow> bool)
                        \<Rightarrow> ('V \<times> 'W \<times> 'V
 \<Rightarrow> ('V \<times> 'W \<times> 'V) list
               \<Rightarrow> ('V \<times> 'W \<times> 'V) list)
\<Rightarrow> ('V \<times> 'W \<times> 'V) list
              \<Rightarrow> ('V \<times> 'W \<times> 'V) list"
      
  assumes "graph_edges_it \<alpha> invar edges_list_it"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=3421name=localeelapsed=0.056
### Ambiguous input (line 216 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" ax)
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_applC" ("_position" sourcenode) ("_position" a))
###         ("_applC" ("_position" sourcenode) ("_position" ax)))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" ax))
###         ("\<^const>HOL.Not"
###           ("_applC"
###             ("\<^const>local.postdominate" ("_position" n)
###               ("_position" targetnode))
###             ("_position" ax)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" ax)
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_applC" ("_position" sourcenode) ("_position" a))
###         ("_applC" ("_position" sourcenode) ("_position" ax)))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" ax))
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n)
###             ("_applC" ("_position" targetnode) ("_position" ax))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4939name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8360name=showelapsed=0.016
ML_statistics = :now=1464804832.55tasks_ready=1689tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=5size_allocation=3748659200size_allocation_free=3324538904size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3749188288threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=47.456time_GC=2.688user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
locale graph_succ_it_defs =
  fixes
    succ_list_it ::
      "'G \<Rightarrow> 'V \<Rightarrow> (('W \<times> 'V) list
    \<Rightarrow> bool)
   \<Rightarrow> ('W \<times> 'V
                  \<Rightarrow> ('W \<times> 'V) list
                                \<Rightarrow> ('W \<times> 'V) list)
                 \<Rightarrow> ('W \<times> 'V) list
                               \<Rightarrow> ('W \<times> 'V) list"
      
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9830name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5016name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11149name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=4426name=definitionelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5097name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11200name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9881name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5170name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11200name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9881name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=18712name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9949name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11266name=showelapsed=0.019
locale graph_succ_it =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    succ_list_it ::
      "'G \<Rightarrow> 'V \<Rightarrow> (('W \<times> 'V) list
    \<Rightarrow> bool)
   \<Rightarrow> ('W \<times> 'V
                  \<Rightarrow> ('W \<times> 'V) list
                                \<Rightarrow> ('W \<times> 'V) list)
                 \<Rightarrow> ('W \<times> 'V) list
                               \<Rightarrow> ('W \<times> 'V) list"
      
  assumes "graph_succ_it \<alpha> invar succ_list_it"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=4490name=localeelapsed=0.055
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=19243name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=18974name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=19811name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=20499name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21027name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=19887name=showelapsed=0.021
### Introduced fixed type variable(s): 'd in "x__"
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21744name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21091name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=22102name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=5399name=definitionelapsed=0.030
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21281name=showelapsed=0.028
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=23406name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=22667name=interpretelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=22739name=haveelapsed=0.024
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=23862name=haveelapsed=0.022
locale graph_from_list =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    from_list ::
      "'V list \<times> ('V \<times> 'W \<times> 'V) list \<Rightarrow> 'G" 
  assumes "graph_from_list \<alpha> invar from_list"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=5828name=localeelapsed=0.047
### Ambiguous input (line 346 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 26 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>Orderings.ord_class.less"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("_applC" ("_position" length) ("_position" as'))))
###         ("_position" k))
###       ("\<^const>local.path" ("_position" n') ("_position" as'')
###         ("\<^const>HOL.conj" ("_position" n'')
###           ("\<^const>HOL.eq" ("_position" as)
###             ("\<^const>List.append" ("_position" as')
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("\<^const>Orderings.ord_class.less"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k))
###           ("\<^const>local.path" ("_position" n') ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" n'')
###               ("\<^const>HOL.eq" ("_position" as)
###                 ("\<^const>List.append" ("_position" as')
###                   ("_position" as''))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less"
###           ("_applC" ("_position" length) ("_position" as')) ("_position" k))
###         ("\<^const>local.path" ("_position" n') ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" n'')
###             ("\<^const>HOL.eq" ("_position" as)
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as'')))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>Orderings.ord_class.less"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k))))
###       ("\<^const>local.path" ("_position" n') ("_position" as'')
###         ("\<^const>HOL.conj" ("_position" n'')
###           ("\<^const>HOL.eq" ("_position" as)
###             ("\<^const>List.append" ("_position" as')
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>local.path"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("\<^const>Orderings.ord_class.less"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k))
###             ("_position" n'))))
###       ("_position" as'')
###       ("\<^const>HOL.conj" ("_position" n'')
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as') ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>Orderings.ord_class.less"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("_applC" ("_position" length) ("_position" as'))))
###         ("_position" k))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n') ("_position" as'')
###           ("_position" n''))
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as') ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("\<^const>Orderings.ord_class.less"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k))
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" n') ("_position" as'')
###               ("_position" n''))
###             ("\<^const>HOL.eq" ("_position" as)
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as'')))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less"
###           ("_applC" ("_position" length) ("_position" as')) ("_position" k))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n') ("_position" as'')
###             ("_position" n''))
###           ("\<^const>HOL.eq" ("_position" as)
###             ("\<^const>List.append" ("_position" as')
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>Orderings.ord_class.less"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k))))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n') ("_position" as'')
###           ("_position" n''))
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as') ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("\<^const>Orderings.ord_class.less"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k))
###             ("\<^const>local.path" ("_position" n') ("_position" as'')
###               ("_position" n'')))))
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as') ("_position" as''))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13309name=showelapsed=0.038
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=22875name=showelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=24005name=showelapsed=0.018
### Ambiguous input (line 395 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k))
###         ("\<^const>Set.member" ("_position" n'')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("\<^const>Set.member" ("_position" n'')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))))
###         ("\<^const>Set.member" ("_position" n'')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n'')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k)))
###             ("_position" n'')))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14684name=haveelapsed=0.017
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=24572name=showelapsed=0.014
locale graph_to_list =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    to_list ::
      "'G \<Rightarrow> 'V list \<times> ('V \<times> 'W \<times> 'V) list" 
  assumes "graph_to_list \<alpha> invar to_list"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=6112name=localeelapsed=0.045
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15492name=haveelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=484name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14740name=fixelapsed=0.017
### Ambiguous input (line 399 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("_applC" ("_position" length) ("_position" as))))
###         ("_position" k1))
###       ("\<^const>Set.member" ("_position" n'')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k1)))
###         ("\<^const>Set.member" ("_position" n'')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k1))))
###       ("\<^const>Set.member" ("_position" n'')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" nx))
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("_applC" ("_position" length) ("_position" as))
###           ("_position" k1)))
###       ("\<^const>Set.member" ("_position" n'')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k1)))
###           ("_position" n'')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14799name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15682name=obtainelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14799name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15682name=obtainelapsed=0.019
### Ambiguous input (line 402 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n'') ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path" ("_position" n'') ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n'') ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as)
###             ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n'') ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k)))
###             ("_position" n')))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14880name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15839name=haveelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14917name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=17117name=byelapsed=0.086
### Ambiguous input (line 406 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path" ("_position" n'') ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("_applC" ("_position" length) ("_position" as))))
###         ("_position" k2))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>local.path" ("_position" n'') ("_position" as)
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k2)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n'') ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k2))))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n'') ("_position" as)
###           ("_position" nx))
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("_applC" ("_position" length) ("_position" as))
###           ("_position" k2)))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n'') ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k2)))
###           ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14977name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=724name=henceelapsed=0.014
### Ambiguous input (line 25 of "~~/afp/thys/Slicing/Basic/DynDataDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###     ("_position" n')
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n') ("_position" a))
###     ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16031name=obtainelapsed=0.027
### Ambiguous input (line 382 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("_applC" ("_position" length) ("_position" as))))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" nx))
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("_applC" ("_position" length) ("_position" as))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("\<^const>Groups.one_class.one")))
###           ("_position" n)))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15042name=henceelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=804name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16031name=obtainelapsed=0.017
### Ambiguous input (line 384 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("\<^const>Set.member" ("_position" n)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k)))
###             ("_position" n)))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16205name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=995name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15125name=henceelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1039name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16263name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=15242name=showelapsed=0.017
### Ambiguous input (line 438 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" as') ("_idts" ("_position" a) ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as')
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a))
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("_applC" ("_position" targetnode) ("_position" a))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" as') ("_idts" ("_position" a) ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as')
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.Not"
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("_applC" ("_position" sourcenode) ("_position" a))))
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_applC" ("_position" targetnode) ("_position" a))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" as') ("_idts" ("_position" a) ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq" ("_position" as)
###         ("\<^const>List.append" ("_position" as')
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a))
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate"
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("_position" n')))
###             ("_applC" ("_position" targetnode) ("_position" a))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16323name=henceelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=24916name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=17527name=showelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18471name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16386name=obtainelapsed=0.022
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=25372name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1309name=haveelapsed=0.017
### Ambiguous input (line 40 of "~~/afp/thys/Slicing/Basic/DynDataDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###     ("_position" n')
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n') ("_position" a))
###     ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16386name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=25515name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1421name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16586name=haveelapsed=0.016
ML_statistics = :now=1464804833.05tasks_ready=1724tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=5size_allocation=3748659200size_allocation_free=2859385896size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3749188288threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=49.056time_GC=2.688user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### Ambiguous input (line 473 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k)))
###             ("_position" n')))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16654name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1559name=haveelapsed=0.020
### Ambiguous input (line 45 of "~~/afp/thys/Slicing/Basic/DynDataDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###     ("_position" n')
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" as))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_data_dependence" ("_position" n) ("_position" V)
###       ("_position" n') ("_position" a))
###     ("_position" as)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18779name=haveelapsed=0.031
### Ambiguous input (line 477 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("_applC" ("_position" length) ("_position" as))))
###         ("_position" k))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k))))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("_position" nx))
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("_applC" ("_position" length) ("_position" as)) ("_position" k)))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16705name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1706name=haveelapsed=0.020
### Ambiguous input (line 418 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k)))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as)
###             ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k)))
###             ("_position" n')))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18953name=obtainelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1814name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16794name=haveelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18953name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1929name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16954name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19159name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19233name=fixelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=2064name=haveelapsed=0.016
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26084name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19311name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=2117name=henceelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26230name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19407name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=2248name=haveelapsed=0.017
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26492name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=2396name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19494name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26574name=haveelapsed=0.018
### Ambiguous input (line 488 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as'))))
###           ("_position" k))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as'))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" nx))
###       ("\<^const>local.path" ("_position" n'') ("_position" as')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k)))
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as')))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k))))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as'))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k)))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as'))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ex_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as'))
###                 ("_position" k)))
###             ("_position" n')))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as')))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/DataDependence.thyoffset=482name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19585name=haveelapsed=0.028
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26976name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=720name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19720name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=740name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=720name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=740name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1437name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=904name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=946name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=944name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1635name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=986name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1813name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1005name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9137name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1902name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=1047name=showelapsed=0.017
### Introduced fixed type variable(s): 'a, 'b in "nx'__" or "nx__"
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9216name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13823name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3592name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9280name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13823name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3592name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13935name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3933name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=3007name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13935name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4004name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=3133name=applyelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14048name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4069name=haveelapsed=0.019
### Ambiguous input (line 332 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a) ("_position" asx))
###     ("\<^const>local.path" ("\<^fixed>Entry")
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" asx))
###       ("\<^const>HOL.conj" ("_position" n)
###         ("\<^const>Set.not_member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes)
###               ("\<^const>List.list.Cons" ("_position" a)
###                 ("_position" asx)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a) ("_position" asx))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("\<^fixed>Entry")
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" asx))
###         ("_position" n))
###       ("\<^const>Set.not_member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes)
###             ("\<^const>List.list.Cons" ("_position" a)
###               ("_position" asx))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a) ("_position" asx))
###     ("\<^const>Set.not_member"
###       ("\<^const>local.path" ("\<^fixed>Entry")
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" asx))
###         ("\<^const>HOL.conj" ("_position" n) ("_position" n)))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes)
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" asx)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=4804name=assumeelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4179name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14124name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=5404name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4256name=haveelapsed=0.016
### Ambiguous input (line 112 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies" ("\<^fixed>Exit")
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^fixed>Exit"))
###       ("\<^const>Set.member" ("_position" n')
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15452name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=9013name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4382name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15452name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakControlDependence.thyoffset=709name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4518name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15562name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/StandardControlDependence.thyoffset=725name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4518name=obtainelapsed=0.018
### Ambiguous input (line 19 of "~~/afp/thys/Slicing/StaticIntra/Observable.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("_Ball" ("_position" nx)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))
###             ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))
###           ("\<^const>Set.member" ("_position" n') ("_position" S)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("_Ball" ("_position" nx)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as)))
###           ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))
###         ("\<^const>Set.member" ("_position" n') ("_position" S))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("_Ball" ("_position" nx)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))
###             ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))))
###       ("\<^const>Set.member" ("_position" n') ("_position" S)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("_Ball" ("_position" nx)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))
###               ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))
###             ("_position" n'))))
###       ("_position" S))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804833.55tasks_ready=1762tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=5size_allocation=3748659200size_allocation_free=2392928432size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3749188288threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=50.648time_GC=2.688user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4639name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=748name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=459name=haveelapsed=0.025
### Ambiguous input (line 21 of "~~/afp/thys/Slicing/StaticIntra/Observable.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("_Ball" ("_position" nx)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))
###             ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))
###           ("\<^const>Set.member" ("_position" n') ("_position" S)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("_Ball" ("_position" nx)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as)))
###           ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))
###         ("\<^const>Set.member" ("_position" n') ("_position" S))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("_Ball" ("_position" nx)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))
###             ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))))
###       ("\<^const>Set.member" ("_position" n') ("_position" S)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("_Ball" ("_position" nx)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))
###               ("\<^const>Set.not_member" ("_position" nx) ("_position" S)))
###             ("_position" n'))))
###       ("_position" S))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=800name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4722name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=872name=fixelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4787name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=559name=thuselapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=905name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4875name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=1845name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=1480name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6173name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=1845name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6223name=fixelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2554name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2007name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6286name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2676name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6383name=henceelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2108name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2789name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=8431name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2188name=ultimatelyelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2199name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2881name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Com.thyoffset=1802name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/WeakOrderDependence.thyoffset=1278name=byelapsed=0.032
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=546name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1191name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=1179name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1933name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=1179name=obtainelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2007name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=1288name=showelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2742name=byelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2007name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2053name=showelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2207name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3401name=applyelapsed=0.036
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=4217name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3615name=obtainelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3615name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3719name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3786name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3843name=henceelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=3910name=thuselapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=3755name=byelapsed=0.012
ML_statistics = :now=1464804834.05tasks_ready=1766tasks_pending=0tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=5size_allocation=3748659200size_allocation_free=1051312088size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3749188288threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=53.852time_GC=2.688user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=1861name=byelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=5446name=applyelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2003name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=4102name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=5807name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=5887name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2367name=byelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=4357name=byelapsed=0.366
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=4680name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=4794name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2539name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6610name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3344name=byelapsed=0.038
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6722name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3570name=thuselapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6771name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6771name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3673name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6845name=showelapsed=0.643
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3947name=thuselapsed=0.641
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=5415name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=4054name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=4186name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=5529name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=5927name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10261name=assumeelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10647name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=6044name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=6257name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10952name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10952name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=849name=showelapsed=0.017
ML_statistics = :now=1464804835.14tasks_ready=1791tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=6size_allocation=3718250496size_allocation_free=3718250496size_heap=4086300672size_heap_free_last_full_GC=0size_heap_free_last_GC=3718644304threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=55.1time_GC=3.292user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=944name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11114name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=6346name=recordelapsed=2.356
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11372name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1153name=showelapsed=0.018
locale StdGraphDefs =
  fixes ops :: "('V, 'W, 'G, 'm) graph_ops_scheme" 
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=6985name=localeelapsed=0.025
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7214name=abbreviationelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1387name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7255name=abbreviationelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16686name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7308name=abbreviationelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1548name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16686name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7361name=abbreviationelapsed=0.013
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7423name=abbreviationelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1767name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16854name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7494name=abbreviationelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1790name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7556name=abbreviationelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17112name=showelapsed=0.025
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7627name=abbreviationelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1878name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7692name=abbreviationelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4768name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1909name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7751name=abbreviationelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4768name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7828name=abbreviationelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2091name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4822name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7905name=abbreviationelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2817name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4978name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3846name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5075name=obtainelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=7101name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5075name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5181name=henceelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=7933name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5276name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8023name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5440name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8050name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5547name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8086name=letelapsed=0.021
locale StdGraph =
  fixes ops :: "('a, 'b, 'c, 'd) graph_ops_scheme" 
  assumes "StdGraph ops"
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=7985name=localeelapsed=0.171
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5719name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8125name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5830name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8125name=obtainelapsed=0.020
### Ambiguous input (line 185 of "~~/afp/thys/Slicing/While/Labels.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" labels)
###     ("_cargs"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_cargs"
###         ("\<^const>Groups.plus_class.plus" ("_position" l)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" c'')))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" labels)
###     ("_cargs"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_cargs"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Groups.plus_class.plus" ("_position" l)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("\<^const>Groups.one_class.one"))
###         ("_position" c'')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### theory "GraphSpec"
### 8.082s elapsed time, 27.024s cpu time, 1.652s GC time
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8262name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6013name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9471name=byelapsed=0.026
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8305name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9786name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6124name=showelapsed=0.019
ML_statistics = :now=1464804835.64tasks_ready=1811tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=6size_allocation=3718250496size_allocation_free=2406105192size_heap=4086300672size_heap_free_last_full_GC=0size_heap_free_last_GC=3718644304threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=56.684time_GC=3.292user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=10369name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6285name=obtainelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=11262name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6285name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6380name=henceelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6482name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6501name=qedelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=5554name=showelapsed=0.021
### Ambiguous input (line 188 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.not_equal" ("_position" as)
###         ("\<^const>List.list.Nil")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.not_equal"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n') ("_position" as)))
###       ("\<^const>List.list.Nil"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=11452name=byelapsed=0.093
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=5759name=thuselapsed=0.024
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=10833name=byelapsed=0.155
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=19337name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20111name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21137name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=19529name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21189name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20346name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=19616name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21189name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20542name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=19755name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21349name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=19867name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21349name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20590name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21496name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20766name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=12119name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20922name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=12896name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13959name=applyelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=12922name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=12962name=showelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16247name=obtainelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16486name=obtainelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16247name=obtainelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16486name=obtainelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16296name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16527name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16574name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=26381name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=17867name=byelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16657name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=26851name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=26484name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16657name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27292name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=26583name=thuselapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16706name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16765name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27458name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18093name=showelapsed=0.017
ML_statistics = :now=1464804836.14tasks_ready=1796tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=6size_allocation=3718250496size_allocation_free=1092340120size_heap=4086300672size_heap_free_last_full_GC=0size_heap_free_last_GC=3718644304threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=58.284time_GC=3.292user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=16804name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27692name=haveelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18143name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27765name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=7577name=showelapsed=0.015
### Ambiguous input (line 245 of "~~/afp/thys/Slicing/StaticIntra/PDG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.not_equal" ("_position" as)
###         ("\<^const>List.list.Nil")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>HOL.not_equal"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n') ("_position" as)))
###       ("\<^const>List.list.Nil"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18182name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27915name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=7788name=thuselapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19369name=assumeelapsed=0.146
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19273name=byelapsed=0.150
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18990name=showelapsed=0.162
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19941name=proofelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19432name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20316name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20016name=showelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19492name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20096name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19532name=ultimatelyelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20366name=obtainelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19543name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20366name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21672name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22923name=byelapsed=0.031
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20500name=obtainelapsed=0.028
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=23301name=byelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=23627name=byelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20500name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24071name=byelapsed=0.026
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20782name=henceelapsed=0.022
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24503name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20860name=thuselapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24745name=byelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24551name=thuselapsed=0.019
### Ambiguous input (line 677 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25047name=applyelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24598name=henceelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25096name=applyelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=28628name=obtainelapsed=0.025
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24647name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=28628name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25138name=applyelapsed=0.029
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25399name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=28790name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26303name=ultimatelyelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26795name=byelapsed=0.012
### Ambiguous input (line 777 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 7 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>Set.subset_eq" ("_applC" ("_position" S) ("_position" n))
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.relevant_vars"
###       ("\<^const>Set.subset_eq" ("_applC" ("_position" S) ("_position" n))
###         ("\<^const>local.relevant_vars" ("_position" S))))
###     ("_position" n')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>Set.subset_eq" ("_applC" ("_position" S) ("_position" n))
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 783 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 7 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>Set.subset_eq" ("_applC" ("_position" S) ("_position" n'))
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.relevant_vars"
###       ("\<^const>Set.subset_eq" ("_applC" ("_position" S) ("_position" n'))
###         ("\<^const>local.relevant_vars" ("_position" S))))
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>Set.subset_eq" ("_applC" ("_position" S) ("_position" n'))
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26314name=showelapsed=0.020
### Ambiguous input (line 683 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 18 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>local.path" ("_position" nx) ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" m)
###               ("\<^const>HOL.eq" ("_position" as)
###                 ("\<^const>List.append" ("_position" as')
###                   ("_position" as''))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("_position" nx))
###         ("\<^const>local.path" ("_position" nx) ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" m)
###             ("\<^const>HOL.eq" ("_position" as)
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as'')))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>local.path"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" nx) ("_position" nx)))
###         ("_position" as'')
###         ("\<^const>HOL.conj" ("_position" m)
###           ("\<^const>HOL.eq" ("_position" as)
###             ("\<^const>List.append" ("_position" as')
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" nx) ("_position" as'')
###               ("_position" m))
###             ("\<^const>HOL.eq" ("_position" as)
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as'')))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("_position" nx))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" nx) ("_position" as'')
###             ("_position" m))
###           ("\<^const>HOL.eq" ("_position" as)
###             ("\<^const>List.append" ("_position" as')
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>local.path" ("_position" nx) ("_position" as'')
###               ("_position" m))))
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as') ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj" ("_position" nx) ("_position" nx)))
###           ("_position" as'') ("_position" m))
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as') ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>local.path" ("_position" nx) ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" m) ("_position" as)))))
###         ("\<^const>List.append" ("_position" as') ("_position" as''))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" nx) ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" m) ("_position" as)))
###             ("\<^const>List.append" ("_position" as')
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" nx)
###       ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" obs)
###           ("_cargs" ("_position" n)
###             ("_applC" ("_position" backward_slice) ("_position" S)))))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("_position" nx))
###         ("\<^const>HOL.eq"
###           ("\<^const>local.path" ("_position" nx) ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" m) ("_position" as)))
###           ("\<^const>List.append" ("_position" as') ("_position" as'')))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26353name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=28890name=haveelapsed=0.054
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26880name=byelapsed=0.031
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27126name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30334name=obtainelapsed=0.024
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27771name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30334name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27771name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30514name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27820name=haveelapsed=0.020
ML_statistics = :now=1464804836.74tasks_ready=1792tasks_pending=0tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=7size_allocation=3565158400size_allocation_free=2345539624size_heap=4109369344size_heap_free_last_full_GC=0size_heap_free_last_GC=3565956512threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=61.504time_GC=3.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30567name=obtainelapsed=0.024
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27020name=byelapsed=0.105
### Ambiguous input (line 798 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n''))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27994name=ultimatelyelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30567name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=28005name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=33876name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30777name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=456name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38562name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=477name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38562name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30933name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=603name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38824name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32666name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1429name=thuselapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38824name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38992name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1450name=nextelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32789name=haveelapsed=0.018
### Ambiguous input (line 767 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1580name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=41549name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32928name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=41806name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Char_ord.thyoffset=1514name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45148name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=41917name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2649name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45228name=noteelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42164name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2670name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45432name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42222name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2848name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45587name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42378name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46065name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42378name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45719name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46149name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42449name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=744name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46425name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42504name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=639name=applyelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46531name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42504name=obtainelapsed=0.018
### Ambiguous input (line 1080 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=829name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42728name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46629name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=920name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46773name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42892name=haveelapsed=0.016
### Ambiguous input (line 1082 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("_position" Use) ("_position" n\<^sub>1))
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("_position" Use) ("_position" n\<^sub>1))
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=905name=applyelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42989name=ultimatelyelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46848name=haveelapsed=0.019
### Ambiguous input (line 1084 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43000name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/List_lexord.thyoffset=1228name=applyelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46991name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43094name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47098name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43212name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47206name=haveelapsed=0.016
### Ambiguous input (line 1013 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 7 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n\<^sub>1))
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n\<^sub>1))
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n\<^sub>1'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.relevant_vars"
###       ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n\<^sub>1))
###         ("\<^const>local.relevant_vars" ("_position" S))))
###     ("_position" n\<^sub>1')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=51933name=obtainelapsed=0.024
ML_statistics = :now=1464804837.24tasks_ready=1807tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=7size_allocation=3565158400size_allocation_free=1230252120size_heap=4109369344size_heap_free_last_full_GC=0size_heap_free_last_GC=3565956512threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=63.092time_GC=3.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43330name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=51933name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47310name=obtainelapsed=0.018
### Ambiguous input (line 1017 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52154name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47310name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43466name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52257name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47489name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43759name=haveelapsed=0.021
### Ambiguous input (line 1022 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1') ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1') ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52382name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47626name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43833name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47626name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52496name=obtainelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44865name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47774name=haveelapsed=0.020
### Ambiguous input (line 1102 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1') ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1') ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52496name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47868name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52735name=showelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50891name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=53144name=byelapsed=0.056
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=51058name=showelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=53886name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54371name=thuselapsed=0.020
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2598name=applyelapsed=0.041
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54582name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54074name=byelapsed=0.054
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2639name=applyelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55055name=proofelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54784name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55176name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58685name=showelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55331name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55674name=caseelapsed=0.109
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=2684name=applyelapsed=0.167
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2228name=byelapsed=0.120
### Ambiguous input (line 1290 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>Pure.all_binder"
###   ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("_position" n')))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as)))
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as')))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_position" S) ("_position" as)))
###                 ("_position" s))))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_position" S) ("_position" as')))
###                   ("_position" s'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("\<^const>Set.member" ("_position" n') ("_position" S)))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("_Ball" ("_position" V)
###                     ("_applC"
###                       ("\<^const>local.relevant_vars" ("_position" S))
###                       ("_position" n''))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s) ("_position" V)))
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s')
###                           ("_position" V))))))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" as) ("_position" as')))))
### ("\<^const>Pure.all_binder"
###   ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("_position" n')))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as)))
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as')))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_position" S) ("_position" as)))
###                 ("_position" s))))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_position" S) ("_position" as')))
###                   ("_position" s'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("\<^const>Set.member" ("_position" n') ("_position" S)))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("_Ball" ("_position" V)
###                     ("\<^const>local.relevant_vars"
###                       ("_applC" ("_position" S) ("_position" n'')))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s) ("_position" V)))
###                       ("_applC" ("_position" state_val)
###                         ("_cargs" ("_position" s')
###                           ("_position" V))))))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" as) ("_position" as')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55707name=noteelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64617name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=67949name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55916name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64700name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68151name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=69432name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71045name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64846name=showelapsed=0.028
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2476name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71190name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3203name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71253name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3337name=byelapsed=0.030
ML_statistics = :now=1464804837.83tasks_ready=1817tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=8size_allocation=3629121536size_allocation_free=3629121536size_heap=4179623936size_heap_free_last_full_GC=0size_heap_free_last_GC=3630686256threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=64.86time_GC=3.528user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3476name=proofelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71344name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5122name=proofelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3596name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71444name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5240name=showelapsed=0.016
### Ambiguous input (line 181 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3675name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71444name=obtainelapsed=0.019
### Ambiguous input (line 143 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5377name=obtainelapsed=0.020
### Ambiguous input (line 1622 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as')
###     ("\<^const>HOL.eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_position" S) ("_position" as')))
###                 ("_position" s)))
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as'))))))
###       ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as')
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" preds)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_position" S) ("_position" as')))
###               ("_position" s)))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as')))
###             ("\<^const>List.list.Nil")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as')
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" preds)
###           ("_cargs"
###             ("_applC" ("_position" slice_kinds)
###               ("_cargs" ("_position" S) ("_position" as')))
###             ("_position" s)))
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" slice_edges)
###             ("_cargs" ("_position" S) ("_position" as')))
###           ("\<^const>List.list.Nil"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as')
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("_applC" ("_position" preds)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_position" S) ("_position" as')))
###               ("_position" s)))))
###       ("\<^const>HOL.eq"
###         ("_applC" ("_position" slice_edges)
###           ("_cargs" ("_position" S) ("_position" as')))
###         ("\<^const>List.list.Nil")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3810name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71592name=showelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5377name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5446name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3810name=obtainelapsed=0.020
### Ambiguous input (line 183 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75701name=obtainelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3877name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5512name=showelapsed=0.017
### Ambiguous input (line 145 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 187 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75701name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=3941name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5646name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75996name=haveelapsed=0.013
### Ambiguous input (line 149 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5646name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76099name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4073name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5715name=haveelapsed=0.018
### Ambiguous input (line 189 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76183name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4073name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5777name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76285name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4140name=haveelapsed=0.020
### Ambiguous input (line 151 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 193 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 1721 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76366name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5921name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4200name=showelapsed=0.018
### Ambiguous input (line 155 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5921name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76454name=showelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4342name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=5990name=haveelapsed=0.018
### Ambiguous input (line 195 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4342name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6062name=showelapsed=0.020
### Ambiguous input (line 199 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4409name=haveelapsed=0.021
### Ambiguous input (line 157 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6191name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4479name=showelapsed=0.020
### Ambiguous input (line 161 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6191name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6503name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4606name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6260name=haveelapsed=0.019
### Ambiguous input (line 201 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2719name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4606name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6321name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6758name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4673name=haveelapsed=0.019
### Ambiguous input (line 163 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6340name=qedelapsed=0.012
### Ambiguous input (line 324 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less" ("_position" l)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog)))
###         ("_position" prog))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less" ("_position" l)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog)))
###         ("_position" prog)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>HOL.conj"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog)))
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.conj" ("_position" prog)
###           ("\<^const>WCFG.While_CFG" ("_position" prog)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("\<^const>WCFG.w_node.Exit")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog) ("_position" prog))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog) ("_position" prog)))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.conj" ("_position" prog) ("_position" prog))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("\<^const>WCFG.w_node.Exit"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog) ("_position" prog)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.conj"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog))
###           ("_position" prog))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11269name=haveelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6823name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4732name=showelapsed=0.019
### Ambiguous input (line 167 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12691name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6887name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4860name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6950name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4860name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=2971name=byelapsed=0.045
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7017name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4927name=haveelapsed=0.021
### Ambiguous input (line 169 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804838.34tasks_ready=1855tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=8size_allocation=3629121536size_allocation_free=2447667224size_heap=4179623936size_heap_free_last_full_GC=0size_heap_free_last_GC=3630686256threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=66.46time_GC=3.528user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12879name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7185name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=4986name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12902name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7185name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7263name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12972name=thuselapsed=0.018
### Ambiguous input (line 373 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.cmd.LAss"
###       ("\<^const>Com.num_inner_nodes" ("_position" V)) ("_position" e))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 232 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" c\<^sub>2))
###     ("_position" n) ("_position" et') ("_position" n')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et') ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13035name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7383name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21355name=proofelapsed=0.047
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7497name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13066name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21505name=haveelapsed=0.022
### Ambiguous input (line 386 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 12 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("\<^const>WCFG.While_CFG" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>WCFG.While_CFG" ("_position" prog1)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###               ("_position" n))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog1))
###         ("_position" n) ("_position" et)
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>WCFG.While_CFG" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.disj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog1))
###           ("_position" n) ("_position" et)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))
###         ("\<^const>WCFG.While_CFG" ("_position" prog1)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog1)))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog1))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.While_CFG"
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog1))
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog1))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13379name=noteelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7648name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21565name=thuselapsed=0.021
### Ambiguous input (line 388 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 12 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog2)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("\<^const>WCFG.While_CFG" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>WCFG.While_CFG" ("_position" prog2)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###               ("_position" n))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog2))
###         ("_position" n) ("_position" et)
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>WCFG.While_CFG" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.disj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog2))
###           ("_position" n) ("_position" et)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))
###         ("\<^const>WCFG.While_CFG" ("_position" prog2)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog2)))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog2))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.While_CFG"
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog2))
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog2))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7648name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13482name=noteelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21681name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7730name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13585name=showelapsed=0.014
### Ambiguous input (line 242 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_position" n) ("_position" et')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" c\<^sub>2))
###     ("_position" n) ("_position" et')
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21742name=thuselapsed=0.021
### Ambiguous input (line 451 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 12 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("\<^const>WCFG.While_CFG" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>WCFG.While_CFG" ("_position" prog1)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###               ("_position" n))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog1))
###         ("_position" n) ("_position" et)
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>WCFG.While_CFG" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.disj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog1))
###           ("_position" n) ("_position" et)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))
###         ("\<^const>WCFG.While_CFG" ("_position" prog1)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog1)))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog1))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.While_CFG"
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog1))
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog1))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15728name=noteelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7861name=haveelapsed=0.018
### Ambiguous input (line 453 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 12 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog2)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("\<^const>WCFG.While_CFG" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>WCFG.While_CFG" ("_position" prog2)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###               ("_position" n))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog2))
###         ("_position" n) ("_position" et)
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>WCFG.While_CFG" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.disj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog2))
###           ("_position" n) ("_position" et)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))
###         ("\<^const>WCFG.While_CFG" ("_position" prog2)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog2)))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog2))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.While_CFG"
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog2))
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog2))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7995name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21849name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15831name=noteelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21902name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15934name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8136name=obtainelapsed=0.017
### Ambiguous input (line 619 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e) ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21951name=fromelapsed=0.011
### Ambiguous input (line 532 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 12 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog'))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>HOL.disj"
###             ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###               ("_position" et)
###               ("\<^const>WCFG.w_node.Node" ("_position" l)))
###             ("_position" prog')))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>HOL.disj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###             ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###           ("\<^const>WCFG.While_CFG" ("_position" prog')
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###           ("_position" et)
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>WCFG.While_CFG" ("_position" prog')
###               ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###               ("_position" n))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog'))
###         ("_position" n) ("_position" et)
###         ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>WCFG.While_CFG" ("_position" prog')
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.disj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog'))
###           ("_position" n) ("_position" et)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))
###         ("\<^const>WCFG.While_CFG" ("_position" prog')
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog')))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###             ("_position" et)
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog'))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###           ("_position" et)
###           ("\<^const>WCFG.While_CFG"
###             ("\<^const>HOL.disj"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_position" prog'))
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("_position" n)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog'))
###         ("_position" n) ("_position" et)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_position" prog'))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("_position" n))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8136name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18895name=noteelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22012name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18996name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8212name=haveelapsed=0.016
### Ambiguous input (line 252 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_position" et') ("_position" n'))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" et')
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_position" et')
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" et') ("_position" n')))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" et') ("_position" n'))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22063name=thuselapsed=0.021
### Ambiguous input (line 624 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e) ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=6366name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8346name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22180name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8537name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=850name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22231name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8576name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=850name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22296name=noteelapsed=0.010
### Ambiguous input (line 631 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8644name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=966name=haveelapsed=0.016
### Ambiguous input (line 632 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 18 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###           ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###           ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###             ("_position" n\<^sub>2')))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.disj" ("_position" n\<^sub>2')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq"
###           ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###             ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###             ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###               ("_position" n\<^sub>2')))
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###           ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.disj" ("_position" n\<^sub>2')
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###             ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###         ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###           ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.disj" ("_position" n\<^sub>2')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###           ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###           ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###             ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.disj" ("_position" n\<^sub>2')
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###         ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))
###     ("\<^const>HOL.conj"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###         ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.disj" ("_position" n\<^sub>2')
###       ("\<^const>HOL.conj"
###         ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###           ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1028name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8814name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22519name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1192name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8814name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22767name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8890name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1192name=obtainelapsed=0.017
### Ambiguous input (line 267 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et') ("_position" n'))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.one_class.one"))
###     ("_position" et')
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et')
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" et') ("_position" n')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23143name=noteelapsed=0.010
### Ambiguous input (line 649 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1254name=obtainelapsed=0.021
### Ambiguous input (line 650 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.not_equal" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23296name=fromelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9029name=haveelapsed=0.018
### Ambiguous input (line 650 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))
###     ("\<^const>HOL.not_equal" ("\<^const>WCFG.w_node.Exit")
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" n\<^sub>2')
###       ("\<^const>HOL.not_equal" ("\<^const>WCFG.w_node.Exit")
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" n\<^sub>2')
###         ("\<^const>WCFG.w_node.Exit")))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1254name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9146name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23407name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1335name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23686name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9288name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23746name=noteelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1480name=showelapsed=0.018
### Ambiguous input (line 660 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9288name=obtainelapsed=0.017
### Ambiguous input (line 660 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" n\<^sub>2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" n\<^sub>2)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("_position" n\<^sub>2))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 661 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.not_equal" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23893name=fromelapsed=0.013
ML_statistics = :now=1464804838.84tasks_ready=1899tasks_pending=0tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=8size_allocation=3629121536size_allocation_free=1253272608size_heap=4179623936size_heap_free_last_full_GC=0size_heap_free_last_GC=3630686256threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=68.056time_GC=3.528user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9364name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1810name=obtainelapsed=0.019
### Ambiguous input (line 662 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 17 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>HOL.conj"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et\<^sub>2) ("_position" nx))
###       ("_position" nx))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et\<^sub>2) ("_position" nx))
###     ("\<^const>WCFG.label_incr" ("_position" nx)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_position" n\<^sub>2'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" nx)
###       ("\<^const>WCFG.label_incr" ("_position" nx)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###             ("_position" n\<^sub>2')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" nx) ("_position" nx)))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.conj" ("_position" nx) ("_position" nx))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_position" n\<^sub>2'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.conj"
###         ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###           ("_position" et\<^sub>2) ("_position" nx))
###         ("_position" nx))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" nx)
###         ("\<^const>WCFG.label_incr" ("_position" nx)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et\<^sub>2) ("_position" nx))
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.label_incr" ("_position" nx)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" nx)
###       ("\<^const>HOL.eq"
###         ("\<^const>WCFG.label_incr" ("_position" nx)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###         ("_position" et\<^sub>2)
###         ("\<^const>HOL.conj" ("_position" nx) ("_position" nx)))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1810name=obtainelapsed=0.020
### Ambiguous input (line 278 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et') ("_position" n'))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" et')
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et')
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_position" et')
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et')
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" et') ("_position" n')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et') ("_position" n'))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" et') ("_position" n')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et') ("_position" n'))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" et')
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9439name=withelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24005name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1925name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9523name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24005name=obtainelapsed=0.020
### Ambiguous input (line 668 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.not_equal" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=1987name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9722name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24341name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9762name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Interpretation.thyoffset=2094name=thuselapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24426name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9831name=thuselapsed=0.019
### Ambiguous input (line 673 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 673 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>HOL.not_equal" ("\<^const>Groups.one_class.one")
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.one_class.one"))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7512name=proofelapsed=0.093
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9904name=thuselapsed=0.100
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24565name=showelapsed=0.103
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7564name=thuselapsed=0.018
### Ambiguous input (line 677 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 677 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.not_equal"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24655name=fromelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10068name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24743name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10068name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7587name=nextelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24840name=noteelapsed=0.010
### Ambiguous input (line 683 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 684 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("_position" n\<^sub>2))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.one_class.one"))
###     ("_position" n\<^sub>2)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10154name=haveelapsed=0.021
### Ambiguous input (line 684 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.not_equal" ("\<^const>Groups.one_class.one")
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24989name=fromelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2878name=byelapsed=5.312
### Ambiguous input (line 685 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n)
###       ("_position" et\<^sub>2) ("_position" nx))
###     ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" nx)
###       ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n)
###       ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" nx) ("_position" n')))
###     ("_position" nx)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7678name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10277name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25105name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83008name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7678name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83008name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8129name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25105name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10277name=obtainelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25450name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83202name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10367name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8237name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25517name=noteelapsed=0.010
### Ambiguous input (line 696 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" c\<^sub>2))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("_position" n\<^sub>2'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10442name=ultimatelyelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8237name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83202name=obtainelapsed=0.018
### Ambiguous input (line 697 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" n\<^sub>2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_position" n\<^sub>2)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("_position" n\<^sub>2))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" n\<^sub>2))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" n\<^sub>2)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 697 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.not_equal"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" n\<^sub>2')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_position" n\<^sub>2')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.not_equal"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25666name=fromelapsed=0.016
### Ambiguous input (line 698 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et\<^sub>2) ("_position" nx))
###     ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" nx)
###       ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" nx) ("_position" n')))
###     ("_position" nx)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10453name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8473name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83497name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25798name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10606name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8500name=ultimatelyelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25798name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8511name=showelapsed=0.017
### Ambiguous input (line 1863 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" preds)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###               ("_position" s)))
###           ("\<^fixed>identifies" ("_position" n')
###             ("\<^const>HOL.conj" ("_position" c')
###               ("_Ball" ("_position" V)
###                 ("_applC" ("_position" Use) ("_position" n'))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" state_val)
###                     ("_cargs"
###                       ("_applC" ("_position" transfers)
###                         ("_cargs"
###                           ("_applC" ("_position" slice_kinds)
###                             ("_cargs" ("_Finset" ("_position" n'))
###                               ("_position" as)))
###                           ("_position" s)))
###                       ("_position" V)))
###                   ("_applC" ("_position" state_val)
###                     ("_cargs" ("_position" s') ("_position" V))))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" preds)
###           ("_cargs"
###             ("_applC" ("_position" slice_kinds)
###               ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###             ("_position" s)))
###         ("\<^fixed>identifies" ("_position" n')
###           ("\<^const>HOL.conj" ("_position" c')
###             ("_Ball" ("_position" V)
###               ("_applC" ("_position" Use) ("_position" n'))
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" state_val)
###                   ("_cargs"
###                     ("_applC" ("_position" transfers)
###                       ("_cargs"
###                         ("_applC" ("_position" slice_kinds)
###                           ("_cargs" ("_Finset" ("_position" n'))
###                             ("_position" as)))
###                         ("_position" s)))
###                     ("_position" V)))
###                 ("_applC" ("_position" state_val)
###                   ("_cargs" ("_position" s') ("_position" V)))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("_applC" ("_position" preds)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###               ("_position" s)))))
###       ("\<^fixed>identifies" ("_position" n')
###         ("\<^const>HOL.conj" ("_position" c')
###           ("_Ball" ("_position" V)
###             ("_applC" ("_position" Use) ("_position" n'))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" state_val)
###                 ("_cargs"
###                   ("_applC" ("_position" transfers)
###                     ("_cargs"
###                       ("_applC" ("_position" slice_kinds)
###                         ("_cargs" ("_Finset" ("_position" n'))
###                           ("_position" as)))
###                       ("_position" s)))
###                   ("_position" V)))
###               ("_applC" ("_position" state_val)
###                 ("_cargs" ("_position" s') ("_position" V))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^fixed>identifies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###                 ("_position" s)))
###             ("_position" n'))))
###       ("\<^const>HOL.conj" ("_position" c')
###         ("_Ball" ("_position" V)
###           ("_applC" ("_position" Use) ("_position" n'))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" state_val)
###               ("_cargs"
###                 ("_applC" ("_position" transfers)
###                   ("_cargs"
###                     ("_applC" ("_position" slice_kinds)
###                       ("_cargs" ("_Finset" ("_position" n'))
###                         ("_position" as)))
###                     ("_position" s)))
###                 ("_position" V)))
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s') ("_position" V)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###                 ("_position" s)))
###             ("\<^fixed>identifies" ("_position" n') ("_position" c')))))
###       ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" state_val)
###             ("_cargs"
###               ("_applC" ("_position" transfers)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_Finset" ("_position" n'))
###                       ("_position" as)))
###                   ("_position" s)))
###               ("_position" V)))
###           ("_applC" ("_position" state_val)
###             ("_cargs" ("_position" s') ("_position" V))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" preds)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###               ("_position" s)))
###           ("\<^const>HOL.conj"
###             ("\<^fixed>identifies" ("_position" n') ("_position" c'))
###             ("_Ball" ("_position" V)
###               ("_applC" ("_position" Use) ("_position" n'))
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" state_val)
###                   ("_cargs"
###                     ("_applC" ("_position" transfers)
###                       ("_cargs"
###                         ("_applC" ("_position" slice_kinds)
###                           ("_cargs" ("_Finset" ("_position" n'))
###                             ("_position" as)))
###                         ("_position" s)))
###                     ("_position" V)))
###                 ("_applC" ("_position" state_val)
###                   ("_cargs" ("_position" s') ("_position" V)))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("_position" n'))
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" preds)
###           ("_cargs"
###             ("_applC" ("_position" slice_kinds)
###               ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###             ("_position" s)))
###         ("\<^const>HOL.conj"
###           ("\<^fixed>identifies" ("_position" n') ("_position" c'))
###           ("_Ball" ("_position" V)
###             ("_applC" ("_position" Use) ("_position" n'))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" state_val)
###                 ("_cargs"
###                   ("_applC" ("_position" transfers)
###                     ("_cargs"
###                       ("_applC" ("_position" slice_kinds)
###                         ("_cargs" ("_Finset" ("_position" n'))
###                           ("_position" as)))
###                       ("_position" s)))
###                   ("_position" V)))
###               ("_applC" ("_position" state_val)
###                 ("_cargs" ("_position" s') ("_position" V))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" n')
###           ("_applC" ("_position" preds)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_Finset" ("_position" n')) ("_position" as)))
###               ("_position" s)))))
###       ("\<^const>HOL.conj"
###         ("\<^fixed>identifies" ("_position" n') ("_position" c'))
###         ("_Ball" ("_position" V)
###           ("_applC" ("_position" Use) ("_position" n'))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" state_val)
###               ("_cargs"
###                 ("_applC" ("_position" transfers)
###                   ("_cargs"
###                     ("_applC" ("_position" slice_kinds)
###                       ("_cargs" ("_Finset" ("_position" n'))
###                         ("_position" as)))
###                     ("_position" s)))
###                 ("_position" V)))
###             ("_applC" ("_position" state_val)
###               ("_cargs" ("_position" s') ("_position" V)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" n'))
###     ("\<^const>HOL.conj"
###       ("\<^fixed>identifies"
###         ("\<^const>local.path" ("_position" n) ("_position" as)
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_Finset" ("_position" n'))
###                       ("_position" as)))
###                   ("_position" s)))
###               ("_position" n'))))
###         ("_position" c'))
###       ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" state_val)
###             ("_cargs"
###               ("_applC" ("_position" transfers)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_Finset" ("_position" n'))
###                       ("_position" as)))
###                   ("_position" s)))
###               ("_position" V)))
###           ("_applC" ("_position" state_val)
###             ("_cargs" ("_position" s') ("_position" V))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10755name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26147name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8892name=byelapsed=0.016
### Ambiguous input (line 707 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83666name=showelapsed=0.047
### Ambiguous input (line 707 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>HOL.not_equal" ("_Numeral" ("_constify" ("_position" 2)))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10755name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9056name=byelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8404name=henceelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26275name=showelapsed=0.018
### Ambiguous input (line 711 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10836name=haveelapsed=0.018
### Ambiguous input (line 313 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c')
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" et')
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=9342name=byelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8467name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26430name=showelapsed=0.018
### Ambiguous input (line 715 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10966name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8520name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26592name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=907name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11081name=showelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8601name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26704name=noteelapsed=0.010
### Ambiguous input (line 721 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 722 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("_position" n\<^sub>2))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" n\<^sub>2)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1005name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8651name=henceelapsed=0.017
### Ambiguous input (line 722 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n')
###     ("\<^const>HOL.not_equal" ("_Numeral" ("_constify" ("_position" 2)))
###       ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26852name=fromelapsed=0.011
### Ambiguous input (line 723 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n)
###       ("_position" et\<^sub>2) ("_position" nx))
###     ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" nx)
###       ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n)
###       ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" nx) ("_position" n')))
###     ("_position" nx)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3137name=henceelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8717name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1103name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26975name=obtainelapsed=0.019
ML_statistics = :now=1464804839.39tasks_ready=1932tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=9size_allocation=3621781504size_allocation_free=3621781504size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=3623477912threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=69.912time_GC=3.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8770name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26975name=obtainelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3231name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1103name=obtainelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27298name=showelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8874name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3231name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1290name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27362name=noteelapsed=0.010
### Ambiguous input (line 734 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n\<^sub>2)
###       ("_position" et\<^sub>2) ("_position" n\<^sub>2'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###     ("_position" n\<^sub>2')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12840name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3362name=obtainelapsed=0.017
### Ambiguous input (line 735 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr" ("_position" n)
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("_position" n\<^sub>2))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" n\<^sub>2)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1290name=obtainelapsed=0.017
### Ambiguous input (line 736 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n)
###       ("_position" et\<^sub>2) ("_position" nx))
###     ("\<^const>HOL.not_equal" ("\<^const>WCFG.w_node.Exit")
###       ("_position" nx))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("_position" nx)
###       ("\<^const>HOL.not_equal" ("\<^const>WCFG.w_node.Exit")
###         ("_position" nx)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>WCFG.While_CFG" ("_position" c') ("_position" n)
###       ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("_position" nx) ("\<^const>WCFG.w_node.Exit")))
###     ("_position" nx)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12938name=thuselapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3362name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27628name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1553name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3507name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=13081name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27628name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1553name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27914name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1723name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3588name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=13357name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1723name=obtainelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19053name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3722name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19121name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1942name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=13510name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3769name=withelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19181name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2000name=henceelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=20608name=byelapsed=0.014
### Ambiguous input (line 55 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" ax)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19209name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2174name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14173name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2347name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15940name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14271name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2459name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16034name=obtainelapsed=0.016
### Ambiguous input (line 62 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" ax)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 64 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" sourcenode)
###     ("\<^const>local.standard_control_dependence" ("_position" a)
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.standard_control_dependence"
###     ("_applC" ("_position" sourcenode) ("_position" a)) ("_position" n)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16034name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2661name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14385name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16165name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14385name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2776name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16165name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2927name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14590name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16310name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14590name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21594name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16391name=haveelapsed=0.020
### Ambiguous input (line 88 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 63 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("_applC" ("_position" targetnode) ("_position" a))))
###           ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" valid_edge) ("_position" a))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as''))))
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_applC" ("_position" sourcenode) ("_position" a)))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" a))
###             ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))))))
###           ("_Finset" ("_position" nx)))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" m)
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" m)))
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("\<^const>Set.empty")))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" sourcenode) ("_position" a))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" nx)))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" sourcenode) ("_position" a))
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" nx)))))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'') ("_position" nx))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S)))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("_applC" ("_position" valid_edge) ("_position" a))))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as''))))
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as'')))))))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s")
###                     ("_position" S)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("_position" as))))
###                 ("\<^const>List.append" ("_position" as')
###                   ("\<^const>List.list.Cons" ("_position" a)
###                     ("_position" as''))))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s")
###                     ("_position" S)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>List.append"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("_position" as')))))
###                 ("\<^const>List.list.Cons" ("_position" a)
###                   ("_position" as'')))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s")
###                     ("_position" S)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14888name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25881name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25979name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16525name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15000name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=3926name=haveelapsed=0.207
### Introduced fixed type variable(s): 'a, 'b in "as''__" or "as'__"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16572name=withelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=26120name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15156name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7355name=obtainelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15156name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=26396name=thuselapsed=0.019
### Ambiguous input (line 346 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.weak_control_dependence"
###     ("_applC" ("_position" sourcenode) ("_position" a)) ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" sourcenode)
###     ("\<^const>local.weak_control_dependence" ("_position" a)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7355name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15460name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=26549name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7587name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=21977name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15580name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7911name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=26944name=henceelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15730name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8058name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34493name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27032name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8129name=obtainelapsed=0.022
ML_statistics = :now=1464804839.89tasks_ready=1976tasks_pending=0tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=9size_allocation=3621781504size_allocation_free=2506695672size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=3623477912threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=73.044time_GC=3.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34603name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8129name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27032name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34729name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8252name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27154name=obtainelapsed=0.019
### Ambiguous input (line 371 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 63 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("_applC" ("_position" targetnode) ("_position" a))))
###           ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" valid_edge) ("_position" a))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as''))))
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_applC" ("_position" sourcenode) ("_position" a)))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" a))
###             ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))))))
###           ("_Finset" ("_position" nx)))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" m)
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" m)))
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("\<^const>Set.empty")))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" sourcenode) ("_position" a))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" nx)))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" sourcenode) ("_position" a))
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" nx)))))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'') ("_position" nx))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S)))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("_applC" ("_position" valid_edge) ("_position" a))))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as''))))
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as'')))))))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w")
###                     ("_position" S)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("_position" as))))
###                 ("\<^const>List.append" ("_position" as')
###                   ("\<^const>List.list.Cons" ("_position" a)
###                     ("_position" as''))))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w")
###                     ("_position" S)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>List.append"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("_position" as')))))
###                 ("\<^const>List.list.Cons" ("_position" a)
###                   ("_position" as'')))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w")
###                     ("_position" S)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###               ("\<^const>Set.empty"))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27154name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8350name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34922name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=16729name=haveelapsed=0.208
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27293name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8410name=showelapsed=0.013
### Introduced fixed type variable(s): 'a, 'b in "as''__" or "as'__"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=35112name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27371name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5176name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20158name=obtainelapsed=0.027
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=5781name=byelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=23763name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27497name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2307name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20158name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27544name=withelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2808name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=2987name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20390name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=3819name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4420name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20714name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=4964name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=5202name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20861name=haveelapsed=0.024
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8493name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20932name=obtainelapsed=0.022
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8759name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20932name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8683name=byelapsed=0.052
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8857name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21055name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8897name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1044name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8957name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21153name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1095name=thuselapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8981name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21213name=showelapsed=0.017
### Ambiguous input (line 613 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 63 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("_applC" ("_position" targetnode) ("_position" a))))
###           ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" valid_edge) ("_position" a))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as''))))
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" ?WOD_BS)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_position" ?WOD_BS)))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_applC" ("_position" sourcenode) ("_position" a)))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" a))
###             ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" ?WOD_BS)))))))
###           ("_Finset" ("_position" nx)))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" m)
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" m)))
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_position" ?WOD_BS)))
###                 ("\<^const>Set.empty")))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" sourcenode) ("_position" a))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_position" ?WOD_BS)))))))
###             ("_Finset" ("_position" nx)))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" sourcenode) ("_position" a))
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" a))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_position" ?WOD_BS)))))))
###             ("_Finset" ("_position" nx)))))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'') ("_position" nx))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" ?WOD_BS))))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("_applC" ("_position" valid_edge) ("_position" a))))
###               ("\<^const>HOL.conj"
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as''))))
###                 ("_applC" ("_position" obs)
###                   ("_cargs"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" ?WOD_BS)))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as'')))))))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" ?WOD_BS))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("_position" as))))
###                 ("\<^const>List.append" ("_position" as')
###                   ("\<^const>List.list.Cons" ("_position" a)
###                     ("_position" as''))))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" ?WOD_BS))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder"
###     ("_idts" ("_position" a) ("_idts" ("_position" as') ("_position" as'')))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>List.append"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" nx)
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("_position" as')))))
###                 ("\<^const>List.list.Cons" ("_position" a)
###                   ("_position" as'')))
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" ?WOD_BS))))))
###         ("_Finset" ("_position" nx)))
###       ("\<^const>HOL.Not"
###         ("\<^const>HOL.Ex_binder" ("_position" m)
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("_Finset" ("_position" m)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" obs)
###                 ("_cargs"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" ?WOD_BS)))
###               ("\<^const>Set.empty"))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1136name=henceelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9093name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9167name=ultimatelyelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6776name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27689name=haveelapsed=0.202
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1196name=thuselapsed=0.013
### Introduced fixed type variable(s): 'a, 'b in "as''__" or "as'__"
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6844name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9178name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31075name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6910name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1529name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7683name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31075name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=6982name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7751name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31304name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1771name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7086name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7817name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1771name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31624name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2770name=proofelapsed=0.010
### Ambiguous input (line 84 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V')
###     ("_applC" ("_position" lhs)
###       ("\<^const>Com.cmd.LAss" ("_position" V') ("_position" e)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V')
###     ("_Update" ("_position" lhs)
###       ("_updbind" ("_position" V') ("_position" e)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7887name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1947name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31768name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=7987name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2827name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2042name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31838name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7481name=proofelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2925name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2126name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31838name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7537name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3002name=showelapsed=0.016
ML_statistics = :now=1464804840.39tasks_ready=1970tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=9size_allocation=3621781504size_allocation_free=1874674304size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=3623477912threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=74.64time_GC=3.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2221name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31957name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7685name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3120name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31957name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=2323name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3598name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7731name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12469name=proofelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3709name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32145name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4187name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12648name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32145name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12786name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4300name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32291name=obtainelapsed=0.018
### Ambiguous input (line 209 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 43 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" transfer)
###     ("_cargs"
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_cargs" ("_position" s) ("_position" V))))
###             ("_applC" ("_position" transfer)
###               ("_cargs"
###                 ("\<^const>BasicDefs.edge_kind.Update"
###                   ("_lambda" ("_position" s)
###                     ("_Update" ("_position" s)
###                       ("_updbind" ("_position" V)
###                         ("_applC" ("_position" interpret)
###                           ("_cargs" ("_position" e) ("_position" s)))))))
###                 ("_position" s'))))))
###       ("_position" V))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" transfer)
###     ("_cargs"
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_cargs" ("_position" s) ("_position" V))))
###             ("_position" transfer))))
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s')))))
###         ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s)))))
###         ("_position" V)))
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s')))))
###         ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("\<^const>Com.cmd.LAss" ("_position" V)
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" e) ("_position" s)))))))
###         ("_cargs" ("_position" s) ("_position" V))))
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s')))))
###         ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s) ("_position" s)))
###         ("_cargs"
###           ("\<^const>Com.cmd.LAss" ("_position" V)
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" e) ("_position" s))))
###           ("_cargs" ("_position" s) ("_position" V)))))
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s')))))
###         ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transfer)
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("_applC" ("_position" s)
###             ("_cargs"
###               ("\<^const>Com.cmd.LAss" ("_position" V)
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" e) ("_position" s))))
###               ("_cargs" ("_position" s) ("_position" V)))))))
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s')))))
###         ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" transfer)
###     ("\<^const>BasicDefs.edge_kind.Update"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" s)
###             ("_cargs"
###               ("\<^const>Com.cmd.LAss" ("_position" V)
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" e) ("_position" s))))
###               ("_cargs" ("_position" s) ("_position" V))))
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("\<^const>BasicDefs.edge_kind.Update"
###                 ("_lambda" ("_position" s)
###                   ("_applC" ("_position" s)
###                     ("_cargs"
###                       ("\<^const>Com.cmd.LAss" ("_position" V)
###                         ("_applC" ("_position" interpret)
###                           ("_cargs" ("_position" e) ("_position" s))))
###                       ("_position" s')))))
###               ("_position" V))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_Update" ("_position" s)
###               ("_updbind" ("_position" V)
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" e) ("_position" s)))))))
###         ("_cargs" ("_position" s) ("_position" V))))
###     ("_applC" ("_position" transfer)
###       ("_cargs"
###         ("\<^const>BasicDefs.edge_kind.Update"
###           ("_lambda" ("_position" s)
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_position" s')))))
###         ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" transfer)
###     ("_cargs"
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_cargs" ("_position" s) ("_position" V))))
###             ("_applC" ("_position" transfer)
###               ("\<^const>BasicDefs.edge_kind.Update"
###                 ("_lambda" ("_position" s)
###                   ("_applC" ("_position" s)
###                     ("_cargs"
###                       ("\<^const>Com.cmd.LAss" ("_position" V)
###                         ("_applC" ("_position" interpret)
###                           ("_cargs" ("_position" e) ("_position" s))))
###                       ("_position" s')))))))))
###       ("_position" V))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" transfer)
###     ("_cargs"
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" s)
###               ("_cargs"
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s))))
###                 ("_cargs" ("_position" s) ("_position" V))))
###             ("_applC" ("_position" transfer)
###               ("_cargs"
###                 ("\<^const>BasicDefs.edge_kind.Update"
###                   ("_lambda" ("_position" s) ("_position" s)))
###                 ("_cargs"
###                   ("\<^const>Com.cmd.LAss" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s))))
###                   ("_position" s')))))))
###       ("_position" V))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4729name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32291name=obtainelapsed=0.018
### Ambiguous input (line 711 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" asx')
###     ("\<^const>local.path"
###       ("_applC" ("_position" targetnode) ("_position" a)) ("_position" asx')
###       ("\<^const>HOL.implies" ("_position" m)
###         ("\<^const>Set.member" ("_position" nx)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" asx'))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" asx')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" a))
###         ("_position" asx') ("_position" m))
###       ("\<^const>Set.member" ("_position" nx)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" asx')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" asx')
###     ("\<^const>Set.member"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" a))
###         ("_position" asx')
###         ("\<^const>HOL.implies" ("_position" m) ("_position" nx)))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" asx'))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12951name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7818name=haveelapsed=0.099
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32364name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4843name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13089name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8502name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33847name=withelapsed=0.011
### Ambiguous input (line 741 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" sourcenode)
###     ("\<^const>local.weak_order_dependence" ("_position" a) ("_position" nx)
###       ("_position" m))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.weak_order_dependence"
###     ("_applC" ("_position" sourcenode) ("_position" a)) ("_position" nx)
###     ("_position" m)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5297name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34017name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13268name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8704name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5411name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13364name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34157name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5931name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8830name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34258name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6040name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8914name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13475name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6595name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13622name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8757name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9260name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8828name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13622name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6705name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9386name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG.thyoffset=8904name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7260name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13717name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9476name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13758name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17478name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7273name=qedelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17478name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13850name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9834name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17570name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13925name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=572name=proofelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9922name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13989name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17662name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=732name=showelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10019name=showelapsed=0.014
### Ambiguous input (line 29 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog) ("_position" c\<^sub>2))
###     ("_position" n'') ("_position" as)
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog)
###     ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###       ("_position" n'') ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14106name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17870name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1026name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10343name=haveelapsed=0.019
### Ambiguous input (line 33 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog) ("_position" c\<^sub>2))
###     ("_position" n) ("_applC" ("_position" kind) ("_position" a))
###     ("_position" n'')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14255name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17870name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1134name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10431name=haveelapsed=0.019
### Ambiguous input (line 34 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog) ("_position" c\<^sub>2))
###     ("_position" n) ("_applC" ("_position" kind) ("_position" a))
###     ("_position" n'')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2) ("_position" n)
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14255name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17962name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10515name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1289name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14353name=haveelapsed=0.019
### Ambiguous input (line 275 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("_position" Uses)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>HOL.eq" ("_applC" ("_position" s) ("_position" V))
###       ("_applC" ("_position" s') ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("_position" Uses)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))))
###     ("\<^const>HOL.eq" ("_applC" ("_position" s) ("_position" V))
###       ("_applC" ("_position" s') ("_position" V)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18073name=showelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=2922name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14394name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10908name=haveelapsed=0.021
### Ambiguous input (line 44 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.not_equal" ("_position" n'')
###         ("\<^const>WCFG.w_node.Entry")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###         ("\<^const>WCFG.label_incr" ("_position" n'')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n'))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.not_equal" ("_position" n'')
###         ("\<^const>WCFG.w_node.Entry")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.not_equal" ("_position" n'')
###         ("\<^const>WCFG.w_node.Entry")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n'')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.not_equal" ("_position" n'')
###         ("\<^const>WCFG.w_node.Entry")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr" ("_position" n'')
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("_position" n')))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.not_equal" ("_position" n'')
###         ("\<^const>WCFG.w_node.Entry")))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.not_equal" ("_position" as)
###           ("\<^const>List.list.Nil")))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr" ("_position" n'')
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("_position" n'))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804840.9tasks_ready=2022tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=9size_allocation=3621781504size_allocation_free=1443811664size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=3623477912threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=76.236time_GC=3.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1569name=noteelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18377name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14486name=haveelapsed=0.020
### Ambiguous input (line 47 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11064name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18377name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14561name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1751name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18469name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11148name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14625name=thuselapsed=0.020
### Ambiguous input (line 50 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a)))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a)))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("_position" n)
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_list" ("_position" a)))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("_list" ("_position" a))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("_list" ("_position" a)))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18598name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11517name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1917name=haveelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14817name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18811name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2023name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11645name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3143name=proofelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14917name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11705name=thuselapsed=0.021
### Ambiguous input (line 368 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("_position" Uses)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>HOL.eq" ("_applC" ("_position" s) ("_position" V))
###       ("_applC" ("_position" s') ("_position" V)))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("_position" Uses)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))))
###     ("\<^const>HOL.eq" ("_applC" ("_position" s) ("_position" V))
###       ("_applC" ("_position" s') ("_position" V)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3338name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/Basic/CFGExit.thyoffset=3062name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15111name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12014name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3701name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5656name=proofelapsed=0.012
### Ambiguous input (line 94 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###             ("_position" c\<^sub>2))
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.one_class.one"))
###           ("_position" n'))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.one_class.one"))
###           ("\<^const>WCFG.label_incr" ("_position" n')
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###           ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("\<^const>Groups.one_class.one"))
###             ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###               ("\<^const>Groups.one_class.one"))
###             ("_position" n')))
###         ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15279name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3816name=noteelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12142name=haveelapsed=0.024
### Ambiguous input (line 138 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" CFG.valid_node)
###     ("_cargs" ("_position" sourcenode)
###       ("_cargs" ("_position" targetnode)
###         ("_cargs"
###           ("_applC" ("_position" valid_edge)
###             ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###               ("_position" prog)))
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one"))))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" CFG.valid_node)
###     ("_cargs" ("_position" sourcenode)
###       ("_cargs" ("_position" targetnode)
###         ("_cargs"
###           ("_applC" ("_position" valid_edge)
###             ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###               ("_position" prog)))
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one")))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 97 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5851name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12202name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15378name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3982name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6216name=thuselapsed=0.019
### Ambiguous input (line 100 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Groups.one_class.one"))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15506name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4173name=haveelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15506name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4277name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15601name=haveelapsed=0.020
### Ambiguous input (line 148 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###             ("_position" prog))
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_position" n'))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("\<^const>WCFG.label_incr" ("_position" n')
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one"))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("\<^const>WCFG.label_incr" ("_position" n')
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one"))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("\<^const>WCFG.label_incr" ("_position" n')
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one"))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>WCFG.label_incr" ("_position" n')
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("\<^const>WCFG.label_incr" ("_position" n')
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one"))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog)
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one")))
###             ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one")))
###             ("_position" n')))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6327name=noteelapsed=0.052
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15642name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8662name=proofelapsed=0.024
### Ambiguous input (line 151 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15720name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6566name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8864name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15795name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9285name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15859name=thuselapsed=0.019
### Ambiguous input (line 210 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>Com.cmd.While" ("_position" b)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog)
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_Numeral" ("_constify" ("_position" 2))))
###             ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###               ("_Numeral" ("_constify" ("_position" 2))))
###             ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Com.cmd.While" ("_position" b)
###         ("\<^const>AdditionalLemmas.path" ("_position" prog)
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l'))
###             ("_Numeral" ("_constify" ("_position" 2)))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.eq" ("_position" n'')
###         ("\<^const>WCFG.w_node.Node" ("_position" l))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>WCFG.w_node.Node" ("_position" l')))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 154 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 20 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9393name=noteelapsed=0.014
### Ambiguous input (line 213 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###         ("_list" ("_position" a))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###         ("_list" ("_position" a)))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_list" ("_position" a)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15965name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6777name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6901name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9558name=haveelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16093name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9662name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16093name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10792name=proofelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12321name=qedelapsed=0.236
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10855name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16190name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=11842name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16231name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31256name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30406name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10885name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30574name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10948name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31424name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16309name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31535name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11079name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30685name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16384name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31649name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16448name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11152name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30887name=showelapsed=0.017
ML_statistics = :now=1464804841.4tasks_ready=2072tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=9size_allocation=3621781504size_allocation_free=995651048size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=3623477912threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=4threads_wait_signal=1time_CPU=77.836time_GC=3.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30960name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11375name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31722name=haveelapsed=0.018
### Ambiguous input (line 257 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.cmd.LAss"
###       ("\<^const>Com.num_inner_nodes" ("_position" V)) ("_position" e))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16626name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11442name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31923name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31073name=thuselapsed=0.017
### Ambiguous input (line 679 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("_position" n'))))
###     ("_applC" ("_position" insert)
###       ("_cargs" ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>Set.image"
###           ("_lambda" ("_position" l')
###             ("\<^const>WCFG.w_node.Node" ("_position" l')))
###           ("_Coll" ("_position" l)
###             ("\<^const>HOL.Ex_binder" ("_position" c)
###               ("_applC" ("_position" labels)
###                 ("_cargs" ("_position" prog)
###                   ("_cargs" ("_position" l) ("_position" c)))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###         ("_position" n) ("_position" et) ("_position" n')))
###     ("_applC" ("_position" insert)
###       ("_cargs" ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>Set.image"
###           ("_lambda" ("_position" l')
###             ("\<^const>WCFG.w_node.Node" ("_position" l')))
###           ("_Coll" ("_position" l)
###             ("\<^const>HOL.Ex_binder" ("_position" c)
###               ("_applC" ("_position" labels)
###                 ("_cargs" ("_position" prog)
###                   ("_cargs" ("_position" l) ("_position" c)))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32389name=haveelapsed=0.010
### Ambiguous input (line 684 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###         ("_position" n) ("_position" et) ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16766name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11473name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32155name=haveelapsed=0.019
### Ambiguous input (line 289 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32625name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13102name=noteelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32263name=ultimatelyelapsed=0.018
### Ambiguous input (line 686 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_Coll" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("_position" n'))))
###     ("_applC" ("_position" insert)
###       ("_cargs" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Set.image"
###           ("_lambda" ("_position" l')
###             ("\<^const>WCFG.w_node.Node" ("_position" l')))
###           ("_Coll" ("_position" l)
###             ("\<^const>HOL.Ex_binder" ("_position" c)
###               ("_applC" ("_position" labels)
###                 ("_cargs" ("_position" prog)
###                   ("_cargs" ("_position" l) ("_position" c)))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.subset_eq"
###     ("_Coll" ("_position" n')
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog))
###         ("_position" n) ("_position" et) ("_position" n')))
###     ("_applC" ("_position" insert)
###       ("_cargs" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Set.image"
###           ("_lambda" ("_position" l')
###             ("\<^const>WCFG.w_node.Node" ("_position" l')))
###           ("_Coll" ("_position" l)
###             ("\<^const>HOL.Ex_binder" ("_position" c)
###               ("_applC" ("_position" labels)
###                 ("_cargs" ("_position" prog)
###                   ("_cargs" ("_position" l) ("_position" c)))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 291 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16939name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13216name=noteelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32274name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32733name=haveelapsed=0.025
### Ambiguous input (line 691 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n')
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog))
###         ("_position" n) ("_position" et) ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13330name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17079name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32968name=henceelapsed=0.024
### Ambiguous input (line 406 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19534name=noteelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17092name=qedelapsed=0.027
### Ambiguous input (line 408 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19648name=noteelapsed=0.015
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12032name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19762name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=33766name=thuselapsed=0.020
### Ambiguous input (line 693 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>HOL.conj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###             ("_position" et) ("_position" nx'))
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n'))))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###           ("_position" et)
###           ("\<^const>HOL.conj" ("_position" nx')
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n'))))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" nx)
###             ("_idts" ("_position" et) ("_position" nx')))
###           ("_position" prog))
###         ("_position" nx) ("_position" et)
###         ("\<^const>HOL.conj" ("_position" nx')
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n'))))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" nx)
###               ("_idts" ("_position" et) ("_position" nx')))
###             ("_position" prog))
###           ("_position" nx) ("_position" et) ("_position" nx'))
###         ("\<^const>HOL.disj"
###           ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###           ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n'))))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>HOL.conj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###             ("_position" et) ("_position" nx'))
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###           ("_position" n) ("_position" et) ("_position" n')))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###           ("_position" et)
###           ("\<^const>HOL.conj" ("_position" nx')
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###           ("_position" n) ("_position" et) ("_position" n')))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" nx)
###             ("_idts" ("_position" et) ("_position" nx')))
###           ("_position" prog))
###         ("_position" nx) ("_position" et)
###         ("\<^const>HOL.conj" ("_position" nx')
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###           ("_position" n) ("_position" et) ("_position" n')))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" nx)
###               ("_idts" ("_position" et) ("_position" nx')))
###             ("_position" prog))
###           ("_position" nx) ("_position" et) ("_position" nx'))
###         ("\<^const>HOL.disj"
###           ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###           ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###           ("_position" n) ("_position" et) ("_position" n')))
###       ("_Coll" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>HOL.conj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###             ("_position" et) ("_position" nx'))
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n'))))
###       ("_Coll" ("_position" n')
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog))
###           ("_position" n) ("_position" et) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###           ("_position" et)
###           ("\<^const>HOL.conj" ("_position" nx')
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))))
###     ("\<^const>Set.union"
###       ("_Coll" ("_position" n)
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et))
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###             ("_position" et) ("_position" n'))))
###       ("_Coll" ("_position" n')
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" n) ("_position" et)) ("_position" prog))
###           ("_position" n) ("_position" et) ("_position" n'))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12109name=showelapsed=0.019
### Ambiguous input (line 509 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog'))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog'))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog')
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog'))
###           ("\<^const>WCFG.w_node.Entry") ("_position" as)
###           ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>AdditionalLemmas.path"
###           ("\<^const>HOL.Ex_binder" ("_position" as) ("_position" prog'))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###           ("\<^const>WCFG.w_node.Exit"))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog')
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### ("\<^const>Pure.all_binder" ("_position" l)
###   ("\<^const>Pure.imp"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog'))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog')
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" as)
###             ("\<^const>WCFG.w_node.Exit")))
###         ("\<^const>HOL.Ex_binder" ("_position" as)
###           ("\<^const>AdditionalLemmas.path" ("_position" prog')
###             ("\<^const>WCFG.w_node.Entry") ("_position" as)
###             ("\<^const>WCFG.w_node.Node" ("_position" l))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24704name=noteelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/CFG_wf.thyoffset=2248name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=33076name=haveelapsed=0.068
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12208name=nextelapsed=0.016
### Ambiguous input (line 695 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n') ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" n') ("_position" et)) ("_position" prog))
###         ("_position" n) ("_position" et) ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 695 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n')
###       ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" n)
###           ("_position" et) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n')
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder" ("_idts" ("_position" n) ("_position" et))
###           ("_position" prog))
###         ("_position" n) ("_position" et) ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=33220name=withelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24818name=showelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=14737name=applyelapsed=0.011
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12249name=showelapsed=0.019
### Ambiguous input (line 696 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>HOL.conj"
###           ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###             ("_position" et) ("_position" nx'))
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" nx)
###           ("_idts" ("_position" et) ("_position" nx')))
###         ("\<^const>WCFG.While_CFG" ("_position" prog) ("_position" nx)
###           ("_position" et)
###           ("\<^const>HOL.conj" ("_position" nx')
###             ("\<^const>HOL.disj"
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###               ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.Ex_binder"
###           ("_idts" ("_position" nx)
###             ("_idts" ("_position" et) ("_position" nx')))
###           ("_position" prog))
###         ("_position" nx) ("_position" et)
###         ("\<^const>HOL.conj" ("_position" nx')
###           ("\<^const>HOL.disj"
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###             ("\<^const>HOL.eq" ("_position" n) ("_position" nx'))))))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" finite)
###     ("_Coll" ("_position" n)
###       ("\<^const>HOL.conj"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.Ex_binder"
###             ("_idts" ("_position" nx)
###               ("_idts" ("_position" et) ("_position" nx')))
###             ("_position" prog))
###           ("_position" nx) ("_position" et) ("_position" nx'))
###         ("\<^const>HOL.disj"
###           ("\<^const>HOL.eq" ("_position" n) ("_position" nx))
###           ("\<^const>HOL.eq" ("_position" n) ("_position" nx')))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=33305name=haveelapsed=0.025
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12309name=nextelapsed=0.017
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=15944name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3209name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12333name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=33395name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1220name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3431name=byelapsed=0.012
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12447name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2369name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1494name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12521name=ultimatelyelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=1354name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2427name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12532name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=3593name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2539name=haveelapsed=0.020
### Ambiguous input (line 163 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 9 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("_applC"
###               ("\<^const>local.postdominate"
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_position" n')))
###                 ("_position" targetnode))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("_applC"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("\<^const>local.postdominate" ("_position" n')
###                     ("_position" targetnode))))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("_position" sourcenode))
###                 ("_position" a)))
###             ("_applC"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_position" targetnode))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_applC" ("_position" sourcenode) ("_position" a))))
###             ("_applC"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_position" targetnode))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.postdominate" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("_applC"
###                   ("\<^const>local.postdominate" ("_position" n')
###                     ("_position" targetnode))
###                   ("_position" a))))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("_position" sourcenode))
###                 ("_position" a)))
###             ("\<^const>local.postdominate" ("_position" n')
###               ("_applC" ("_position" targetnode) ("_position" a)))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("_applC" ("_position" sourcenode) ("_position" a))))
###             ("\<^const>local.postdominate" ("_position" n')
###               ("_applC" ("_position" targetnode) ("_position" a)))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.postdominate" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>local.postdominate" ("_position" n')
###                   ("_applC" ("_position" targetnode)
###                     ("_position" a)))))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.postdominate" ("_position" n') ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.postdominate"
###               ("\<^const>local.postdominate" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" n')))
###               ("_applC" ("_position" targetnode) ("_position" a)))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7592name=byelapsed=0.262
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2629name=haveelapsed=0.273
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6631name=noteelapsed=0.279
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4626name=byelapsed=0.271
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6819name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2710name=haveelapsed=0.019
### Ambiguous input (line 196 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.All_binder" ("_position" as'')
###       ("\<^const>Set.member"
###         ("\<^const>local.path" ("_position" n'') ("_position" as'')
###           ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n')))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.All_binder" ("_position" as'')
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n'') ("_position" as'')
###           ("\<^fixed>Exit"))
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.All_binder" ("_position" as'')
###       ("\<^const>local.path" ("_position" n'') ("_position" as'')
###         ("\<^const>HOL.implies" ("\<^fixed>Exit")
###           ("\<^const>Set.member" ("_position" n')
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as'')))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 72 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>local.path" ("_position" n) ("_position" as)
###       ("\<^const>HOL.implies" ("\<^fixed>Exit")
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^fixed>Exit"))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as)
###     ("\<^const>Set.member"
###       ("\<^const>local.path" ("_position" n) ("_position" as)
###         ("\<^const>HOL.implies" ("\<^fixed>Exit") ("_position" n)))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7875name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2757name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8800name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=4806name=byelapsed=0.048
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7875name=obtainelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2842name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8800name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8011name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2902name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8983name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8138name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2937name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5211name=thuselapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8983name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5228name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9214name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=18688name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=8267name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9275name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5281name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10111name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11426name=haveelapsed=0.013
### Ambiguous input (line 234 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" ax)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804842.14tasks_ready=2045tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=10size_allocation=3615490048size_allocation_free=3615490048size_heap=4159700992size_heap_free_last_full_GC=0size_heap_free_last_GC=3616646736threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=80.632time_GC=3.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5281name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9448name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10167name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11454name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9601name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5379name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10190name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11477name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5379name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11525name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10239name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5555name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10239name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11525name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5621name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11708name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10427name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=19906name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5700name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11754name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10473name=thuselapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21725name=byelapsed=0.013
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=22078name=byelapsed=0.012
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21147name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5787name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=23423name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5869name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/GraphSpec.thyoffset=5747name=byelapsed=0.063
### Ambiguous input (line 348 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 26 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>List.append"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>Orderings.ord_class.less"
###                 ("_applC" ("_position" length) ("_position" as'))
###                 ("_position" k))
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path" ("_position" n') ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n'') ("_position" as)))
###                 ("_position" as')))))
###         ("_position" as'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>List.append"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>Orderings.ord_class.less"
###                 ("_applC" ("_position" length) ("_position" as'))
###                 ("_position" k))
###               ("\<^const>HOL.conj"
###                 ("\<^const>local.path" ("_position" n') ("_position" as'')
###                   ("_position" n''))
###                 ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))))
###         ("_position" as'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>List.append"
###         ("\<^const>local.path"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("\<^const>Orderings.ord_class.less"
###                   ("_applC" ("_position" length) ("_position" as'))
###                   ("_position" k))
###                 ("_position" n'))))
###           ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" n'')
###             ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
###         ("_position" as'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>List.append"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>Orderings.ord_class.less"
###                 ("_applC" ("_position" length) ("_position" as'))
###                 ("_position" k))
###               ("\<^const>local.path" ("_position" n') ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n'')
###                   ("\<^const>HOL.eq" ("_position" as)
###                     ("_position" as')))))))
###         ("_position" as'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>Orderings.ord_class.less"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k))))
###         ("\<^const>List.append"
###           ("\<^const>local.path" ("_position" n') ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" n'')
###               ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
###           ("_position" as''))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("_position" n'))
###         ("\<^const>HOL.conj"
###           ("\<^const>Orderings.ord_class.less"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k))
###           ("\<^const>List.append"
###             ("\<^const>local.path" ("_position" n') ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" n'')
###                 ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
###             ("_position" as'')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>HOL.conj"
###             ("\<^const>Orderings.ord_class.less"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k))
###             ("\<^const>List.append"
###               ("\<^const>local.path" ("_position" n') ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n'')
###                   ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
###               ("_position" as''))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj" ("_position" n')
###               ("_applC" ("_position" length) ("_position" as'))))
###           ("_position" k))
###         ("\<^const>List.append"
###           ("\<^const>local.path" ("_position" n') ("_position" as'')
###             ("\<^const>HOL.conj" ("_position" n'')
###               ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
###           ("_position" as''))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>Orderings.ord_class.less"
###                 ("_applC" ("_position" length) ("_position" as'))
###                 ("_position" k))
###               ("\<^const>HOL.conj"
###                 ("\<^const>local.path" ("_position" n') ("_position" as'')
###                   ("_position" n''))
###                 ("_position" as)))))
###         ("\<^const>List.append" ("_position" as') ("_position" as''))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" as''))
###       ("\<^const>HOL.eq"
###         ("\<^const>local.path"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("\<^const>Orderings.ord_class.less"
###                   ("_applC" ("_position" length) ("_position" as'))
###                   ("_position" k))
###                 ("_position" n'))))
###           ("_position" as'')
###           ("\<^const>HOL.conj" ("_position" n'') ("_position" as)))
###         ("\<^const>List.append" ("_position" as') ("_position" as''))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13414name=assumeelapsed=0.039
### Ambiguous input (line 350 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 33 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>Orderings.ord_class.greater_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.conj" ("_position" n')
###           ("\<^const>local.path" ("_position" n') ("_position" as'')
###             ("\<^const>HOL.implies"
###               ("\<^const>HOL.conj" ("_position" n'')
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("_position" as''))))
###               ("_applC" ("_position" length) ("_position" as'))))))
###       ("_position" k))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path" ("_position" n') ("_position" as'')
###             ("\<^const>HOL.implies"
###               ("\<^const>HOL.conj" ("_position" n'')
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("_position" as''))))
###               ("_applC" ("_position" length) ("_position" as'))))
###           ("_position" k))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path" ("_position" n') ("_position" as'')
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" n'')
###               ("\<^const>HOL.eq" ("_position" as)
###                 ("\<^const>List.append" ("_position" as')
###                   ("_position" as''))))
###             ("_applC" ("_position" length) ("_position" as'))))
###         ("_position" k)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>Orderings.ord_class.greater_eq"
###       ("\<^const>local.path"
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n') ("_position" n')))
###         ("_position" as'')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" n'')
###             ("\<^const>HOL.eq" ("_position" as)
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as''))))
###           ("_applC" ("_position" length) ("_position" as'))))
###       ("_position" k))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>Orderings.ord_class.greater_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>local.path" ("_position" n') ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" n'')
###                 ("\<^const>HOL.eq" ("_position" as)
###                   ("\<^const>List.append" ("_position" as')
###                     ("_position" as''))))))
###           ("_applC" ("_position" length) ("_position" as'))))
###       ("_position" k))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>Orderings.ord_class.greater_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path" ("_position" n') ("_position" as'')
###                 ("_position" n''))
###               ("\<^const>HOL.eq" ("_position" as)
###                 ("\<^const>List.append" ("_position" as')
###                   ("_position" as'')))))
###           ("_applC" ("_position" length) ("_position" as'))))
###       ("_position" k))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>Orderings.ord_class.greater_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.eq"
###               ("\<^const>local.path" ("_position" n') ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n'') ("_position" as)))
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as''))))
###           ("_applC" ("_position" length) ("_position" as'))))
###       ("_position" k))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>Orderings.ord_class.greater_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>List.append"
###               ("\<^const>local.path" ("_position" n') ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n'')
###                   ("\<^const>HOL.eq" ("_position" as) ("_position" as'))))
###               ("_position" as'')))
###           ("_applC" ("_position" length) ("_position" as'))))
###       ("_position" k))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.conj" ("_position" n')
###         ("\<^const>local.path" ("_position" n') ("_position" as'')
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" n'')
###               ("\<^const>HOL.eq" ("_position" as)
###                 ("\<^const>List.append" ("_position" as')
###                   ("_position" as''))))
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_position" k))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as') ("_position" as''))
###     ("\<^const>HOL.conj"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>local.path" ("_position" n') ("_position" as'')
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" n'')
###             ("\<^const>HOL.eq" ("_position" as)
###               ("\<^const>List.append" ("_position" as')
###                 ("_position" as''))))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_position" k)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13531name=henceelapsed=0.065
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=872name=byelapsed=0.014
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=22833name=byelapsed=0.131
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13680name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=24933name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13750name=obtainelapsed=0.022
### Ambiguous input (line 443 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 9 parse trees:
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("_applC"
###               ("\<^const>local.strong_postdominate"
###                 ("\<^const>local.strong_postdominate" ("_position" n')
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" sourcenode) ("_position" a))
###                     ("_position" n')))
###                 ("_position" targetnode))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("_applC"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("\<^const>local.strong_postdominate" ("_position" n')
###                     ("_position" targetnode))))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.strong_postdominate" ("_position" n')
###                   ("_position" sourcenode))
###                 ("_position" a)))
###             ("_applC"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("_position" targetnode))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("_applC" ("_position" sourcenode) ("_position" a))))
###             ("_applC"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("_position" targetnode))
###               ("_position" a))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("_applC"
###                   ("\<^const>local.strong_postdominate" ("_position" n')
###                     ("_position" targetnode))
###                   ("_position" a))))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.strong_postdominate" ("_position" n')
###                   ("_position" sourcenode))
###                 ("_position" a)))
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("_applC" ("_position" targetnode) ("_position" a)))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.Not"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("_applC" ("_position" sourcenode) ("_position" a))))
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("_applC" ("_position" targetnode) ("_position" a)))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.strong_postdominate" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>local.strong_postdominate" ("_position" n')
###                   ("_applC" ("_position" targetnode)
###                     ("_position" a)))))))))))
### ("_bigimpl"
###   ("_asms"
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>local.strong_postdominate" ("_position" n')
###         ("_position" nx)))
###     ("_asm"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>HOL.Not"
###           ("\<^const>local.strong_postdominate" ("_position" n')
###             ("_position" n''))))))
###   ("\<^const>HOL.Trueprop"
###     ("\<^const>HOL.Ex_binder"
###       ("_idts" ("_position" as')
###         ("_idts" ("_position" a) ("_position" as'')))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq" ("_position" as)
###           ("\<^const>List.append" ("_position" as')
###             ("\<^const>List.list.Cons" ("_position" a) ("_position" as''))))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.strong_postdominate"
###               ("\<^const>local.strong_postdominate" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_position" n')))
###               ("_applC" ("_position" targetnode) ("_position" a)))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=17750name=noteelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13750name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynDataDependence.thyoffset=1496name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=17985name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16610name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13891name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16688name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19080name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13891name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=16889name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14096name=haveelapsed=0.020
### Ambiguous input (line 507 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" a'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" a')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14160name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20344name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=19445name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14295name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20344name=obtainelapsed=0.019
### Ambiguous input (line 581 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_position" a')
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a'))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" a'))
###             ("_applC" ("_position" sourcenode) ("_position" a)))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.strong_postdominate" ("_position" n)
###               ("_applC" ("_position" targetnode) ("_position" a')))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Ex_binder" ("_position" a')
###       ("\<^const>HOL.conj"
###         ("_applC" ("_position" valid_edge) ("_position" a'))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" a'))
###             ("_applC" ("_position" sourcenode) ("_position" a)))
###           ("\<^const>HOL.Not"
###             ("_applC"
###               ("\<^const>local.strong_postdominate" ("_position" n)
###                 ("_position" targetnode))
###               ("_position" a'))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20541name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14377name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=24062name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20629name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14434name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=24200name=letelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20681name=letelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14513name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=24327name=haveelapsed=0.022
ML_statistics = :now=1464804842.64tasks_ready=1994tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=10size_allocation=3615490048size_allocation_free=3013479864size_heap=4159700992size_heap_free_last_full_GC=0size_heap_free_last_GC=3616646736threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=82.236time_GC=3.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=21298name=byelapsed=0.387
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20800name=letelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26646name=showelapsed=0.018
### Ambiguous input (line 517 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>Set.image"
###   ("_lambda" ("_position" n')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("\<^const>local.path" ("_position" n') ("_position" as)
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("_applC" ("_position" length) ("_position" as))))
###               ("_position" i))
###             ("\<^const>Set.member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
###   ("_position" N))
### ("\<^const>Set.image"
###   ("_lambda" ("_position" n')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>local.path" ("_position" n') ("_position" as)
###             ("\<^const>HOL.implies"
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>Orderings.ord_class.greater_eq"
###                   ("_applC" ("_position" length) ("_position" as))
###                   ("_position" i)))
###               ("\<^const>Set.member" ("_position" n)
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes)
###                     ("_position" as))))))))))
###   ("_position" N))
### ("\<^const>Set.image"
###   ("_lambda" ("_position" n')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>local.path" ("_position" n') ("_position" as)
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>Orderings.ord_class.greater_eq"
###                   ("_applC" ("_position" length) ("_position" as))
###                   ("_position" i))))
###             ("\<^const>Set.member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
###   ("_position" N))
### ("\<^const>Set.image"
###   ("_lambda" ("_position" n')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path" ("_position" n') ("_position" as)
###                 ("_position" nx))
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" i)))
###             ("\<^const>Set.member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
###   ("_position" N))
### ("\<^const>Set.image"
###   ("_lambda" ("_position" n')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>Set.member"
###             ("\<^const>local.path" ("_position" n') ("_position" as)
###               ("\<^const>HOL.implies"
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>Orderings.ord_class.greater_eq"
###                     ("_applC" ("_position" length) ("_position" as))
###                     ("_position" i)))
###                 ("_position" n)))
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as))))))))
###   ("_position" N))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=24481name=obtainelapsed=0.022
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26755name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=839name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20951name=letelapsed=0.036
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26766name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=24481name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=24639name=thuselapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26814name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21098name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21098name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/DynWeakControlDependence.thyoffset=861name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1625name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1711name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21146name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=1776name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13873name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2002name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3868name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21241name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9417name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2077name=thuselapsed=0.017
### Ambiguous input (line 46 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 6 parse trees:
### ("\<^const>HOL.Ex_binder" ("_position" as')
###   ("\<^const>local.path" ("_position" n) ("_position" as')
###     ("\<^const>HOL.conj" ("_position" n')
###       ("\<^const>HOL.All_binder" ("_position" asx)
###         ("\<^const>HOL.implies"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("_position" n'))
###           ("\<^const>Orderings.ord_class.less_eq"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_applC" ("_position" length) ("_position" asx))))))))
### ("\<^const>HOL.Ex_binder" ("_position" as')
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("_position" n'))
###     ("\<^const>HOL.All_binder" ("_position" asx)
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("_position" n'))
###         ("\<^const>Orderings.ord_class.less_eq"
###           ("_applC" ("_position" length) ("_position" as'))
###           ("_applC" ("_position" length) ("_position" asx)))))))
### ("\<^const>HOL.Ex_binder" ("_position" as')
###   ("\<^const>local.path" ("_position" n) ("_position" as')
###     ("\<^const>HOL.conj" ("_position" n')
###       ("\<^const>HOL.All_binder" ("_position" asx)
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("\<^const>HOL.implies" ("_position" n')
###             ("\<^const>Orderings.ord_class.less_eq"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_applC" ("_position" length) ("_position" asx)))))))))
### ("\<^const>HOL.Ex_binder" ("_position" as')
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("_position" n'))
###     ("\<^const>HOL.All_binder" ("_position" asx)
###       ("\<^const>local.path" ("_position" n) ("_position" asx)
###         ("\<^const>HOL.implies" ("_position" n')
###           ("\<^const>Orderings.ord_class.less_eq"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_applC" ("_position" length) ("_position" asx))))))))
### ("\<^const>HOL.Ex_binder" ("_position" as')
###   ("\<^const>local.path" ("_position" n) ("_position" as')
###     ("\<^const>HOL.conj" ("_position" n')
###       ("\<^const>HOL.All_binder" ("_position" asx)
###         ("\<^const>Orderings.ord_class.less_eq"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("\<^const>HOL.implies" ("_position" n')
###               ("_applC" ("_position" length) ("_position" as'))))
###           ("_applC" ("_position" length) ("_position" asx)))))))
### ("\<^const>HOL.Ex_binder" ("_position" as')
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("_position" n'))
###     ("\<^const>HOL.All_binder" ("_position" asx)
###       ("\<^const>Orderings.ord_class.less_eq"
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("\<^const>HOL.implies" ("_position" n')
###             ("_applC" ("_position" length) ("_position" as'))))
###         ("_applC" ("_position" length) ("_position" asx))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=1756name=proofelapsed=0.012
### Ambiguous input (line 50 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 6 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.path" ("_position" n) ("_position" as')
###     ("\<^const>HOL.conj" ("_position" n')
###       ("\<^const>HOL.All_binder" ("_position" asx)
###         ("\<^const>HOL.implies"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("_position" n'))
###           ("\<^const>Orderings.ord_class.less_eq"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_applC" ("_position" length) ("_position" asx))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("_position" n'))
###     ("\<^const>HOL.All_binder" ("_position" asx)
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("_position" n'))
###         ("\<^const>Orderings.ord_class.less_eq"
###           ("_applC" ("_position" length) ("_position" as'))
###           ("_applC" ("_position" length) ("_position" asx)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.path" ("_position" n) ("_position" as')
###     ("\<^const>HOL.conj" ("_position" n')
###       ("\<^const>HOL.All_binder" ("_position" asx)
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("\<^const>HOL.implies" ("_position" n')
###             ("\<^const>Orderings.ord_class.less_eq"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_applC" ("_position" length) ("_position" asx)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("_position" n'))
###     ("\<^const>HOL.All_binder" ("_position" asx)
###       ("\<^const>local.path" ("_position" n) ("_position" asx)
###         ("\<^const>HOL.implies" ("_position" n')
###           ("\<^const>Orderings.ord_class.less_eq"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_applC" ("_position" length) ("_position" asx))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.path" ("_position" n) ("_position" as')
###     ("\<^const>HOL.conj" ("_position" n')
###       ("\<^const>HOL.All_binder" ("_position" asx)
###         ("\<^const>Orderings.ord_class.less_eq"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("\<^const>HOL.implies" ("_position" n')
###               ("_applC" ("_position" length) ("_position" as'))))
###           ("_applC" ("_position" length) ("_position" asx)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("_position" n'))
###     ("\<^const>HOL.All_binder" ("_position" asx)
###       ("\<^const>Orderings.ord_class.less_eq"
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("\<^const>HOL.implies" ("_position" n')
###             ("_applC" ("_position" length) ("_position" as'))))
###         ("_applC" ("_position" length) ("_position" asx))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2100name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9488name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21296name=henceelapsed=0.018
### Ambiguous input (line 58 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.postdominate" ("_position" n')
###       ("_position" targetnode))
###     ("_position" ax)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.postdominate" ("_position" n')
###     ("_applC" ("_position" targetnode) ("_position" ax))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2141name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=1882name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21383name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9512name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2237name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=1882name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21422name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9567name=showelapsed=0.014
### Ambiguous input (line 52 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" asx)
###     ("\<^const>Orderings.ord_class.less_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" asx)
###         ("\<^const>HOL.implies" ("_position" n')
###           ("_applC" ("_position" length) ("_position" as'))))
###       ("_applC" ("_position" length) ("_position" asx)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" asx)
###     ("\<^const>local.path" ("_position" n) ("_position" asx)
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>Orderings.ord_class.less_eq"
###           ("_applC" ("_position" length) ("_position" as'))
###           ("_applC" ("_position" length) ("_position" asx)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" asx)
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" asx)
###         ("_position" n'))
###       ("\<^const>Orderings.ord_class.less_eq"
###         ("_applC" ("_position" length) ("_position" as'))
###         ("_applC" ("_position" length) ("_position" asx))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2353name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=1988name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21449name=withelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=4045name=haveelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2084name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21467name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14252name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=4717name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2175name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21516name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=4756name=finallyelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21552name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14313name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2256name=showelapsed=0.014
### Ambiguous input (line 59 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 6 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_position" asx)
###           ("\<^const>HOL.conj"
###             ("\<^const>local.path" ("_position" n) ("_position" asx)
###               ("_position" n'))
###             ("\<^const>Orderings.ord_class.greater"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_applC" ("_position" length) ("_position" asx)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>HOL.Ex_binder" ("_position" asx)
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("_position" n'))
###           ("\<^const>Orderings.ord_class.greater"
###             ("_applC" ("_position" length) ("_position" as'))
###             ("_applC" ("_position" length) ("_position" asx))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_position" asx)
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("\<^const>HOL.conj" ("_position" n')
###               ("\<^const>Orderings.ord_class.greater"
###                 ("_applC" ("_position" length) ("_position" as'))
###                 ("_applC" ("_position" length) ("_position" asx))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>HOL.Ex_binder" ("_position" asx)
###         ("\<^const>local.path" ("_position" n) ("_position" asx)
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>Orderings.ord_class.greater"
###               ("_applC" ("_position" length) ("_position" as'))
###               ("_applC" ("_position" length) ("_position" asx)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>HOL.Ex_binder" ("_position" asx)
###           ("\<^const>Orderings.ord_class.greater"
###             ("\<^const>local.path" ("_position" n) ("_position" asx)
###               ("\<^const>HOL.conj" ("_position" n')
###                 ("_applC" ("_position" length) ("_position" as'))))
###             ("_applC" ("_position" length) ("_position" asx))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>HOL.Ex_binder" ("_position" asx)
###         ("\<^const>Orderings.ord_class.greater"
###           ("\<^const>local.path" ("_position" n) ("_position" asx)
###             ("\<^const>HOL.conj" ("_position" n')
###               ("_applC" ("_position" length) ("_position" as'))))
###           ("_applC" ("_position" length) ("_position" asx)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=4764name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14313name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=5419name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2304name=henceelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14477name=obtainelapsed=0.022
### Ambiguous input (line 367 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.All_binder" ("_idts" ("_position" a') ("_position" a''))
###   ("\<^const>HOL.implies"
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" a')
###         ("_applC" ("_position" set) ("_position" asx)))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" sourcenode) ("_position" a'))
###           ("_applC" ("_position" sourcenode) ("_position" a'')))
###         ("_applC" ("_position" valid_edge) ("_position" a''))))
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" a''))))
### ("\<^const>HOL.All_binder" ("_idts" ("_position" a') ("_position" a''))
###   ("\<^const>HOL.implies"
###     ("\<^const>HOL.conj"
###       ("\<^const>Set.member" ("_position" a')
###         ("_applC" ("_position" set) ("_position" asx)))
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" sourcenode) ("_position" a'))
###           ("_applC" ("_position" sourcenode) ("_position" a'')))
###         ("_applC" ("_position" valid_edge) ("_position" a''))))
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" a'')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=6540name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2405name=haveelapsed=0.018
### Ambiguous input (line 153 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###           ("_applC" ("_position" length) ("_position" as')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###         ("_applC" ("_position" length) ("_position" as'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>Orderings.ord_class.less_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.implies" ("_position" n') ("_position" x)))
###       ("_applC" ("_position" length) ("_position" as')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14477name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15763name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2462name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14682name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=6934name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15900name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14725name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2530name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=6934name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15949name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14809name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7069name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2530name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15304name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16062name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4679name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2712name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=533name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15342name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16062name=obtainelapsed=0.017
### Ambiguous input (line 378 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" sourcenode)
###     ("\<^const>local.dyn_standard_control_dependence" ("_position" a)
###       ("_position" n)
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" asx)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_standard_control_dependence"
###     ("_applC" ("_position" sourcenode) ("_position" a)) ("_position" n)
###     ("\<^const>List.list.Cons" ("_position" a) ("_position" asx))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("_applC" ("_position" sourcenode)
###       ("\<^const>local.dyn_standard_control_dependence" ("_position" a)
###         ("_position" n) ("_position" a)))
###     ("_position" asx)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_standard_control_dependence"
###       ("_applC" ("_position" sourcenode) ("_position" a)) ("_position" n)
###       ("_position" a))
###     ("_position" asx)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2752name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15342name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16231name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4936name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2752name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15418name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16351name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2849name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=4961name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16375name=nextelapsed=0.016
### Ambiguous input (line 383 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Bex" ("_position" a') ("_applC" ("_position" set) ("_position" asx))
###     ("\<^const>HOL.Ex_binder" ("_position" a'')
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" sourcenode) ("_position" a'))
###           ("_applC" ("_position" sourcenode) ("_position" a'')))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a''))
###           ("\<^const>HOL.Not"
###             ("_applC"
###               ("\<^const>local.postdominate" ("_position" n)
###                 ("_position" targetnode))
###               ("_position" a''))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Bex" ("_position" a') ("_applC" ("_position" set) ("_position" asx))
###     ("\<^const>HOL.Ex_binder" ("_position" a'')
###       ("\<^const>HOL.conj"
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" sourcenode) ("_position" a'))
###           ("_applC" ("_position" sourcenode) ("_position" a'')))
###         ("\<^const>HOL.conj"
###           ("_applC" ("_position" valid_edge) ("_position" a''))
###           ("\<^const>HOL.Not"
###             ("\<^const>local.postdominate" ("_position" n)
###               ("_applC" ("_position" targetnode) ("_position" a'')))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=990name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5030name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2892name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16399name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=990name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2945name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5122name=thuselapsed=0.016
### Ambiguous input (line 386 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>HOL.eq" ("_position" asx)
###       ("\<^const>List.append" ("_position" asx')
###         ("\<^const>List.list.Cons" ("_position" ax) ("_position" asx''))))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" a'')
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_applC" ("_position" sourcenode) ("_position" a'')))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a''))
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n)
###                 ("_applC" ("_position" targetnode) ("_position" a'')))))))
###       ("_Ball" ("_position" z)
###         ("_applC" ("_position" set) ("_position" asx''))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" a'')
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" sourcenode) ("_position" z))
###                 ("_applC" ("_position" sourcenode) ("_position" a'')))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a''))
###                 ("\<^const>HOL.Not"
###                   ("_applC"
###                     ("\<^const>local.postdominate" ("_position" n)
###                       ("_position" targetnode))
###                     ("_position" a'')))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>HOL.eq" ("_position" asx)
###       ("\<^const>List.append" ("_position" asx')
###         ("\<^const>List.list.Cons" ("_position" ax) ("_position" asx''))))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" a'')
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_applC" ("_position" sourcenode) ("_position" a'')))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a''))
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.postdominate" ("_position" n)
###                   ("_position" targetnode))
###                 ("_position" a''))))))
###       ("_Ball" ("_position" z)
###         ("_applC" ("_position" set) ("_position" asx''))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" a'')
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" sourcenode) ("_position" z))
###                 ("_applC" ("_position" sourcenode) ("_position" a'')))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a''))
###                 ("\<^const>HOL.Not"
###                   ("_applC"
###                     ("\<^const>local.postdominate" ("_position" n)
###                       ("_position" targetnode))
###                     ("_position" a'')))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>HOL.eq" ("_position" asx)
###       ("\<^const>List.append" ("_position" asx')
###         ("\<^const>List.list.Cons" ("_position" ax) ("_position" asx''))))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" a'')
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_applC" ("_position" sourcenode) ("_position" a'')))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a''))
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n)
###                 ("_applC" ("_position" targetnode) ("_position" a'')))))))
###       ("_Ball" ("_position" z)
###         ("_applC" ("_position" set) ("_position" asx''))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" a'')
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" sourcenode) ("_position" z))
###                 ("_applC" ("_position" sourcenode) ("_position" a'')))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a''))
###                 ("\<^const>HOL.Not"
###                   ("\<^const>local.postdominate" ("_position" n)
###                     ("_applC" ("_position" targetnode)
###                       ("_position" a''))))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>HOL.eq" ("_position" asx)
###       ("\<^const>List.append" ("_position" asx')
###         ("\<^const>List.list.Cons" ("_position" ax) ("_position" asx''))))
###     ("\<^const>HOL.conj"
###       ("\<^const>HOL.Ex_binder" ("_position" a'')
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_applC" ("_position" sourcenode) ("_position" a'')))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a''))
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.postdominate" ("_position" n)
###                   ("_position" targetnode))
###                 ("_position" a''))))))
###       ("_Ball" ("_position" z)
###         ("_applC" ("_position" set) ("_position" asx''))
###         ("\<^const>HOL.Not"
###           ("\<^const>HOL.Ex_binder" ("_position" a'')
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" sourcenode) ("_position" z))
###                 ("_applC" ("_position" sourcenode) ("_position" a'')))
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" valid_edge) ("_position" a''))
###                 ("\<^const>HOL.Not"
###                   ("\<^const>local.postdominate" ("_position" n)
###                     ("_applC" ("_position" targetnode)
###                       ("_position" a''))))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2968name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=1186name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=2625name=byelapsed=0.013
ML_statistics = :now=1464804843.14tasks_ready=2001tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=10size_allocation=3615490048size_allocation_free=2465144672size_heap=4159700992size_heap_free_last_full_GC=0size_heap_free_last_GC=3616646736threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=83.836time_GC=3.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16545name=obtainelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6470name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16545name=obtainelapsed=0.020
### Ambiguous input (line 395 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" a''))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" a'')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3144name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6495name=nextelapsed=0.015
### Ambiguous input (line 396 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" z) ("_applC" ("_position" set) ("_position" asx''))
###     ("\<^const>HOL.Not"
###       ("\<^const>HOL.Ex_binder" ("_position" a'')
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" z))
###             ("_applC" ("_position" sourcenode) ("_position" a'')))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a''))
###             ("\<^const>HOL.Not"
###               ("\<^const>local.postdominate" ("_position" n)
###                 ("_applC" ("_position" targetnode)
###                   ("_position" a''))))))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" z) ("_applC" ("_position" set) ("_position" asx''))
###     ("\<^const>HOL.Not"
###       ("\<^const>HOL.Ex_binder" ("_position" a'')
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" sourcenode) ("_position" z))
###             ("_applC" ("_position" sourcenode) ("_position" a'')))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" valid_edge) ("_position" a''))
###             ("\<^const>HOL.Not"
###               ("_applC"
###                 ("\<^const>local.postdominate" ("_position" n)
###                   ("_position" targetnode))
###                 ("_position" a'')))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1314name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6554name=henceelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3188name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16881name=obtainelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1369name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3240name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6619name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16881name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1392name=nextelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3304name=obtainelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6619name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1416name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=17228name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6800name=obtainelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3304name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1496name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=17335name=haveelapsed=0.014
### Ambiguous input (line 403 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" sourcenode)
###     ("\<^const>local.dyn_standard_control_dependence" ("_position" ax)
###       ("_position" n)
###       ("\<^const>List.list.Cons" ("_position" ax) ("_position" asx'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.dyn_standard_control_dependence"
###     ("_applC" ("_position" sourcenode) ("_position" ax)) ("_position" n)
###     ("\<^const>List.list.Cons" ("_position" ax) ("_position" asx''))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("_applC" ("_position" sourcenode)
###       ("\<^const>local.dyn_standard_control_dependence" ("_position" ax)
###         ("_position" n) ("_position" ax)))
###     ("_position" asx'')))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>List.list.Cons"
###     ("\<^const>local.dyn_standard_control_dependence"
###       ("_applC" ("_position" sourcenode) ("_position" ax)) ("_position" n)
###       ("_position" ax))
###     ("_position" asx'')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6800name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3489name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=17449name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1556name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7011name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3489name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=1635name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=17576name=thuselapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3686name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7092name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2239name=byelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=2093name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3799name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7130name=henceelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=5937name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2629name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3858name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7216name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=5998name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2671name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7338name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6028name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2693name=nextelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6811name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7514name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2763name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3728name=applyelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7602name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2763name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7710name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2870name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6856name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7799name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2870name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=4114name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2940name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=6703name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=2962name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7424name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3036name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7424name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3036name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7496name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3143name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10170name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3143name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=3213name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10213name=finallyelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10662name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=10221name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=4811name=byelapsed=0.292
ML_statistics = :now=1464804843.64tasks_ready=2005tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=10size_allocation=3615490048size_allocation_free=1584131976size_heap=4159700992size_heap_free_last_full_GC=0size_heap_free_last_GC=3616646736threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=87.036time_GC=3.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11506name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11583name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11695name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11064name=byelapsed=0.124
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11752name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=6274name=byelapsed=0.139
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11776name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=5546name=byelapsed=0.323
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=11828name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1563name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17322name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1168name=byelapsed=0.111
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1899name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=1402name=byelapsed=0.116
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17462name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2165name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17574name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16804name=byelapsed=0.114
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2165name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17598name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2869name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4833name=byelapsed=0.054
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2211name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17649name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2916name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3898name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2285name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2940name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17765name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2308name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3924name=thuselapsed=0.016
### Ambiguous input (line 87 of "~~/afp/thys/Slicing/While/Labels.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.less_eq" ("_position" c\<^sub>1)
###       ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less_eq"
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###     ("_position" l)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2971name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3971name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2332name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2971name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3995name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2367name=obtainelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8013name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3029name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2367name=obtainelapsed=0.017
### Ambiguous input (line 89 of "~~/afp/thys/Slicing/While/Labels.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.cmd.Seq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("_position" c\<^sub>2))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2472name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2520name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2520name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5129name=byelapsed=0.128
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2589name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=2655name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5747name=byelapsed=0.079
ML_statistics = :now=1464804844.14tasks_ready=1997tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=10size_allocation=3615490048size_allocation_free=872186568size_heap=4159700992size_heap_free_last_full_GC=0size_heap_free_last_GC=3616646736threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=88.636time_GC=3.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8376name=letelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=5469name=byelapsed=0.176
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6041name=byelapsed=0.066
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8406name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=11216name=byelapsed=0.026
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8561name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=6348name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=5637name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8646name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=11279name=byelapsed=0.028
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8205name=byelapsed=0.237
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=5796name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8646name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=19721name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20787name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8686name=fixelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=20468name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21597name=fixelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13040name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8808name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=26940name=haveelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8920name=henceelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13040name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21639name=obtainelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13084name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27045name=showelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8974name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21639name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21730name=henceelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13447name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27107name=nextelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9020name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27173name=showelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9038name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21771name=henceelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13494name=haveelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13569name=haveelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9067name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21820name=henceelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13598name=showelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9067name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21906name=thuselapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13616name=nextelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9163name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27591name=byelapsed=0.033
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9283name=henceelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13656name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21966name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27713name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=21975name=fixelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9311name=thuselapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13656name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=7665name=showelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/PDG.thyoffset=7825name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13788name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18240name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22231name=haveelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19014name=byelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=19443name=byelapsed=0.180
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13850name=showelapsed=0.196
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18283name=showelapsed=0.197
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20027name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22310name=haveelapsed=0.199
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18337name=nextelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21710name=proofelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20467name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22378name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=18366name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21764name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20758name=byelapsed=0.030
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21786name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22671name=obtainelapsed=0.032
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=20886name=byelapsed=0.039
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21876name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22671name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=24632name=byelapsed=0.028
### Ambiguous input (line 779 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 780 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25517name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23086name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21876name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=33262name=showelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=21983name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25540name=nextelapsed=0.015
### Ambiguous input (line 785 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 786 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" x)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23232name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22029name=haveelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25610name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=33423name=showelapsed=0.016
ML_statistics = :now=1464804844.78tasks_ready=1970tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=11size_allocation=3557818368size_allocation_free=3557818368size_heap=4168089600size_heap_free_last_full_GC=0size_heap_free_last_GC=3559280352threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=90.488time_GC=4.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### Ambiguous input (line 541 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>local.path"
###       ("_applC" ("_position" targetnode) ("_position" a)) ("_position" as')
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###           ("_applC" ("_position" length) ("_position" as')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" a))
###         ("_position" as') ("_position" n'))
###       ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###         ("_applC" ("_position" length) ("_position" as'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>Orderings.ord_class.less_eq"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" a))
###         ("_position" as')
###         ("\<^const>HOL.implies" ("_position" n') ("_position" x)))
###       ("_applC" ("_position" length) ("_position" as')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25677name=fixelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23457name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22153name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22174name=nextelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29148name=haveelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25716name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23457name=obtainelapsed=0.016
### Introduced fixed type variable(s): 'a in "m__"
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25795name=ultimatelyelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29246name=showelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22267name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23679name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29288name=nextelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25806name=showelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22267name=obtainelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23679name=obtainelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22385name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29312name=henceelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23793name=haveelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25856name=nextelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25929name=haveelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22430name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29386name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23945name=obtainelapsed=0.023
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25997name=fixelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22677name=ultimatelyelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29386name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23945name=obtainelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26039name=haveelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22688name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29614name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26103name=fixelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22738name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24123name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29614name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26140name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24728name=henceelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27173name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29852name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27211name=nextelapsed=0.014
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26195name=ultimatelyelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24886name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26206name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29990name=haveelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27258name=obtainelapsed=0.013
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27258name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27901name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=25117name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30163name=haveelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27311name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27922name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=25213name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30299name=showelapsed=0.017
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27417name=showelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27946name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34019name=showelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27439name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31025name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35791name=nextelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27489name=obtainelapsed=0.018
### Ambiguous input (line 841 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n''))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31067name=nextelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27489name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35835name=obtainelapsed=0.024
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27542name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31271name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35835name=obtainelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27685name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31311name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36069name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27710name=ultimatelyelapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27721name=showelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31479name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36195name=haveelapsed=0.018
### Ambiguous input (line 850 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=666name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31675name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38670name=byelapsed=0.149
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36346name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=751name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31777name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=777name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36381name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31910name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32722name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=833name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38953name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31974name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39072name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=887name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1665name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32016name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=887name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39224name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1665name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1010name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32569name=showelapsed=0.014
ML_statistics = :now=1464804845.28tasks_ready=2015tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=11size_allocation=3557818368size_allocation_free=3171597632size_heap=4168089600size_heap_free_last_full_GC=0size_heap_free_last_GC=3559280352threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=92.088time_GC=4.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1762name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39339name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1810name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1080name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39508name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=45470name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1866name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42088name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1903name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39597name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2894name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42434name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2919name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39661name=haveelapsed=0.019
### Ambiguous input (line 932 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n))
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n))
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46731name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=42958name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=2988name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39748name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46886name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=46366name=byelapsed=0.043
### Ambiguous input (line 934 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3049name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39905name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47127name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52198name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52069name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47543name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40019name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43592name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43903name=fixelapsed=0.018
### Ambiguous input (line 1024 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40109name=haveelapsed=0.018
### Ambiguous input (line 1025 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 7 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n\<^sub>1))
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.relevant_vars"
###     ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n\<^sub>1))
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n\<^sub>1'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.relevant_vars"
###       ("\<^const>HOL.eq" ("_applC" ("_position" S) ("_position" n\<^sub>1))
###         ("\<^const>local.relevant_vars" ("_position" S))))
###     ("_position" n\<^sub>1')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 1025 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44878name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=43964name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40184name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=52674name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47939name=fixelapsed=0.016
### Ambiguous input (line 1104 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1'))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40207name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50931name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44001name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40230name=nextelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=47975name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44001name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54795name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=54659name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40305name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58867name=proofelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44186name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40489name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55456name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58973name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44326name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40657name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55593name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59014name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44475name=haveelapsed=0.019
### Ambiguous input (line 1035 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59069name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55637name=thuselapsed=0.017
### Ambiguous input (line 1035 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40848name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44529name=fromelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59196name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44604name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=55982name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40974name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59414name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44704name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40998name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56088name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59458name=noteelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=69572name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56216name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68230name=henceelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=69667name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56310name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59790name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68457name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56333name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68657name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59941name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=69869name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56356name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68680name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=59941name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70038name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56407name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60218name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68704name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70130name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56523name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68896name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60268name=showelapsed=0.018
ML_statistics = :now=1464804845.78tasks_ready=2012tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=11size_allocation=3557818368size_allocation_free=2653751032size_heap=4168089600size_heap_free_last_full_GC=0size_heap_free_last_GC=3559280352threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=93.684time_GC=4.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64995name=proofelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70251name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68999name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65079name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70251name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=69143name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70400name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65100name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75926name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65158name=noteelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70547name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71774name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65418name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71847name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70695name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71961name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65418name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76402name=byelapsed=0.012
### Ambiguous input (line 1632 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 4 parse trees:
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("_applC" ("_position" distance)
###           ("_cargs" ("_position" n)
###             ("_cargs" ("_position" n') ("_position" x)))))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n)
###                 ("_applC" ("_position" backward_slice) ("_position" S))))
###             ("_Finset" ("_position" n'))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_position" as')
###         ("\<^const>HOL.eq"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj" ("_position" n')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" preds)
###                   ("_cargs"
###                     ("_applC" ("_position" slice_kinds)
###                       ("_cargs" ("_position" S) ("_position" as')))
###                     ("_position" s)))
###                 ("_applC" ("_position" slice_edges)
###                   ("_cargs" ("_position" S) ("_position" as'))))))
###           ("\<^const>List.list.Nil"))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("_applC" ("_position" distance)
###           ("_cargs" ("_position" n)
###             ("_cargs" ("_position" n') ("_position" x)))))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n)
###                 ("_applC" ("_position" backward_slice) ("_position" S))))
###             ("_Finset" ("_position" n'))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_position" as')
###         ("\<^const>local.path" ("_position" n) ("_position" as')
###           ("\<^const>HOL.conj" ("_position" n')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_position" S) ("_position" as')))
###                   ("_position" s)))
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" slice_edges)
###                   ("_cargs" ("_position" S) ("_position" as')))
###                 ("\<^const>List.list.Nil")))))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("_applC" ("_position" distance)
###           ("_cargs" ("_position" n)
###             ("_cargs" ("_position" n') ("_position" x)))))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n)
###                 ("_applC" ("_position" backward_slice) ("_position" S))))
###             ("_Finset" ("_position" n'))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_position" as')
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("_position" n'))
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" preds)
###               ("_cargs"
###                 ("_applC" ("_position" slice_kinds)
###                   ("_cargs" ("_position" S) ("_position" as')))
###                 ("_position" s)))
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" slice_edges)
###                 ("_cargs" ("_position" S) ("_position" as')))
###               ("\<^const>List.list.Nil"))))))))
### ("\<^const>Pure.all_binder" ("_position" n)
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("_applC" ("_position" distance)
###           ("_cargs" ("_position" n)
###             ("_cargs" ("_position" n') ("_position" x)))))
###       ("_asm"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n)
###                 ("_applC" ("_position" backward_slice) ("_position" S))))
###             ("_Finset" ("_position" n'))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder" ("_position" as')
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n) ("_position" as')
###             ("\<^const>HOL.conj" ("_position" n')
###               ("_applC" ("_position" preds)
###                 ("_cargs"
###                   ("_applC" ("_position" slice_kinds)
###                     ("_cargs" ("_position" S) ("_position" as')))
###                   ("_position" s)))))
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" slice_edges)
###               ("_cargs" ("_position" S) ("_position" as')))
###             ("\<^const>List.list.Nil")))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=71987name=noteelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65619name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76734name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72184name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65803name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76931name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72184name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77085name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11364name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72499name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65926name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77175name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11403name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73052name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65926name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11461name=ultimatelyelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77319name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73052name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66141name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11472name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73233name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77444name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11523name=haveelapsed=0.018
### Ambiguous input (line 333 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=6961name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73479name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11564name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77444name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77613name=fromelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11626name=ultimatelyelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73541name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77739name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11637name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13056name=byelapsed=0.013
### Ambiguous input (line 1748 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_position" S)
###                   ("_applC" ("_position" slice_edges)
###                     ("_cargs" ("_position" S) ("_position" as)))))
###               ("_position" s)))
###           ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_position" S)
###                   ("_applC" ("_position" slice_edges)
###                     ("_cargs" ("_position" S) ("_position" as)))))
###               ("_position" s)))
###           ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73688name=obtainelapsed=0.024
### Ambiguous input (line 337 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less" ("_position" l)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog2)))
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less" ("_position" l)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog2)))
###         ("_position" prog2)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>HOL.conj"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog2)))
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.conj" ("_position" prog2)
###           ("\<^const>WCFG.While_CFG" ("_position" prog2)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("\<^const>WCFG.w_node.Exit")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog2) ("_position" prog2))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog2) ("_position" prog2)))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.conj" ("_position" prog2) ("_position" prog2))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("\<^const>WCFG.w_node.Exit"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog2) ("_position" prog2)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.conj"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog2))
###           ("_position" prog2))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11695name=fromelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77845name=haveelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73688name=obtainelapsed=0.020
### Ambiguous input (line 1751 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11757name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7411name=byelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73875name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11757name=obtainelapsed=0.017
### Ambiguous input (line 377 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s) ("_position" True)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s) ("_position" True)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78079name=haveelapsed=0.025
### Ambiguous input (line 341 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("_position" et) ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" et) ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13108name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=11886name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74004name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78290name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13191name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74070name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12014name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78457name=henceelapsed=0.019
### Ambiguous input (line 346 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less" ("_position" l)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" prog1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.less" ("_position" l)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>HOL.conj"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.While_CFG" ("_position" prog1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.conj" ("_position" prog1)
###           ("\<^const>WCFG.While_CFG" ("_position" prog1)
###             ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###             ("\<^const>WCFG.w_node.Exit")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog1) ("_position" prog1))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###       ("\<^const>Orderings.ord_class.less" ("_position" l)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog1) ("_position" prog1)))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>WCFG.While_CFG"
###           ("\<^const>HOL.conj" ("_position" prog1) ("_position" prog1))
###           ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###           ("\<^const>WCFG.w_node.Exit"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>HOL.conj" ("_position" prog1) ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_idts" ("_position" l) ("_position" et))
###     ("\<^const>Orderings.ord_class.less" ("_position" l)
###       ("\<^const>WCFG.While_CFG"
###         ("\<^const>HOL.conj"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("_position" prog1))
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Exit")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13215name=nextelapsed=0.018
### Ambiguous input (line 381 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12107name=fromelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13243name=henceelapsed=0.024
### Ambiguous input (line 394 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.disj"
###       ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###       ("_position" prog1))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))
###     ("\<^const>WCFG.While_CFG" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###     ("_position" et)
###     ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>WCFG.While_CFG" ("_position" prog1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###       ("_position" et)
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###     ("_position" et)
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_position" prog1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12169name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78749name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13319name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13661name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12169name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78823name=nextelapsed=0.017
### Ambiguous input (line 350 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et) ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_position" et) ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13661name=obtainelapsed=0.020
ML_statistics = :now=1464804846.28tasks_ready=1997tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=11size_allocation=3557818368size_allocation_free=1664903152size_heap=4168089600size_heap_free_last_full_GC=0size_heap_free_last_GC=3559280352threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=96.884time_GC=4.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12297name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13749name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78926name=haveelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=7895name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12423name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21860name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14366name=nextelapsed=0.016
### Ambiguous input (line 417 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.less_eq" ("_position" prog1)
###       ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less_eq"
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1)) ("_position" l)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 458 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s) ("_position" True)))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s) ("_position" True)))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12505name=haveelapsed=0.017
### Ambiguous input (line 356 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14390name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79322name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15986name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12557name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14427name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79322name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16090name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12642name=ultimatelyelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14427name=obtainelapsed=0.014
### Ambiguous input (line 419 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.cmd.Seq"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("_position" prog2))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79543name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16119name=nextelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12653name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14543name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16143name=henceelapsed=0.018
### Ambiguous input (line 421 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.disj"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###     ("_position" et)
###     ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###         ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###       ("_position" et)
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_position" prog2)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###     ("_position" et)
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79670name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16174name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14593name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79820name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14593name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16174name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22023name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14682name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16232name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79947name=obtainelapsed=0.023
### Ambiguous input (line 537 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s) ("_position" True)))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s) ("_position" True)))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19048name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79947name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19138name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80191name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8374name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22191name=byelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19167name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80320name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19191name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19217name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80519name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8655name=byelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80613name=fromelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=8587name=byelapsed=0.072
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80800name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22864name=showelapsed=0.019
### Ambiguous input (line 1804 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n')))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_position" S)
###                   ("_applC" ("_position" slice_edges)
###                     ("_cargs" ("_position" S) ("_position" as)))))
###               ("_position" s)))
###           ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n'))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs" ("_applC" ("_position" kinds) ("_position" as))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfers)
###             ("_cargs"
###               ("_applC" ("_position" slice_kinds)
###                 ("_cargs" ("_position" S)
###                   ("_applC" ("_position" slice_edges)
###                     ("_cargs" ("_position" S) ("_position" as)))))
###               ("_position" s)))
###           ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22879name=nextelapsed=0.019
### Ambiguous input (line 641 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###         ("_position" n\<^sub>2')))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>HOL.conj"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###         ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###       ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###       ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###           ("\<^const>WCFG.w_node.Node"
###             ("\<^const>Groups.zero_class.zero")))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1) ("_position" n\<^sub>2)
###     ("_position" et\<^sub>2)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###           ("\<^const>WCFG.w_node.Node"
###             ("\<^const>Groups.zero_class.zero"))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>HOL.eq"
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>1)
###         ("_position" n\<^sub>2) ("_position" et\<^sub>2)
###         ("\<^const>HOL.conj" ("\<^const>WCFG.w_node.Exit")
###           ("_position" n\<^sub>2')))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22888name=assumeelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80950name=henceelapsed=0.030
### Ambiguous input (line 642 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>HOL.eq" ("_position" n\<^sub>2')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 1807 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n'))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n'))
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22950name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=81187name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23079name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22663name=applyelapsed=0.110
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=81373name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9057name=byelapsed=0.108
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=81548name=henceelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=22707name=byelapsed=0.050
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9321name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=81842name=showelapsed=0.021
ML_statistics = :now=1464804846.79tasks_ready=2004tasks_pending=0tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=11size_allocation=3557818368size_allocation_free=1200533824size_heap=4168089600size_heap_free_last_full_GC=0size_heap_free_last_GC=3559280352threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=98.48time_GC=4.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9773name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23516name=applyelapsed=0.130
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9842name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=23560name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9551name=byelapsed=0.130
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=9915name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7575name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=7798name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24111name=applyelapsed=0.250
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24157name=applyelapsed=0.049
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24576name=byelapsed=0.175
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24754name=byelapsed=0.183
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24219name=applyelapsed=0.047
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25201name=applyelapsed=0.174
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83399name=byelapsed=0.015
### Ambiguous input (line 303 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>WCFG.While_CFG" ("_position" c')
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" et') ("_position" n')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" c')
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et')
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" et')
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" c'))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et') ("_position" n'))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=24280name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25274name=applyelapsed=0.022
command_timing = :file=~~/afp/thys/Dijkstra_Shortest_Path/Graph.thyoffset=8484name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=83121name=byelapsed=0.110
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25334name=byelapsed=0.035
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=8431name=byelapsed=0.267
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10522name=byelapsed=0.335
ML_statistics = :now=1464804847.51tasks_ready=1968tasks_pending=0tasks_running=7tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=12size_allocation=3539992576size_allocation_free=3539992576size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3540767296threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=100.56time_GC=4.284user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=10999name=byelapsed=0.128
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26441name=byelapsed=0.168
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26286name=byelapsed=0.444
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25894name=applyelapsed=0.495
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26603name=byelapsed=0.098
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=13105name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=25977name=applyelapsed=0.107
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=1892name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=26055name=byelapsed=0.026
command_timing = :file=~~/src/HOL/Library/Mapping.thyoffset=19134name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2109name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2217name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2694name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27729name=applyelapsed=0.207
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2813name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27070name=applyelapsed=0.247
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2389name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=2938name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27774name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27116name=applyelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27822name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=4241name=proofelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27165name=applyelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=26144name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=27206name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=14930name=byelapsed=0.084
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15502name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7684name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15617name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7748name=haveelapsed=0.022
ML_statistics = :now=1464804848.02tasks_ready=1892tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=12size_allocation=3539992576size_allocation_free=2470117048size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3540767296threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=102.16time_GC=4.284user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7861name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8198name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=17044name=proofelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8569name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8683name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8755name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8847name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=15280name=byelapsed=0.229
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8930name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9557name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20487name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9606name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20551name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20664name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9630name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21001name=byelapsed=0.010
### Ambiguous input (line 97 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 63 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("\<^const>local.path" ("_position" n'') ("_position" as')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("_position" targetnode) ("_position" a))))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_applC" ("\<^const>local.PDG_BS_s")
###                               ("_position" S))))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("_applC" ("_position" sourcenode) ("_position" a)))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.eq"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n')
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.conj"
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("\<^const>List.append" ("_position" as')
###                           ("\<^const>List.list.Cons" ("_position" a)
###                             ("_position" as''))))
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_s")
###                             ("_position" S))))))))
###               ("_Finset" ("_position" n')))
###             ("\<^const>HOL.Not"
###               ("\<^const>HOL.Ex_binder" ("_position" m)
###                 ("\<^const>HOL.disj"
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" sourcenode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))
###                     ("_Finset" ("_position" m)))
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" sourcenode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))
###                     ("\<^const>Set.empty")))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_applC" ("\<^const>local.PDG_BS_s")
###                               ("_position" S))))))))
###                 ("_Finset" ("_position" n')))
###               ("\<^const>HOL.Not"
###                 ("\<^const>HOL.Ex_binder" ("_position" m)
###                   ("\<^const>HOL.disj"
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" sourcenode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_s")
###                             ("_position" S))))
###                       ("_Finset" ("_position" m)))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" sourcenode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_s")
###                             ("_position" S))))
###                       ("\<^const>Set.empty"))))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_applC" ("\<^const>local.PDG_BS_s")
###                               ("_position" S))))))))
###                 ("_Finset" ("_position" n')))))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'') ("_position" n'))
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.conj"
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("\<^const>List.append" ("_position" as')
###                           ("\<^const>List.list.Cons" ("_position" a)
###                             ("_position" as''))))
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_s")
###                             ("_position" S)))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'')
###                     ("\<^const>HOL.conj" ("_position" n')
###                       ("_applC" ("_position" valid_edge) ("_position" a))))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_s")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'')
###                     ("\<^const>HOL.conj" ("_position" n')
###                       ("\<^const>HOL.conj"
###                         ("_applC" ("_position" valid_edge) ("_position" a))
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as'')))))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as'')
###                       ("\<^const>HOL.conj" ("_position" n')
###                         ("\<^const>HOL.conj"
###                           ("_applC" ("_position" valid_edge)
###                             ("_position" a))
###                           ("_position" as))))
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_s")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>List.append"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as'')
###                       ("\<^const>HOL.conj" ("_position" n')
###                         ("\<^const>HOL.conj"
###                           ("_applC" ("_position" valid_edge)
###                             ("_position" a))
###                           ("\<^const>HOL.eq" ("_position" as)
###                             ("_position" as')))))
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as'')))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_s")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8916name=byelapsed=0.026
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=8778name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=4488name=noteelapsed=0.360
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=4961name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21381name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21511name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5085name=showelapsed=0.024
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9034name=byelapsed=0.061
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21606name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7339name=qedelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21707name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=27995name=proofelapsed=0.027
### Ambiguous input (line 380 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 63 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("\<^const>local.path" ("_position" n'') ("_position" as')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("_position" targetnode) ("_position" a))))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_applC" ("\<^const>local.PDG_BS_w")
###                               ("_position" S))))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("_applC" ("_position" sourcenode) ("_position" a)))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.eq"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n')
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.conj"
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("\<^const>List.append" ("_position" as')
###                           ("\<^const>List.list.Cons" ("_position" a)
###                             ("_position" as''))))
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_w")
###                             ("_position" S))))))))
###               ("_Finset" ("_position" n')))
###             ("\<^const>HOL.Not"
###               ("\<^const>HOL.Ex_binder" ("_position" m)
###                 ("\<^const>HOL.disj"
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" sourcenode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))
###                     ("_Finset" ("_position" m)))
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" sourcenode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))
###                     ("\<^const>Set.empty")))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_applC" ("\<^const>local.PDG_BS_w")
###                               ("_position" S))))))))
###                 ("_Finset" ("_position" n')))
###               ("\<^const>HOL.Not"
###                 ("\<^const>HOL.Ex_binder" ("_position" m)
###                   ("\<^const>HOL.disj"
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" sourcenode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_w")
###                             ("_position" S))))
###                       ("_Finset" ("_position" m)))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" sourcenode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_w")
###                             ("_position" S))))
###                       ("\<^const>Set.empty"))))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_applC" ("\<^const>local.PDG_BS_w")
###                               ("_position" S))))))))
###                 ("_Finset" ("_position" n')))))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'') ("_position" n'))
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.conj"
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("\<^const>List.append" ("_position" as')
###                           ("\<^const>List.list.Cons" ("_position" a)
###                             ("_position" as''))))
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_applC" ("\<^const>local.PDG_BS_w")
###                             ("_position" S)))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'')
###                     ("\<^const>HOL.conj" ("_position" n')
###                       ("_applC" ("_position" valid_edge) ("_position" a))))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_applC" ("\<^const>local.PDG_BS_w")
###                           ("_position" S))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'')
###                     ("\<^const>HOL.conj" ("_position" n')
###                       ("\<^const>HOL.conj"
###                         ("_applC" ("_position" valid_edge) ("_position" a))
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as'')))))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as'')
###                       ("\<^const>HOL.conj" ("_position" n')
###                         ("\<^const>HOL.conj"
###                           ("_applC" ("_position" valid_edge)
###                             ("_position" a))
###                           ("_position" as))))
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'')
###               ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'')
###                 ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w") ("_position" S))))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_applC" ("\<^const>local.PDG_BS_w")
###                       ("_position" S)))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>List.append"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as'')
###                       ("\<^const>HOL.conj" ("_position" n')
###                         ("\<^const>HOL.conj"
###                           ("_applC" ("_position" valid_edge)
###                             ("_position" a))
###                           ("\<^const>HOL.eq" ("_position" as)
###                             ("_position" as')))))
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as'')))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_applC" ("\<^const>local.PDG_BS_w")
###                         ("_position" S))))
###                   ("\<^const>Set.empty"))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21814name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9135name=byelapsed=0.066
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=17291name=noteelapsed=0.344
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22502name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=17764name=haveelapsed=0.022
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=9220name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22558name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=17888name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22582name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=1728name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=20142name=qedelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31399name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31906name=byelapsed=0.010
ML_statistics = :now=1464804848.52tasks_ready=1858tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=12size_allocation=3539992576size_allocation_free=1402134664size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3540767296threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=103.74time_GC=4.284user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3013name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7587name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31462name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31574name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3187name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32040name=byelapsed=0.039
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3187name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7766name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3307name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3776name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32222name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3402name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3776name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3896name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3474name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12685name=byelapsed=0.048
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3991name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3549name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4367name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4063name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4367name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4138name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4487name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12988name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4585name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4680name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7967name=fixelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32338name=byelapsed=0.121
### Ambiguous input (line 713 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.All_binder" ("_position" asx')
###       ("\<^const>Set.member"
###         ("\<^const>local.path"
###           ("_applC" ("_position" targetnode) ("_position" a))
###           ("_position" asx')
###           ("\<^const>HOL.implies" ("_position" m) ("_position" nx)))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" asx')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.All_binder" ("_position" asx')
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path"
###           ("_applC" ("_position" targetnode) ("_position" a))
###           ("_position" asx') ("_position" m))
###         ("\<^const>Set.member" ("_position" nx)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" asx'))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.All_binder" ("_position" asx')
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" a))
###         ("_position" asx')
###         ("\<^const>HOL.implies" ("_position" m)
###           ("\<^const>Set.member" ("_position" nx)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" asx')))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8047name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4910name=obtainelapsed=0.022
### Ambiguous input (line 622 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 63 parse trees (10 displayed):
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path"
###               ("\<^const>local.path" ("_position" n'') ("_position" as')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" sourcenode) ("_position" a))
###                   ("_applC" ("_position" targetnode) ("_position" a))))
###               ("_position" as'')
###               ("\<^const>HOL.conj" ("_position" n')
###                 ("\<^const>HOL.conj"
###                   ("_applC" ("_position" valid_edge) ("_position" a))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_position" ?WOD_BS)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_position" ?WOD_BS)))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("_applC" ("_position" sourcenode) ("_position" a)))
###           ("\<^const>HOL.conj"
###             ("\<^const>HOL.eq"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" a))
###                 ("_position" as'')
###                 ("\<^const>HOL.conj" ("_position" n')
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.conj"
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("\<^const>List.append" ("_position" as')
###                           ("\<^const>List.list.Cons" ("_position" a)
###                             ("_position" as''))))
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_position" ?WOD_BS)))))))
###               ("_Finset" ("_position" n')))
###             ("\<^const>HOL.Not"
###               ("\<^const>HOL.Ex_binder" ("_position" m)
###                 ("\<^const>HOL.disj"
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" sourcenode) ("_position" a))
###                         ("_position" ?WOD_BS)))
###                     ("_Finset" ("_position" m)))
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" sourcenode) ("_position" a))
###                         ("_position" ?WOD_BS)))
###                     ("\<^const>Set.empty")))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>local.path" ("_position" n'') ("_position" as')
###           ("\<^const>HOL.conj"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("\<^const>HOL.conj"
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_position" ?WOD_BS)))))))
###                 ("_Finset" ("_position" n')))
###               ("\<^const>HOL.Not"
###                 ("\<^const>HOL.Ex_binder" ("_position" m)
###                   ("\<^const>HOL.disj"
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" sourcenode)
###                             ("_position" a))
###                           ("_position" ?WOD_BS)))
###                       ("_Finset" ("_position" m)))
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" sourcenode)
###                             ("_position" a))
###                           ("_position" ?WOD_BS)))
###                       ("\<^const>Set.empty"))))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path" ("_position" n'') ("_position" as')
###             ("\<^const>HOL.conj"
###               ("_applC" ("_position" sourcenode) ("_position" a))
###               ("\<^const>HOL.eq"
###                 ("\<^const>local.path"
###                   ("_applC" ("_position" targetnode) ("_position" a))
###                   ("_position" as'')
###                   ("\<^const>HOL.conj" ("_position" n')
###                     ("\<^const>HOL.conj"
###                       ("_applC" ("_position" valid_edge) ("_position" a))
###                       ("\<^const>HOL.conj"
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as''))))
###                         ("_applC" ("_position" obs)
###                           ("_cargs"
###                             ("_applC" ("_position" targetnode)
###                               ("_position" a))
###                             ("_position" ?WOD_BS)))))))
###                 ("_Finset" ("_position" n')))))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'') ("_position" n'))
###                   ("\<^const>HOL.conj"
###                     ("_applC" ("_position" valid_edge) ("_position" a))
###                     ("\<^const>HOL.conj"
###                       ("\<^const>HOL.eq" ("_position" as)
###                         ("\<^const>List.append" ("_position" as')
###                           ("\<^const>List.list.Cons" ("_position" a)
###                             ("_position" as''))))
###                       ("_applC" ("_position" obs)
###                         ("_cargs"
###                           ("_applC" ("_position" targetnode)
###                             ("_position" a))
###                           ("_position" ?WOD_BS))))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'')
###                     ("\<^const>HOL.conj" ("_position" n')
###                       ("_applC" ("_position" valid_edge) ("_position" a))))
###                   ("\<^const>HOL.conj"
###                     ("\<^const>HOL.eq" ("_position" as)
###                       ("\<^const>List.append" ("_position" as')
###                         ("\<^const>List.list.Cons" ("_position" a)
###                           ("_position" as''))))
###                     ("_applC" ("_position" obs)
###                       ("_cargs"
###                         ("_applC" ("_position" targetnode) ("_position" a))
###                         ("_position" ?WOD_BS)))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>local.path"
###                     ("_applC" ("_position" targetnode) ("_position" a))
###                     ("_position" as'')
###                     ("\<^const>HOL.conj" ("_position" n')
###                       ("\<^const>HOL.conj"
###                         ("_applC" ("_position" valid_edge) ("_position" a))
###                         ("\<^const>HOL.eq" ("_position" as)
###                           ("\<^const>List.append" ("_position" as')
###                             ("\<^const>List.list.Cons" ("_position" a)
###                               ("_position" as'')))))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" ?WOD_BS))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>HOL.eq"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as'')
###                       ("\<^const>HOL.conj" ("_position" n')
###                         ("\<^const>HOL.conj"
###                           ("_applC" ("_position" valid_edge)
###                             ("_position" a))
###                           ("_position" as))))
###                     ("\<^const>List.append" ("_position" as')
###                       ("\<^const>List.list.Cons" ("_position" a)
###                         ("_position" as''))))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" ?WOD_BS))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### ("\<^const>Pure.all_binder" ("_position" nx')
###   ("_bigimpl"
###     ("_asms"
###       ("\<^const>HOL.Trueprop"
###         ("\<^const>Set.member" ("_position" n')
###           ("_applC" ("_position" obs)
###             ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###       ("_asms"
###         ("\<^const>HOL.Trueprop"
###           ("\<^const>Set.member" ("_position" nx')
###             ("_applC" ("_position" obs)
###               ("_cargs" ("_position" n'') ("_position" ?WOD_BS)))))
###         ("_asms"
###           ("\<^const>HOL.Trueprop"
###             ("\<^const>HOL.not_equal" ("_position" n') ("_position" nx')))
###           ("_asms"
###             ("\<^const>HOL.Trueprop"
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" obs)
###                   ("_cargs" ("_position" n') ("_position" ?WOD_BS)))
###                 ("_Finset" ("_position" n'))))
###             ("_asms"
###               ("\<^const>HOL.Trueprop"
###                 ("_Ball" ("_position" n')
###                   ("_applC" ("_position" set)
###                     ("_applC" ("_position" sourcenodes) ("_position" as)))
###                   ("\<^const>Set.not_member" ("_position" n')
###                     ("_position" ?WOD_BS))))
###               ("_asm"
###                 ("\<^const>HOL.Trueprop"
###                   ("\<^const>HOL.not_equal" ("_position" as)
###                     ("\<^const>List.list.Nil")))))))))
###     ("\<^const>HOL.Trueprop"
###       ("\<^const>HOL.Ex_binder"
###         ("_idts" ("_position" a)
###           ("_idts" ("_position" as') ("_position" as'')))
###         ("\<^const>HOL.conj"
###           ("\<^const>HOL.eq"
###             ("\<^const>local.path" ("_position" n'') ("_position" as')
###               ("\<^const>HOL.conj"
###                 ("_applC" ("_position" sourcenode) ("_position" a))
###                 ("\<^const>HOL.conj"
###                   ("\<^const>List.append"
###                     ("\<^const>local.path"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" as'')
###                       ("\<^const>HOL.conj" ("_position" n')
###                         ("\<^const>HOL.conj"
###                           ("_applC" ("_position" valid_edge)
###                             ("_position" a))
###                           ("\<^const>HOL.eq" ("_position" as)
###                             ("_position" as')))))
###                     ("\<^const>List.list.Cons" ("_position" a)
###                       ("_position" as'')))
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" targetnode) ("_position" a))
###                       ("_position" ?WOD_BS))))))
###             ("_Finset" ("_position" n')))
###           ("\<^const>HOL.Not"
###             ("\<^const>HOL.Ex_binder" ("_position" m)
###               ("\<^const>HOL.disj"
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("_Finset" ("_position" m)))
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" obs)
###                     ("_cargs"
###                       ("_applC" ("_position" sourcenode) ("_position" a))
###                       ("_position" ?WOD_BS)))
###                   ("\<^const>Set.empty"))))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8138name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32537name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4910name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=28240name=noteelapsed=0.397
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8198name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5030name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32537name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=28705name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5139name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32633name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8226name=nextelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8253name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5248name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=28827name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34049name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8360name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=31059name=qedelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13301name=byelapsed=0.036
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8442name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5478name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8741name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=34187name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=13607name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6105name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8948name=applyelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5478name=obtainelapsed=0.031
### Ambiguous input (line 154 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" labels)
###     ("_cargs"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_cargs"
###         ("\<^const>Groups.plus_class.plus" ("_position" l)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" c)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC" ("_position" labels)
###     ("_cargs"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" c\<^sub>2))
###       ("_cargs"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Groups.plus_class.plus" ("_position" l)
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###           ("\<^const>Groups.one_class.one"))
###         ("_position" c)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6105name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5598name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9297name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6223name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5699name=withelapsed=0.015
### Ambiguous input (line 156 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("_position" Defs)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("_position" Defs)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6342name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6770name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5716name=haveelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6770name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6451name=haveelapsed=0.019
ML_statistics = :now=1464804849.02tasks_ready=1855tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=12size_allocation=3539992576size_allocation_free=22423600size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3540767296threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=106.84time_GC=4.284user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### Ambiguous input (line 158 of "~~/afp/thys/Slicing/While/WellFormed.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.not_member" ("_position" V)
###     ("_applC" ("_position" Defs)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.not_member" ("_position" V)
###     ("_applC" ("_position" Defs)
###       ("_cargs"
###         ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###           ("_position" c\<^sub>2))
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6507name=withelapsed=0.105
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5828name=withelapsed=0.112
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6888name=haveelapsed=0.123
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5882name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6546name=showelapsed=0.019
### Ignoring duplicate rewrite rule:
### Defs ?prog1 ?n1 \<equiv>
### {V. \<exists>l c.
###        ?n1 = (_ l _) \<and> labels ?prog1 l c \<and> V \<in> lhs c}
### Ignoring duplicate rewrite rule:
### Uses ?prog1 ?n1 \<equiv>
### {V. \<exists>l c.
###        ?n1 = (_ l _) \<and> labels ?prog1 l c \<and> V \<in> rhs c}
### Ignoring duplicate rewrite rule:
### Defs ?prog1 ?n1 \<equiv>
### {V. \<exists>l c.
###        ?n1 = (_ l _) \<and> labels ?prog1 l c \<and> V \<in> lhs c}
### Ignoring duplicate rewrite rule:
### Uses ?prog1 ?n1 \<equiv>
### {V. \<exists>l c.
###        ?n1 = (_ l _) \<and> labels ?prog1 l c \<and> V \<in> rhs c}
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7007name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9510name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=8968name=applyelapsed=0.244
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7116name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9871name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=7211name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10034name=applyelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=17709name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=796name=applyelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=857name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14240name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10530name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10376name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1304name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=9530name=applyelapsed=0.138
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18183name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10053name=applyelapsed=0.121
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11163name=applyelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10945name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18622name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10550name=applyelapsed=0.118
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10088name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=1969name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11553name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10585name=applyelapsed=0.042
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=14850name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=18919name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=10641name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11720name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2104name=haveelapsed=0.021
### Ambiguous input (line 56 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2161name=withelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3441name=applyelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11183name=applyelapsed=0.133
### Ambiguous input (line 57 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("_position" n)
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n')))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_position" n'))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n')))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("_position" n)
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n')))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs"
###           ("_list"
###             ("_tuple" ("_position" n)
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###                 ("_tuple_arg" ("_position" n')))))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n')))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs"
###           ("_list"
###             ("_tuple" ("_position" n)
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###                 ("_tuple_arg" ("_position" n')))))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n'))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3502name=applyelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2215name=haveelapsed=0.033
### Ambiguous input (line 60 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a)))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a)))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("_position" n)
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_list" ("_position" a)))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("_list" ("_position" a))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("_list" ("_position" a)))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2433name=withelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11218name=applyelapsed=0.045
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11740name=applyelapsed=0.083
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3579name=applyelapsed=0.045
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2486name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11274name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=11775name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=3595name=applyelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2509name=nextelapsed=0.020
ML_statistics = :now=1464804849.58tasks_ready=1809tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=13size_allocation=3489660928size_allocation_free=2589718280size_heap=4172283904size_heap_free_last_full_GC=0size_heap_free_last_GC=3490910368threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=108.492time_GC=4.384user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15148name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2579name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12050name=byelapsed=0.051
### Ambiguous input (line 66 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_position" n'))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n'')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n')))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n'')
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_position" n'))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5961name=applyelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12217name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=15491name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2679name=haveelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6022name=applyelapsed=0.021
### Ambiguous input (line 67 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1) ("_position" prog))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" c\<^sub>1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4223name=byelapsed=0.012
### Ambiguous input (line 68 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 9 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###         ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a)))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a))))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>HOL.eq" ("_position" c\<^sub>1)
###           ("_list" ("_position" a)))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("_position" n)
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))
###       ("_list" ("_position" a)))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("_position" n)
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("_list" ("_position" a))))
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("_position" n)
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("_list" ("_position" a)))
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 105 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("_position" n'))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" n')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2742name=withelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6099name=applyelapsed=0.050
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2881name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4347name=haveelapsed=0.029
### Ambiguous input (line 106 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12237name=applyelapsed=0.086
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6115name=applyelapsed=0.022
### Ambiguous input (line 107 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one")))
###       ("_position" n'))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("\<^const>Groups.one_class.one"))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr" ("_position" n'')
###                   ("\<^const>Groups.one_class.one")))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.one_class.one")))
###         ("_position" n')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=12272name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4482name=haveelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6847name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8956name=applyelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16078name=byelapsed=0.019
### Ambiguous input (line 109 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Groups.one_class.one"))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4658name=withelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9608name=byelapsed=0.014
### Ambiguous input (line 110 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" n'))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs"
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###           ("\<^const>Groups.one_class.one"))
###         ("_position" n')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 219 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4709name=haveelapsed=0.029
### Ambiguous input (line 159 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" n'))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" n')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9037name=applyelapsed=0.052
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9792name=haveelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=6971name=haveelapsed=0.060
### Ambiguous input (line 222 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l''))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4810name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9054name=applyelapsed=0.022
### Ambiguous input (line 161 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9930name=haveelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4833name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7114name=withelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9105name=applyelapsed=0.013
### Ambiguous input (line 223 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9998name=withelapsed=0.011
### Ambiguous input (line 224 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("_Numeral" ("_constify" ("_position" 2))))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr" ("_position" n'')
###                   ("_Numeral" ("_constify" ("_position" 2)))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("_Numeral" ("_constify" ("_position" 2)))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("_Numeral" ("_constify" ("_position" 2)))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("_Numeral" ("_constify" ("_position" 2)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("_Numeral" ("_constify" ("_position" 2)))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("_Numeral" ("_constify" ("_position" 2)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("_Numeral" ("_constify" ("_position" 2)))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("_Numeral" ("_constify" ("_position" 2)))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4903name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10060name=haveelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4931name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9177name=applyelapsed=0.052
### Ambiguous input (line 226 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###         ("_list" ("_position" a))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq" ("_Numeral" ("_constify" ("_position" 2)))
###         ("_list" ("_position" a)))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_list" ("_position" a)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10221name=withelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=9193name=applyelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4954name=nextelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10267name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30428name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5004name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=31278name=byelapsed=0.011
### Ambiguous input (line 121 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>WCFG.While_CFG" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10311name=nextelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5094name=fromelapsed=0.010
### Ambiguous input (line 122 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###         ("_position" c\<^sub>2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.one_class.one"))))))
###       ("_position" n''))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("_position" c\<^sub>2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.one_class.one"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.one_class.one"))))))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###     ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.one_class.one"))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog)
###       ("\<^const>AdditionalLemmas.path" ("_position" c\<^sub>2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.one_class.one"))
###         ("_list"
###           ("_tuple"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node" ("_position" l))
###               ("\<^const>Groups.one_class.one"))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr" ("_position" n'')
###                   ("\<^const>Groups.one_class.one"))))))
###         ("_position" n'')))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10381name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5158name=haveelapsed=0.036
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11227name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10409name=thuselapsed=0.021
### Ambiguous input (line 125 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq" ("\<^const>Groups.one_class.one")
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Groups.one_class.one"))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5377name=withelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11386name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10432name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5459name=showelapsed=0.036
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10488name=haveelapsed=0.020
### Ambiguous input (line 162 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 128 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one")))))
###       ("_position" n'))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10589name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11463name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16662name=byelapsed=0.051
### Ambiguous input (line 261 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s) ("_position" True)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s) ("_position" True)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7202name=haveelapsed=0.237
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10612name=thuselapsed=0.016
### Ignoring duplicate introduction (intro)
### finite ?F \<Longrightarrow> finite (?h ` ?F)
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11522name=henceelapsed=0.024
### Ambiguous input (line 262 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804850.09tasks_ready=1780tasks_pending=0tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=13size_allocation=3489660928size_allocation_free=1778845224size_heap=4172283904size_heap_free_last_full_GC=0size_heap_free_last_GC=3490910368threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=110.084time_GC=4.384user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
### Ambiguous input (line 166 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 20 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7442name=withelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32518name=applyelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11598name=henceelapsed=0.028
### Ambiguous input (line 264 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32545name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=16975name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11766name=haveelapsed=0.024
### Ambiguous input (line 265 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 167 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" n'))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr" ("_position" n')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("_position" n')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs"
###           ("\<^const>List.list.Cons" ("_position" a) ("_position" as))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" n')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13406name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7517name=haveelapsed=0.061
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11828name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32861name=applyelapsed=0.043
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13406name=obtainelapsed=0.019
### Ambiguous input (line 267 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("_list"
###       ("_args"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update"
###               ("_lambda" ("_position" s)
###                 ("_Update" ("_position" s)
###                   ("_updbind" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s)))))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one")))))
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_list"
###         ("_args"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update"
###                 ("_lambda" ("_position" s)
###                   ("_Update" ("_position" s)
###                     ("_updbind" ("_position" V)
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" e) ("_position" s)))))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.one_class.one")))))
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###               ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("_list"
###       ("_args"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update"
###               ("_lambda" ("_position" s)
###                 ("_applC" ("_position" s)
###                   ("\<^const>Com.cmd.LAss" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s)))))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one")))))
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_list"
###         ("_args"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update"
###                 ("_lambda" ("_position" s)
###                   ("_applC" ("_position" s)
###                     ("\<^const>Com.cmd.LAss" ("_position" V)
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" e) ("_position" s)))))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.one_class.one")))))
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###               ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 299 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry") ("_position" as')
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry") ("_position" as')
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7681name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=32888name=byelapsed=0.014
### Ignoring duplicate introduction (intro)
### finite ?F \<Longrightarrow> finite (?h ` ?F)
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13561name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11971name=haveelapsed=0.031
### Ambiguous input (line 271 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7704name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7774name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13694name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12232name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19829name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12258name=nextelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7802name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13694name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19829name=obtainelapsed=0.015
### Ambiguous input (line 275 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 304 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 414 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7825name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12293name=henceelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13821name=henceelapsed=0.019
### Ambiguous input (line 276 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 307 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19889name=henceelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12362name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7875name=haveelapsed=0.018
### Ambiguous input (line 416 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" true)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Groups.one_class.one")))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 278 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Update"
###       ("_lambda" ("_position" s)
###         ("_Update" ("_position" s)
###           ("_updbind" ("_position" V)
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" e) ("_position" s)))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("_Update" ("_position" s)
###             ("_updbind" ("_position" V)
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" e) ("_position" s)))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Update"
###       ("_lambda" ("_position" s)
###         ("_applC" ("_position" s)
###           ("\<^const>Com.cmd.LAss" ("_position" V)
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" e) ("_position" s)))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>WCFG.While_CFG" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Update"
###         ("_lambda" ("_position" s)
###           ("_applC" ("_position" s)
###             ("\<^const>Com.cmd.LAss" ("_position" V)
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" e) ("_position" s)))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14050name=obtainelapsed=0.020
### Ambiguous input (line 179 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_applC" ("_position" kind) ("_position" a))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_applC" ("_position" kind) ("_position" a)) ("_position" n'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_applC" ("_position" kind) ("_position" a)) ("_position" n''))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_applC" ("_position" kind) ("_position" a))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20038name=haveelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12494name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7965name=fromelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14050name=obtainelapsed=0.017
### Ambiguous input (line 310 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 420 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" true)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 280 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update"
###             ("_lambda" ("_position" s)
###               ("_Update" ("_position" s)
###                 ("_updbind" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s)))))))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update"
###               ("_lambda" ("_position" s)
###                 ("_Update" ("_position" s)
###                   ("_updbind" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s)))))))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update"
###             ("_lambda" ("_position" s)
###               ("_applC" ("_position" s)
###                 ("\<^const>Com.cmd.LAss" ("_position" V)
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" e) ("_position" s)))))))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update"
###               ("_lambda" ("_position" s)
###                 ("_applC" ("_position" s)
###                   ("\<^const>Com.cmd.LAss" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s)))))))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 311 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("_applC"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###         ("_position" sourcenode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_applC" ("_position" sourcenode) ("_position" ax)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12586name=henceelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20264name=haveelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14190name=haveelapsed=0.025
### Ambiguous input (line 425 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 314 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("_applC" ("_position" kind) ("_position" ax))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 282 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_args"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update"
###               ("_lambda" ("_position" s)
###                 ("_Update" ("_position" s)
###                   ("_updbind" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s)))))))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_args"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update"
###                 ("_lambda" ("_position" s)
###                   ("_Update" ("_position" s)
###                     ("_updbind" ("_position" V)
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" e) ("_position" s)))))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_args"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update"
###               ("_lambda" ("_position" s)
###                 ("_applC" ("_position" s)
###                   ("\<^const>Com.cmd.LAss" ("_position" V)
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" e) ("_position" s)))))))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_args"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update"
###                 ("_lambda" ("_position" s)
###                   ("_applC" ("_position" s)
###                     ("\<^const>Com.cmd.LAss" ("_position" V)
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" e) ("_position" s)))))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node" ("_position" l)))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20472name=haveelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14343name=haveelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12789name=haveelapsed=0.033
### Ambiguous input (line 285 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.LAss" ("_position" V)
###     ("\<^const>AdditionalLemmas.path" ("_position" e)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 316 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_list"
###         ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("_list"
###       ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_list"
###         ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20730name=ultimatelyelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13040name=showelapsed=0.020
### Ambiguous input (line 180 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 64 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###         ("_position" prog))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                   ("\<^const>Groups.one_class.one")))))))
###       ("_position" n''))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one")))))))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one")))))))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###               ("\<^const>Groups.one_class.one")))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one")))))))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                 ("\<^const>Groups.one_class.one")))))))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                 ("\<^const>Groups.one_class.one"))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr" ("_position" n'')
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>WCFG.label_incr" ("_position" n'')
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" c\<^sub>1)
###       ("_position" prog))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###             ("\<^const>Groups.one_class.one")))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr" ("_position" n'')
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###                   ("\<^const>Groups.one_class.one"))))))))
###     ("\<^const>WCFG.label_incr" ("_position" n'')
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14471name=henceelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20741name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=33779name=byelapsed=0.012
### Ambiguous input (line 320 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("_applC"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###         ("_position" sourcenode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_applC" ("_position" sourcenode) ("_position" ax)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8048name=haveelapsed=0.126
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20765name=nextelapsed=0.018
### Ambiguous input (line 321 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>List.append" ("_position" asx)
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>List.append" ("_position" asx)
###       ("_list"
###         ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>List.append" ("_position" asx)
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>List.append" ("_position" asx)
###           ("_list"
###             ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Com.num_inner_nodes"
###                       ("_position" prog1))))))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>List.append" ("_position" asx)
###           ("_list"
###             ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Com.num_inner_nodes"
###                       ("_position" prog1))))))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20789name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14785name=haveelapsed=0.037
### Ambiguous input (line 184 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 20 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>HOL.eq"
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_list" ("_position" a))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one"))
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###           ("\<^const>Groups.one_class.one")))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###             ("_tuple_arg" ("_position" n'')))))
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))
###         ("_list" ("_position" a))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###           ("_tuple_arg" ("_position" n'')))))
###     ("\<^const>AdditionalLemmas.label_incrs"
###       ("\<^const>HOL.eq"
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one")))
###         ("_list" ("_position" a)))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.label_incrs"
###     ("\<^const>HOL.eq"
###       ("\<^const>AdditionalLemmas.label_incrs"
###         ("_list"
###           ("_tuple" ("\<^const>WCFG.w_node.Node" ("_position" l))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" a))
###               ("_tuple_arg" ("_position" n'')))))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" c\<^sub>1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_list" ("_position" a)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12128name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8318name=withelapsed=0.032
### Ambiguous input (line 515 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20820name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8426name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14974name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24912name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20820name=obtainelapsed=0.019
### Ambiguous input (line 519 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14974name=obtainelapsed=0.021
### Ambiguous input (line 325 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12268name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25164name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20885name=showelapsed=0.020
### Ambiguous input (line 523 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one")))))
###         ("_list"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###               ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.one_class.one")))))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15040name=henceelapsed=0.029
### Ambiguous input (line 327 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25391name=haveelapsed=0.029
### Ambiguous input (line 527 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Entry")
###       ("_list"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Entry")
###     ("_list"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15189name=henceelapsed=0.024
### Ambiguous input (line 329 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>List.append" ("_position" asx)
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>List.append" ("_position" asx)
###       ("_list"
###         ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>List.append" ("_position" asx)
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>List.append" ("_position" asx)
###           ("_list"
###             ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Com.num_inner_nodes"
###                       ("_position" prog1))))))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l))
###         ("\<^const>List.append" ("_position" asx)
###           ("_list"
###             ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Com.num_inner_nodes"
###                       ("_position" prog1))))))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12387name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25723name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15274name=withelapsed=0.017
### Ambiguous input (line 331 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>List.append"
###       ("\<^const>List.append" ("_position" asx)
###         ("_list"
###           ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>List.append"
###         ("\<^const>List.append" ("_position" asx)
###           ("_list"
###             ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###               ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Com.num_inner_nodes"
###                       ("_position" prog1))))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as'')
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12490name=byelapsed=0.064
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=2460name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25752name=nextelapsed=0.020
ML_statistics = :now=1464804850.59tasks_ready=1802tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=13size_allocation=3489660928size_allocation_free=1155822752size_heap=4172283904size_heap_free_last_full_GC=0size_heap_free_last_GC=3490910368threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=111.644time_GC=4.384user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15398name=haveelapsed=0.030
### Ambiguous input (line 334 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry") ("_position" as')
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry") ("_position" as')
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25776name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6990name=showelapsed=0.017
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=12573name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25802name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15640name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7016name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9162name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15664name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7083name=showelapsed=0.019
### Ambiguous input (line 337 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.less_eq" ("_position" prog1)
###       ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less_eq"
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1)) ("_position" l)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5345name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=9381name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15688name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10590name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15725name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11896name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5474name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10629name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11972name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15725name=obtainelapsed=0.018
### Ambiguous input (line 339 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less" ("_position" l)
###     ("\<^const>Com.cmd.Seq"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("_position" prog2))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5914name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10654name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15829name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=11997name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=5944name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10732name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15879name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=12050name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10807name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6011name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15879name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=12088name=thuselapsed=0.015
### Ambiguous input (line 343 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Exit"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10832name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=12113name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6075name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16036name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=6101name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=10909name=showelapsed=0.012
### Ambiguous input (line 345 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=12189name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13728name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16185name=henceelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18173name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16275name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13839name=byelapsed=0.036
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=13624name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18199name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16275name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14235name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18275name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16344name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14319name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14399name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=20566name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16344name=obtainelapsed=0.023
### Ambiguous input (line 350 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("_position" asx) ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_position" asx) ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14010name=byelapsed=0.064
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=14467name=byelapsed=0.012
### Ignoring duplicate elimination (elim)
### \<lbrakk>(_Exit_) -?as\<rightarrow>* ?n';
###  ?n' = (_Exit_) \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
### Ignoring duplicate elimination (elim)
### \<lbrakk>(_Exit_) -?as\<rightarrow>* ?n';
###  ?as = [] \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26703name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16469name=henceelapsed=0.027
### Ambiguous input (line 352 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("_position" asx) ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_position" asx) ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 353 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("_position" asx))
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16677name=haveelapsed=0.027
### Ambiguous input (line 355 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("_position" asx) ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_position" asx) ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9644name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2456name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9720name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16907name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2456name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9904name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16907name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2594name=haveelapsed=0.016
### Ambiguous input (line 358 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("_position" asx))
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 359 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("_applC"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>List.list.Cons"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("_position" asx))
###         ("_position" sourcenode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("_position" asx))
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_applC" ("_position" sourcenode) ("_position" ax)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9984name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2773name=obtainelapsed=0.018
command_timing = :file=~~/src/HOL/Library/RBT_Set.thyoffset=26865name=byelapsed=0.132
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17079name=haveelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10012name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2773name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10057name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2874name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17274name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10163name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2920name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2119name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17274name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3129name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10283name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17400name=henceelapsed=0.021
ML_statistics = :now=1464804851.09tasks_ready=1773tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=13size_allocation=3489660928size_allocation_free=628699776size_heap=4172283904size_heap_free_last_full_GC=0size_heap_free_last_GC=3490910368threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=113.244time_GC=4.384user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21706name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10283name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3282name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17565name=henceelapsed=0.019
### Ambiguous input (line 535 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_All_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path"
###             ("_applC" ("_position" sourcenode) ("_position" a))
###             ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k))
###         ("\<^const>Set.not_member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_All_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path"
###         ("_applC" ("_position" sourcenode) ("_position" a)) ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>HOL.conj"
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))
###             ("\<^const>Set.not_member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("_All_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path"
###           ("_applC" ("_position" sourcenode) ("_position" a))
###           ("_position" as) ("_position" nx))
###         ("\<^const>HOL.conj"
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k))
###           ("\<^const>Set.not_member" ("_position" n)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("_All_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path"
###           ("_applC" ("_position" sourcenode) ("_position" a))
###           ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k))))
###         ("\<^const>Set.not_member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("_All_greater_eq" ("_position" k) ("\<^const>Groups.one_class.one")
###     ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.not_member"
###         ("\<^const>local.path"
###           ("_applC" ("_position" sourcenode) ("_position" a))
###           ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>HOL.conj"
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k))
###               ("_position" n))))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10457name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3357name=nextelapsed=0.018
### Ambiguous input (line 370 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("_applC" ("_position" kind) ("_position" ax))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21891name=haveelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3403name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17709name=haveelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14419name=byelapsed=0.037
### Ambiguous input (line 372 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("_applC" ("_position" sourcenode) ("_position" ax)) ("_position" as)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>HOL.Ex_binder" ("_position" as)
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2)))
###     ("_applC" ("_position" sourcenode) ("_position" ax)) ("_position" as)
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Ex_binder" ("_position" as)
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_position" as) ("\<^const>WCFG.w_node.Node" ("_position" l))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22045name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3486name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17837name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3511name=thuselapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22045name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=2388name=byelapsed=0.021
### Ambiguous input (line 395 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax)) ("_position" asx'')
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_position" asx'') ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15811name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22207name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19064name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14597name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22207name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7036name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19064name=obtainelapsed=0.020
### Ambiguous input (line 396 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("_applC"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>List.list.Cons"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("_position" asx))
###         ("_position" sourcenode))
###       ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("_position" asx))
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_applC" ("_position" sourcenode) ("_position" ax)))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19144name=withelapsed=0.152
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22395name=haveelapsed=0.157
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7094name=proofelapsed=0.145
### Ambiguous input (line 398 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.append"
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_position" asx))
###       ("_position" asx''))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.append"
###         ("\<^const>List.list.Cons"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("_position" asx))
###         ("_position" asx''))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14882name=haveelapsed=0.155
### Ambiguous input (line 350 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.path" ("\<^fixed>Entry") ("_position" as)
###     ("\<^const>HOL.conj" ("\<^fixed>Entry")
###       ("\<^const>HOL.not_equal" ("_position" as)
###         ("\<^const>List.list.Nil")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>local.path" ("\<^fixed>Entry") ("_position" as)
###       ("\<^fixed>Entry"))
###     ("\<^const>HOL.not_equal" ("_position" as) ("\<^const>List.list.Nil"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.not_equal"
###     ("\<^const>local.path" ("\<^fixed>Entry") ("_position" as)
###       ("\<^const>HOL.conj" ("\<^fixed>Entry") ("_position" as)))
###     ("\<^const>List.list.Nil")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7186name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22448name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19258name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=14977name=haveelapsed=0.019
### Ambiguous input (line 401 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 546 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("_position" k')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" ax))
###                 ("_position" as)
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("_applC" ("_position" length) ("_position" as))))
###               ("_position" i))
###             ("\<^const>Set.member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("_position" k')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" ax))
###             ("_position" as)
###             ("\<^const>HOL.implies"
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>Orderings.ord_class.greater_eq"
###                   ("_applC" ("_position" length) ("_position" as))
###                   ("_position" i)))
###               ("\<^const>Set.member" ("_position" n)
###                 ("_applC" ("_position" set)
###                   ("_applC" ("_position" sourcenodes)
###                     ("_position" as)))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("_position" k')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" ax))
###               ("_position" as)
###               ("\<^const>HOL.conj" ("_position" nx)
###                 ("\<^const>Orderings.ord_class.greater_eq"
###                   ("_applC" ("_position" length) ("_position" as))
###                   ("_position" i))))
###             ("\<^const>Set.member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("_position" k')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj"
###               ("\<^const>local.path"
###                 ("_applC" ("_position" targetnode) ("_position" ax))
###                 ("_position" as) ("_position" nx))
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" i)))
###             ("\<^const>Set.member" ("_position" n)
###               ("_applC" ("_position" set)
###                 ("_applC" ("_position" sourcenodes)
###                   ("_position" as))))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq" ("_position" k')
###     ("_Eps" ("_position" i)
###       ("\<^const>HOL.conj"
###         ("\<^const>Orderings.ord_class.greater_eq" ("_position" i)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>HOL.All_binder"
###           ("_idts" ("_position" as) ("_position" nx))
###           ("\<^const>Set.member"
###             ("\<^const>local.path"
###               ("_applC" ("_position" targetnode) ("_position" ax))
###               ("_position" as)
###               ("\<^const>HOL.implies"
###                 ("\<^const>HOL.conj" ("_position" nx)
###                   ("\<^const>Orderings.ord_class.greater_eq"
###                     ("_applC" ("_position" length) ("_position" as))
###                     ("_position" i)))
###                 ("_position" n)))
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7209name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15059name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19471name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22523name=obtainelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15114name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22523name=obtainelapsed=0.021
### Ambiguous input (line 550 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" k')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>Set.member"
###         ("\<^const>local.path"
###           ("_applC" ("_position" targetnode) ("_position" ax))
###           ("_position" as)
###           ("\<^const>HOL.implies"
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("\<^const>Orderings.ord_class.greater_eq"
###                 ("_applC" ("_position" length) ("_position" as))
###                 ("_position" k')))
###             ("_position" n)))
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" k')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj"
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" ax))
###             ("_position" as) ("_position" nx))
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k')))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" k')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>local.path"
###           ("_applC" ("_position" targetnode) ("_position" ax))
###           ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k'))))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" k')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" ax))
###         ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k')))
###           ("\<^const>Set.member" ("_position" n)
###             ("_applC" ("_position" set)
###               ("_applC" ("_position" sourcenodes) ("_position" as)))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.conj"
###     ("\<^const>Orderings.ord_class.greater_eq" ("_position" k')
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###       ("\<^const>HOL.implies"
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("\<^const>local.path"
###             ("_applC" ("_position" targetnode) ("_position" ax))
###             ("_position" as)
###             ("\<^const>HOL.conj" ("_position" nx)
###               ("_applC" ("_position" length) ("_position" as))))
###           ("_position" k'))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15139name=nextelapsed=0.017
### Introduced fixed type variable(s): 'a in "na__"
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7257name=noteelapsed=0.061
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22736name=haveelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15172name=obtainelapsed=0.020
### Ambiguous input (line 166 of "~~/afp/thys/Slicing/StaticIntra/Distance.thy") produces 3 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>local.path" ("_position" n) ("_position" as')
###       ("\<^const>HOL.implies" ("_position" n')
###         ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###           ("_applC" ("_position" length) ("_position" as')))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("_position" n'))
###       ("\<^const>Orderings.ord_class.less_eq" ("_position" x)
###         ("_applC" ("_position" length) ("_position" as'))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_position" as')
###     ("\<^const>Orderings.ord_class.less_eq"
###       ("\<^const>local.path" ("_position" n) ("_position" as')
###         ("\<^const>HOL.implies" ("_position" n') ("_position" x)))
###       ("_applC" ("_position" length) ("_position" as')))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 554 of "~~/afp/thys/Slicing/Basic/Postdomination.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>Orderings.ord_class.greater_eq"
###         ("\<^const>local.path"
###           ("_applC" ("_position" targetnode) ("_position" ax))
###           ("_position" as)
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("_applC" ("_position" length) ("_position" as))))
###         ("_position" k'))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>local.path"
###       ("_applC" ("_position" targetnode) ("_position" ax)) ("_position" as)
###       ("\<^const>HOL.implies"
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k')))
###         ("\<^const>Set.member" ("_position" n)
###           ("_applC" ("_position" set)
###             ("_applC" ("_position" sourcenodes) ("_position" as))))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" ax))
###         ("_position" as)
###         ("\<^const>HOL.conj" ("_position" nx)
###           ("\<^const>Orderings.ord_class.greater_eq"
###             ("_applC" ("_position" length) ("_position" as))
###             ("_position" k'))))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>HOL.implies"
###       ("\<^const>HOL.conj"
###         ("\<^const>local.path"
###           ("_applC" ("_position" targetnode) ("_position" ax))
###           ("_position" as) ("_position" nx))
###         ("\<^const>Orderings.ord_class.greater_eq"
###           ("_applC" ("_position" length) ("_position" as))
###           ("_position" k')))
###       ("\<^const>Set.member" ("_position" n)
###         ("_applC" ("_position" set)
###           ("_applC" ("_position" sourcenodes) ("_position" as)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.All_binder" ("_idts" ("_position" as) ("_position" nx))
###     ("\<^const>Set.member"
###       ("\<^const>local.path"
###         ("_applC" ("_position" targetnode) ("_position" ax))
###         ("_position" as)
###         ("\<^const>HOL.implies"
###           ("\<^const>HOL.conj" ("_position" nx)
###             ("\<^const>Orderings.ord_class.greater_eq"
###               ("_applC" ("_position" length) ("_position" as))
###               ("_position" k')))
###           ("_position" n)))
###       ("_applC" ("_position" set)
###         ("_applC" ("_position" sourcenodes) ("_position" as))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7628name=noteelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15172name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22903name=henceelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=15267name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7702name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16280name=byelapsed=0.079
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23075name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7702name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=16523name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5202name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23151name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7826name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=1352name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5295name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23181name=ultimatelyelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7826name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=1415name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5388name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=7931name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23192name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5415name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23264name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6734name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5483name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23358name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5483name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23448name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5673name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6924name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3408name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5779name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3601name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=17502name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5850name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Observable.thyoffset=3825name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5942name=thuselapsed=0.018
ML_statistics = :now=1464804851.72tasks_ready=1746tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=14size_allocation=3497000960size_allocation_free=3497000960size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3498344704threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=115.228time_GC=4.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6089name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7764name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7918name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6164name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7017name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6194name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=7918name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7632name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7100name=thuselapsed=0.016
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=6234name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=8102name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7632name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7125name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7741name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=8230name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7268name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8706name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=8338name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=7364name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=12027name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8789name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=12269name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=9020name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17956name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18058name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13090name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=9114name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=17725name=byelapsed=0.055
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18083name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13183name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4070name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13211name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18213name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3112name=obtainelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4097name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18346name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13275name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3112name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4151name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3179name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13275name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13348name=henceelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4194name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3269name=thuselapsed=0.015
### Introduced fixed type variable(s): 'a in "x'__"
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3294name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4226name=obtainelapsed=0.019
### Ambiguous input (line 115 of "~~/afp/thys/Slicing/While/Labels.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.less_eq" ("_position" c\<^sub>1)
###       ("_position" l'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less_eq"
###     ("\<^const>Com.num_inner_nodes" ("_position" c\<^sub>1))
###     ("_position" l')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3322name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13612name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4226name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4353name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3360name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13612name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14033name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4401name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3360name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4401name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3504name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4469name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8851name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3555name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=4570name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=26973name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3555name=obtainelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8956name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3642name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13154name=showelapsed=0.015
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9008name=byelapsed=0.027
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13226name=nextelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/Labels.thyoffset=3733name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27064name=byelapsed=0.010
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13237name=fixelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=27192name=byelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13279name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9128name=byelapsed=0.035
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=8518name=byelapsed=0.254
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13335name=thuselapsed=0.024
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=9234name=byelapsed=0.035
ML_statistics = :now=1464804852.22tasks_ready=1713tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=14size_allocation=3497000960size_allocation_free=2449486224size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3498344704threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=118.432time_GC=4.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22995name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22324name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22483name=haveelapsed=0.021
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25644name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22164name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=23586name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=22611name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=25817name=byelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22409name=byelapsed=0.032
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22469name=haveelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22510name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24289name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29528name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29723name=byelapsed=0.037
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22571name=ultimatelyelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24367name=thuselapsed=0.018
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26175name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=29928name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=25012name=byelapsed=0.011
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=22582name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24392name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30014name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24428name=withelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=30208name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=25171name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24591name=haveelapsed=0.019
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=27957name=byelapsed=0.012
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=26234name=byelapsed=0.047
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34105name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31377name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24695name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31593name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36252name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34210name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=31836name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36451name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34348name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37009name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32230name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32580name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37042name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34454name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32344name=haveelapsed=0.015
### Ambiguous input (line 814 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n))
###     ("\<^const>Set.member" ("_position" V)
###       ("\<^const>local.relevant_vars"
###         ("_applC" ("_position" S) ("_position" n))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("_position" n))
###     ("\<^const>Set.member" ("_position" V)
###       ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###         ("_position" n)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1775name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34545name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32481name=showelapsed=0.014
### Ambiguous input (line 816 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1916name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34708name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=1093name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=39784name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3156name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34854name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48071name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40195name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3216name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49207name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35088name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49235name=withelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40351name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3341name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35113name=nextelapsed=0.018
### Ambiguous input (line 826 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n'')))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n''))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49351name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=44211name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3341name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49449name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35161name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3552name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35161name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50105name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=40705name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3643name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35412name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50105name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3758name=fixelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35542name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50337name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3800name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35644name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50469name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3800name=obtainelapsed=0.019
### Ambiguous input (line 1162 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804852.72tasks_ready=1638tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=14size_allocation=3497000960size_allocation_free=1717988456size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3498344704threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=120.048time_GC=4.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35735name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50640name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3880name=haveelapsed=0.017
### Ambiguous input (line 1163 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n\<^sub>1)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n\<^sub>1))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>1) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s\<^sub>2) ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35760name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60172name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50681name=withelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=3935name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50826name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4019name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56628name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60425name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4175name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56772name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4240name=nextelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=68942name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60528name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4282name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56928name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60735name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4394name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=60829name=withelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57091name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4450name=ultimatelyelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61012name=showelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4461name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57259name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65539name=byelapsed=0.054
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61245name=nextelapsed=0.018
### Ambiguous input (line 1325 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57373name=fromelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65665name=byelapsed=0.019
### Ambiguous input (line 1326 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n'')))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s')))
###           ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n''))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s)))
###           ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs"
###           ("_applC" ("_position" transfer)
###             ("_cargs"
###               ("_applC" ("_position" slice_kind)
###                 ("_cargs" ("_position" S) ("_position" a)))
###               ("_position" s')))
###           ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=76817name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61357name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=70712name=byelapsed=0.050
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57577name=haveelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72453name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61534name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=65837name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57877name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61534name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57902name=nextelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72618name=haveelapsed=0.011
### Ambiguous input (line 1336 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61703name=fromelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57930name=withelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72680name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58169name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61999name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66099name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72791name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58240name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73117name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72839name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66240name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77979name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72923name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=73895name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66479name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=77795name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74037name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78424name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74182name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66787name=showelapsed=0.021
### Ambiguous input (line 398 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_position" n) ("_position" et)
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13816name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74259name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66839name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13895name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74389name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=78768name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13921name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66965name=haveelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79122name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74518name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=13975name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=12434name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74552name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=67380name=haveelapsed=0.022
ML_statistics = :now=1464804853.23tasks_ready=1609tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=14size_allocation=3497000960size_allocation_free=1205776976size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3498344704threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=121.648time_GC=4.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=67584name=withelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74588name=withelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=79450name=byelapsed=0.032
### Ambiguous input (line 469 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.disj"
###       ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###       ("_position" prog1))
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>WCFG.While_CFG" ("_position" prog1)
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###     ("_position" et)
###     ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>WCFG.While_CFG" ("_position" prog1)
###         ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###         ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###       ("_position" et)
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog1) ("_position" n)
###     ("_position" et)
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_position" prog1))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74896name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=67716name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14750name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16317name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80097name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15469name=nextelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74999name=henceelapsed=0.018
### Ambiguous input (line 444 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("_position" et) ("_position" n))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" et) ("_position" n)))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" et) ("_position" n))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16317name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15519name=henceelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75129name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80377name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16411name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15651name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=75258name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17310name=nextelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19290name=haveelapsed=0.016
### Ambiguous input (line 495 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.less_eq" ("_position" prog1)
###       ("_position" l'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less_eq"
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1)) ("_position" l')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 546 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" false)))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17338name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19317name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=80910name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=81514name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17378name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19443name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17378name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19474name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8874name=byelapsed=0.024
### Ambiguous input (line 194 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Not"
###       ("_applC"
###         ("\<^const>local.postdominate" ("_position" nx)
###           ("_position" sourcenode))
###         ("_position" a)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Not"
###       ("\<^const>local.postdominate" ("_position" nx)
###         ("_applC" ("_position" sourcenode) ("_position" a))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 195 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.postdominate" ("_position" nx)
###       ("_position" sourcenode))
###     ("_position" a)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.postdominate" ("_position" nx)
###     ("_applC" ("_position" sourcenode) ("_position" a))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17542name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19515name=haveelapsed=0.019
### Ambiguous input (line 501 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.disj"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et)
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###     ("_position" et)
###     ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et)
###         ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###       ("_position" et)
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("_position" prog2)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog2) ("_position" n)
###     ("_position" et)
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9049name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19547name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17595name=obtainelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19547name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9185name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17595name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19677name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17691name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9185name=obtainelapsed=0.017
### Ambiguous input (line 199 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.postdominate" ("_position" nx)
###       ("_position" sourcenode))
###     ("_position" a)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.postdominate" ("_position" nx)
###     ("_applC" ("_position" sourcenode) ("_position" a))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 556 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>HOL.disj"
###       ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###       ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.disj"
###     ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###       ("_position" n))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###     ("_position" et)
###     ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>WCFG.While_CFG" ("_position" prog')
###         ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###         ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###       ("_position" et)
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_position" prog')))
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG" ("_position" prog') ("_position" n)
###     ("_position" et)
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>HOL.disj" ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_position" prog'))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" et)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9341name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19728name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9447name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9775name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19728name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5048name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19822name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9775name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9883name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5165name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9883name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=8601name=byelapsed=0.216
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5249name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10396name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5427name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10642name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5592name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10770name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5620name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10855name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5715name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10995name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5792name=showelapsed=0.021
### Ambiguous input (line 478 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Not"
###       ("_applC"
###         ("\<^const>local.strong_postdominate" ("_position" nx)
###           ("_position" sourcenode))
###         ("_position" a)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>HOL.Not"
###       ("\<^const>local.strong_postdominate" ("_position" nx)
###         ("_applC" ("_position" sourcenode) ("_position" a))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 479 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.strong_postdominate" ("_position" nx)
###       ("_position" sourcenode))
###     ("_position" a)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.strong_postdominate" ("_position" nx)
###     ("_applC" ("_position" sourcenode) ("_position" a))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804853.73tasks_ready=1603tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=14size_allocation=3497000960size_allocation_free=637213456size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3498344704threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=123.24time_GC=4.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10995name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21951name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21422name=byelapsed=0.214
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11155name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=17851name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11206name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22096name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22727name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22096name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11619name=haveelapsed=0.016
### Ambiguous input (line 483 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.strong_postdominate" ("_position" nx)
###       ("_position" sourcenode))
###     ("_position" a)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.strong_postdominate" ("_position" nx)
###     ("_applC" ("_position" sourcenode) ("_position" a))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22261name=haveelapsed=0.303
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22727name=obtainelapsed=0.307
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11754name=haveelapsed=0.306
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22835name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22392name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11821name=fromelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=21734name=byelapsed=0.553
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12023name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22835name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=17968name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3268name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23349name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12147name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=3857name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18052name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12233name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23595name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4448name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12331name=withelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18230name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23756name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12432name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=4991name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18395name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23841name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12455name=nextelapsed=0.014
### Ambiguous input (line 269 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" m)
###         ("_position" sourcenode))
###       ("_position" a))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" m)
###       ("_applC" ("_position" sourcenode) ("_position" a)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=28790name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18423name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12587name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23997name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=28907name=haveelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32799name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23997name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18518name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24157name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32934name=showelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=28991name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18595name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24208name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32957name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29166name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=5559name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24621name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32985name=henceelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6185name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29331name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24756name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33055name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29359name=henceelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/WellFormed.thyoffset=6850name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24823name=fromelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33055name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29453name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25043name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33258name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29528name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25168name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2289name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33258name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2608name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25254name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2921name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33467name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25352name=withelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=4579name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=2959name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25453name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33608name=haveelapsed=0.019
### Ignoring duplicate elimination (elim)
### \<lbrakk>While_CFG.path ?prog (_Exit_) ?as ?n';
###  ?n' = (_Exit_) \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25476name=nextelapsed=0.018
### Ignoring duplicate elimination (elim)
### \<lbrakk>While_CFG.path ?prog (_Exit_) ?as ?n';
###  ?as = [] \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10157name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5045name=byelapsed=0.014
### Ambiguous input (line 553 of "~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.strong_postdominate" ("_position" m)
###         ("_position" sourcenode))
###       ("_position" a))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.strong_postdominate" ("_position" m)
###       ("_applC" ("_position" sourcenode) ("_position" a)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804854.5tasks_ready=1582tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=15size_allocation=3472883712size_allocation_free=2876576680size_heap=4150263808size_heap_free_last_full_GC=0size_heap_free_last_GC=3473259824threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=1threads_wait_signal=1time_CPU=126.624time_GC=4.796user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33726name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5472name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25617name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=5248name=byelapsed=0.021
### Ignoring duplicate elimination (elim)
### \<lbrakk>While_CFG.path ?prog (_Exit_) ?as ?n';
###  ?n' = (_Exit_) \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33791name=showelapsed=0.018
### Ignoring duplicate elimination (elim)
### \<lbrakk>While_CFG.path ?prog (_Exit_) ?as ?n';
###  ?as = [] \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=10535name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=11675name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7648name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7363name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12243name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12092name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13759name=byelapsed=0.019
### Ignoring duplicate elimination (elim)
### \<lbrakk>While_CFG.path ?prog (_Exit_) ?as ?n';
###  ?n' = (_Exit_) \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13935name=byelapsed=0.012
### Ignoring duplicate elimination (elim)
### \<lbrakk>While_CFG.path ?prog (_Exit_) ?as ?n';
###  ?as = [] \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=7916name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14106name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20175name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12671name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=12915name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20602name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=13051name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=14601name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8189name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=8439name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24995name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25519name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20970name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=15547name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=7104name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25875name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=20970name=obtainelapsed=0.015
### Ambiguous input (line 537 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 440 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21132name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=25952name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=18296name=byelapsed=0.010
### Ambiguous input (line 442 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 541 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.one_class.one"))))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16407name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16575name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16760name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21250name=henceelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26187name=haveelapsed=0.022
### Ambiguous input (line 546 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("_list"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one")))))))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=16963name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21375name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=9925name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2667name=haveelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26471name=haveelapsed=0.024
### Ambiguous input (line 549 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=2733name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21375name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26768name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21496name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3054name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17351name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26799name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3179name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26840name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21663name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=3303name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=17596name=byelapsed=0.011
### Ambiguous input (line 452 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.one_class.one"))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=21996name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26872name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10544name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21801name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10544name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26872name=obtainelapsed=0.018
### Ambiguous input (line 455 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" true)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Groups.one_class.one")))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22158name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26996name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10620name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21960name=haveelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18021name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27047name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10745name=obtainelapsed=0.018
### Ambiguous input (line 377 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("_applC" ("_position" kind) ("_position" ax))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 460 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Groups.one_class.one")))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Groups.one_class.one")))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>List.list.Cons"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("\<^const>List.list.Cons"
###             ("_tuple"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("_tuple_args"
###                 ("\<^const>BasicDefs.edge_kind.Predicate"
###                   ("_lambda" ("_position" s)
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" b) ("_position" s)))
###                       ("_applC" ("_position" Some) ("_position" true)))))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Groups.one_class.one")))))
###             ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###               ("\<^const>Groups.one_class.one"))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18076name=withelapsed=0.011
### Ambiguous input (line 378 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("_list"
###       ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_list"
###         ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Node" ("_position" l))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10745name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27047name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22223name=haveelapsed=0.039
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18149name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10942name=haveelapsed=0.018
### Ambiguous input (line 464 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.one_class.one"))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.one_class.one"))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27203name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22536name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11022name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18382name=thuselapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27203name=obtainelapsed=0.017
### Ambiguous input (line 562 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog')
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18408name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22567name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11049name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27341name=henceelapsed=0.019
### Ambiguous input (line 468 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.num_inner_nodes"
###     ("\<^const>Orderings.ord_class.less_eq" ("_position" prog1)
###       ("_position" l'))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Orderings.ord_class.less_eq"
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1)) ("_position" l')))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 386 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("\<^const>WCFG.w_node.Node" ("_position" l')))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11076name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22595name=henceelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27512name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18514name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22635name=obtainelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27512name=obtainelapsed=0.013
### Ambiguous input (line 567 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path" ("_position" prog')
###     ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" asx)
###     ("_applC" ("_position" sourcenode) ("_position" ax))))
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("_position" l')) ("_position" asx)
###       ("_position" sourcenode))
###     ("_position" ax)))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11108name=henceelapsed=0.016
### Ambiguous input (line 388 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 568 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 6 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("_applC"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" sourcenode))
###       ("_position" ax))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog')
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_applC" ("_position" sourcenode) ("_position" ax))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.label_incr"
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.label_incr"
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_applC" ("_position" sourcenode) ("_position" ax)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("_applC"
###         ("\<^const>AdditionalLemmas.path" ("_position" prog')
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l'))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_position" sourcenode))
###         ("_position" ax)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
ML_statistics = :now=1464804855tasks_ready=1511tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=15size_allocation=3472883712size_allocation_free=2193874872size_heap=4150263808size_heap_free_last_full_GC=0size_heap_free_last_GC=3473259824threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=128.224time_GC=4.796user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22635name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18639name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11163name=obtainelapsed=0.019
### Ambiguous input (line 389 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("_applC" ("_position" kind) ("_position" ax))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_applC" ("_position" kind) ("_position" ax))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_applC" ("_position" kind) ("_position" ax))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27651name=haveelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22774name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18719name=withelapsed=0.010
### Ambiguous input (line 571 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###     ("_list"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###           ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11163name=obtainelapsed=0.016
### Ambiguous input (line 390 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("_applC" ("_position" sourcenode) ("_position" ax))
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27833name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22827name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18787name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11384name=haveelapsed=0.019
### Ambiguous input (line 575 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one")))))
###         ("_list"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###               ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.one_class.one")))))
###       ("_list"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###             ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22827name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=19025name=thuselapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11549name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=28068name=haveelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11549name=obtainelapsed=0.020
### Ambiguous input (line 579 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.one_class.one")))))
###           ("_list"
###             ("_tuple"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one"))
###               ("_tuple_args"
###                 ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###                 ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.label_incr"
###           ("_applC" ("_position" sourcenode) ("_position" ax))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one")))))
###         ("_list"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.one_class.one"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###               ("_tuple_arg" ("\<^const>WCFG.w_node.Exit")))))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 476 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Exit"))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr" ("\<^const>WCFG.w_node.Exit")
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l''))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.w_node.Exit")))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11713name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=28368name=haveelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22992name=haveelapsed=0.059
### Ambiguous input (line 584 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 6 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("_applC"
###       ("\<^const>AdditionalLemmas.path"
###         ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" sourcenode))
###       ("_position" ax))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog')
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_applC" ("_position" sourcenode) ("_position" ax))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.label_incr"
###         ("_applC" ("_position" sourcenode) ("_position" ax))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.label_incr"
###       ("_applC" ("_position" sourcenode) ("_position" ax))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_applC" ("_position" sourcenode) ("_position" ax)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("_applC"
###         ("\<^const>AdditionalLemmas.path" ("_position" prog')
###           ("\<^const>WCFG.label_incr"
###             ("\<^const>WCFG.w_node.Node" ("_position" l'))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_position" sourcenode))
###         ("_position" ax)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11713name=obtainelapsed=0.020
### Ambiguous input (line 479 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=28680name=withelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22349name=byelapsed=0.071
### Ambiguous input (line 585 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>List.append"
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.label_incr"
###               ("_applC" ("_position" sourcenode) ("_position" ax))
###               ("_Numeral" ("_constify" ("_position" 2))))
###             ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("\<^const>List.list.Cons"
###             ("_tuple"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("_tuple_args"
###                 ("\<^const>BasicDefs.edge_kind.Predicate"
###                   ("_lambda" ("_position" s)
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" b) ("_position" s)))
###                       ("_applC" ("_position" Some) ("_position" false)))))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.one_class.one")))))
###             ("_list"
###               ("_tuple"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.one_class.one"))
###                 ("_tuple_args"
###                   ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###                   ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>List.append"
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.label_incr"
###             ("_applC" ("_position" sourcenode) ("_position" ax))
###             ("_Numeral" ("_constify" ("_position" 2))))
###           ("_tuple_args" ("_applC" ("_position" kind) ("_position" ax))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.one_class.one")))))
###           ("_list"
###             ("_tuple"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.one_class.one"))
###               ("_tuple_args"
###                 ("\<^const>BasicDefs.edge_kind.Update" ("_position" id))
###                 ("_tuple_arg" ("\<^const>WCFG.w_node.Exit"))))))))
###     ("\<^const>WCFG.w_node.Exit")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23157name=henceelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11818name=haveelapsed=0.019
### Ignoring duplicate elimination (elim)
### \<lbrakk>?n -?as\<rightarrow>* (_Entry_);
###  ?n = (_Entry_) \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
### Ignoring duplicate elimination (elim)
### \<lbrakk>?n -?as\<rightarrow>* (_Entry_);
###  ?as = [] \<Longrightarrow> PROP ?W\<rbrakk>
### \<Longrightarrow> PROP ?W
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=28754name=haveelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23310name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12475name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12475name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23310name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29041name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=22844name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23432name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12617name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29041name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23029name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23600name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12665name=henceelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29166name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29337name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12781name=henceelapsed=0.019
### Ambiguous input (line 598 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog')
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5319name=byelapsed=0.015
### Ambiguous input (line 489 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12911name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29478name=haveelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23739name=haveelapsed=0.057
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8087name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13104name=haveelapsed=0.015
### Ambiguous input (line 601 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("_Numeral" ("_constify" ("_position" 2)))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###             ("_Numeral" ("_constify" ("_position" 2)))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("_Numeral" ("_constify" ("_position" 2)))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("_Numeral" ("_constify" ("_position" 2)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" true)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("_Numeral" ("_constify" ("_position" 2)))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###         ("_Numeral" ("_constify" ("_position" 2)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("_Numeral" ("_constify" ("_position" 2)))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("_Numeral" ("_constify" ("_position" 2)))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13213name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8151name=haveelapsed=0.017
### Ambiguous input (line 310 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("_applC"
###       ("\<^const>local.postdominate" ("_position" n)
###         ("_position" targetnode))
###       ("_position" a2))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.Not"
###     ("\<^const>local.postdominate" ("_position" n)
###       ("_applC" ("_position" targetnode) ("_position" a2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29622name=haveelapsed=0.037
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8241name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13306name=haveelapsed=0.019
### Ambiguous input (line 606 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog')
###         ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>List.list.Cons"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("\<^const>List.list.Cons"
###             ("_tuple"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("_tuple_args"
###                 ("\<^const>BasicDefs.edge_kind.Predicate"
###                   ("_lambda" ("_position" s)
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" b) ("_position" s)))
###                       ("_applC" ("_position" Some) ("_position" true)))))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("_Numeral" ("_constify" ("_position" 2)))))))
###             ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###               ("_Numeral" ("_constify" ("_position" 2))))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog')
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("_Numeral" ("_constify" ("_position" 2)))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###             ("_Numeral" ("_constify" ("_position" 2))))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" true)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("_Numeral" ("_constify" ("_position" 2)))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###           ("_Numeral" ("_constify" ("_position" 2))))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" true)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("_Numeral" ("_constify" ("_position" 2)))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx')
###             ("_Numeral" ("_constify" ("_position" 2))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8266name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13431name=haveelapsed=0.018
### Ambiguous input (line 313 of "~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_applC"
###     ("\<^const>local.postdominate" ("_position" n) ("_position" targetnode))
###     ("_position" a2)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>local.postdominate" ("_position" n)
###     ("_applC" ("_position" targetnode) ("_position" a2))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 493 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                   ("\<^const>Groups.one_class.one"))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                   ("\<^const>Groups.one_class.one")))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>List.list.Cons"
###       ("_tuple"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s)
###               ("\<^const>HOL.eq"
###                 ("_applC" ("_position" interpret)
###                   ("_cargs" ("_position" b) ("_position" s)))
###                 ("_applC" ("_position" Some) ("_position" false)))))
###           ("_tuple_arg"
###             ("\<^const>WCFG.label_incr"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("\<^const>Groups.plus_class.plus"
###                 ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                   ("\<^const>Groups.one_class.one"))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes"
###                     ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                       ("\<^const>Groups.one_class.one")))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                 ("\<^const>Groups.one_class.one")))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29884name=haveelapsed=0.039
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8339name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13494name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23945name=haveelapsed=0.086
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30147name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13562name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8426name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13589name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23231name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8506name=obtainelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=5724name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8506name=obtainelapsed=0.022
### Ambiguous input (line 498 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 32 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>AdditionalLemmas.path"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes"
###                     ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                       ("\<^const>Groups.one_class.one")))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one"))))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes"
###                     ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                       ("\<^const>Groups.one_class.one")))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                   ("\<^const>Groups.one_class.one"))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one"))))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Groups.plus_class.plus"
###                     ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                     ("\<^const>Groups.one_class.one"))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Com.num_inner_nodes"
###               ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                 ("\<^const>Groups.one_class.one"))))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Com.num_inner_nodes"
###                   ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                     ("\<^const>Groups.one_class.one")))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Com.num_inner_nodes"
###                     ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                       ("\<^const>Groups.one_class.one")))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Entry")
###     ("\<^const>List.list.Cons"
###       ("_tuple" ("\<^const>WCFG.w_node.Entry")
###         ("_tuple_args"
###           ("\<^const>BasicDefs.edge_kind.Predicate"
###             ("_lambda" ("_position" s) ("_position" True)))
###           ("_tuple_arg"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero")))))
###       ("\<^const>List.list.Cons"
###         ("_tuple"
###           ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s)
###                 ("\<^const>HOL.eq"
###                   ("_applC" ("_position" interpret)
###                     ("_cargs" ("_position" b) ("_position" s)))
###                   ("_applC" ("_position" Some) ("_position" false)))))
###             ("_tuple_arg"
###               ("\<^const>WCFG.label_incr"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero"))
###                 ("\<^const>Groups.plus_class.plus"
###                   ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                   ("\<^const>Groups.one_class.one"))))))
###         ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Entry")
###       ("\<^const>List.list.Cons"
###         ("_tuple" ("\<^const>WCFG.w_node.Entry")
###           ("_tuple_args"
###             ("\<^const>BasicDefs.edge_kind.Predicate"
###               ("_lambda" ("_position" s) ("_position" True)))
###             ("_tuple_arg"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero")))))
###         ("\<^const>List.list.Cons"
###           ("_tuple"
###             ("\<^const>WCFG.w_node.Node"
###               ("\<^const>Groups.zero_class.zero"))
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s)
###                   ("\<^const>HOL.eq"
###                     ("_applC" ("_position" interpret)
###                       ("_cargs" ("_position" b) ("_position" s)))
###                     ("_applC" ("_position" Some) ("_position" false)))))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.label_incr"
###                   ("\<^const>WCFG.w_node.Node"
###                     ("\<^const>Groups.zero_class.zero"))
###                   ("\<^const>Groups.plus_class.plus"
###                     ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###                     ("\<^const>Groups.one_class.one"))))))
###           ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###             ("\<^const>Groups.plus_class.plus"
###               ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###               ("\<^const>Groups.one_class.one")))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Entry")
###         ("\<^const>List.list.Cons"
###           ("_tuple" ("\<^const>WCFG.w_node.Entry")
###             ("_tuple_args"
###               ("\<^const>BasicDefs.edge_kind.Predicate"
###                 ("_lambda" ("_position" s) ("_position" True)))
###               ("_tuple_arg"
###                 ("\<^const>WCFG.w_node.Node"
###                   ("\<^const>Groups.zero_class.zero")))))
###           ("\<^const>List.list.Cons"
###             ("_tuple"
###               ("\<^const>WCFG.w_node.Node"
###                 ("\<^const>Groups.zero_class.zero"))
###               ("_tuple_args"
###                 ("\<^const>BasicDefs.edge_kind.Predicate"
###                   ("_lambda" ("_position" s)
###                     ("\<^const>HOL.eq"
###                       ("_applC" ("_position" interpret)
###                         ("_cargs" ("_position" b) ("_position" s)))
###                       ("_applC" ("_position" Some) ("_position" false)))))
###                 ("_tuple_arg"
###                   ("\<^const>WCFG.label_incr"
###                     ("\<^const>WCFG.w_node.Node"
###                       ("\<^const>Groups.zero_class.zero"))
###                     ("\<^const>Com.num_inner_nodes"
###                       ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                         ("\<^const>Groups.one_class.one")))))))
###             ("\<^const>AdditionalLemmas.label_incrs" ("_position" asx)
###               ("\<^const>Com.num_inner_nodes"
###                 ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###                   ("\<^const>Groups.one_class.one"))))))
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8953name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6016name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24247name=haveelapsed=0.097
### Ambiguous input (line 503 of "~~/afp/thys/Slicing/While/AdditionalLemmas.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("\<^const>WCFG.w_node.Exit"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>AdditionalLemmas.path"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l))
###     ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("\<^const>WCFG.w_node.Exit")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>AdditionalLemmas.path" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l))
###       ("\<^const>AdditionalLemmas.label_incrs" ("_position" as)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("\<^const>WCFG.w_node.Exit"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6045name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=8031name=byelapsed=0.016
ML_statistics = :now=1464804855.51tasks_ready=1517tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=15size_allocation=3472883712size_allocation_free=1700763744size_heap=4150263808size_heap_free_last_full_GC=0size_heap_free_last_GC=3473259824threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=129.824time_GC=4.796user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24618name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=6118name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=12196name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8221name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=12619name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/Postdomination.thyoffset=23398name=byelapsed=0.127
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8317name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=12886name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8344name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=12953name=showelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8570name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=8671name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=18293name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14123name=withelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=9066name=byelapsed=0.139
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14352name=showelapsed=0.020
command_timing = :file=~~/src/HOL/Library/Sublist.thyoffset=13167name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14432name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=24637name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36558name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14567name=haveelapsed=0.024
### Ambiguous input (line 859 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32266name=byelapsed=0.010
### Ambiguous input (line 859 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=13960name=byelapsed=0.110
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36709name=showelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37134name=henceelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14977name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16044name=withelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37215name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36736name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16279name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36783name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37313name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=34583name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36783name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37442name=haveelapsed=0.016
### Ambiguous input (line 865 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 865 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48180name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=36974name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37541name=haveelapsed=0.016
### Ambiguous input (line 882 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 882 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37660name=withelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48274name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37828name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48403name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49584name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37860name=nextelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48439name=fromelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=37904name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49787name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48561name=showelapsed=0.016
### Ambiguous input (line 889 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### ("\<^const>HOL.Trueprop"
###   ("_Ball" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))
###     ("\<^const>HOL.eq"
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s) ("_position" V)))
###       ("_applC" ("_position" state_val)
###         ("_cargs" ("_position" s') ("_position" V))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 889 of "~~/afp/thys/Slicing/StaticIntra/Slice.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("\<^const>local.relevant_vars"
###       ("_applC" ("_position" S) ("_position" n)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Set.member" ("_position" V)
###     ("_applC" ("\<^const>local.relevant_vars" ("_position" S))
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49848name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48641name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=38036name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49932name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48717name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50060name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48811name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=35570name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=50395name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48943name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4001name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48977name=withelapsed=0.013
ML_statistics = :now=1464804856.01tasks_ready=1465tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=15size_allocation=3472883712size_allocation_free=1016146480size_heap=4150263808size_heap_free_last_full_GC=0size_heap_free_last_GC=3473259824threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=131.428time_GC=4.796user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49134name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4188name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=32382name=byelapsed=0.314
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4344name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/Basic/AuxLemmas.thyoffset=4474name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56786name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=61190name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62018name=proofelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=56980name=byelapsed=0.075
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=57718name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62108name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=72942name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62190name=fromelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=58180name=byelapsed=0.064
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=66800name=byelapsed=0.022
### Ambiguous input (line 405 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62334name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=67526name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14058name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62477name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=67729name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14164name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62559name=withelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14855name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14192name=nextelapsed=0.017
### Ambiguous input (line 410 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###     ("_position" n)))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l)) ("_position" et)
###       ("_position" n))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=74941name=byelapsed=0.064
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62729name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14903name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14234name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62989name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16490name=showelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14903name=obtainelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=14324name=thuselapsed=0.284
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63002name=caseelapsed=0.276
### Ambiguous input (line 432 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et'')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et'')
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et'')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et'')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("_position" l'')) ("_position" et'')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17087name=nextelapsed=0.288
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15045name=henceelapsed=0.296
### Ambiguous input (line 489 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et) ("_position" n))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("\<^const>Groups.one_class.one"))
###         ("_position" et) ("_position" n)))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63098name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19528name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17141name=henceelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15188name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63237name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15221name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17269name=showelapsed=0.016
### Ambiguous input (line 438 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 5 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1) ("_position" prog2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Seq" ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("\<^const>Com.num_inner_nodes" ("_position" prog1))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Seq" ("_position" prog1)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1)))
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63354name=fromelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17766name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15292name=haveelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63495name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18543name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9269name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=15427name=showelapsed=0.020
### Ambiguous input (line 523 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et) ("_position" n))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l''))
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" et) ("_position" n)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et) ("_position" n))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l''))
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" et) ("_position" n)))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et) ("_position" n))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63648name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=19896name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18598name=henceelapsed=0.039
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9853name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20523name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63761name=withelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18814name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=9999name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20577name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64057name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5361name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64057name=showelapsed=0.010
ML_statistics = :now=1464804856.74tasks_ready=1424tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=16size_allocation=3405774848size_allocation_free=3405774848size_heap=4153409536size_heap_free_last_full_GC=0size_heap_free_last_GC=3406219616threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=133.72time_GC=5.06user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10693name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10101name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5561name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10166name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=5975name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11336name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10283name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6154name=nextelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10325name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11405name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6240name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11547name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6334name=obtainelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22180name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22805name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6334name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11785name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6446name=fromelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=22951name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=12067name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23053name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6555name=obtainelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23119name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6555name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23655name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6970name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23236name=haveelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23278name=thuselapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7158name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18364name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=11125name=byelapsed=0.297
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24338name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24407name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18778name=showelapsed=0.054
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18778name=showelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=32837name=byelapsed=0.101
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24549name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18957name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29300name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19043name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24787name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=25092name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19137name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33172name=byelapsed=0.058
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19137name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19249name=fromelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29708name=showelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33368name=byelapsed=0.053
ML_statistics = :now=1464804857.24tasks_ready=1403tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=16size_allocation=3405774848size_allocation_free=2779452120size_heap=4153409536size_heap_free_last_full_GC=0size_heap_free_last_GC=3406219616threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=135.312time_GC=5.06user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29887name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19358name=obtainelapsed=0.036
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29971name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=33648name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19358name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19773name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30062name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=24127name=byelapsed=0.300
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30062name=obtainelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26295name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21450name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19961name=showelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30172name=fromelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26614name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21616name=byelapsed=0.010
### Rewrite rule not in simpset:
### ?n1 + 2 \<equiv> Suc (Suc ?n1)
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=26853name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=21693name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30279name=obtainelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22105name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=22403name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10845name=applyelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30279name=obtainelapsed=0.027
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27279name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18266name=byelapsed=0.041
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30691name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27460name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=27563name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30878name=showelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=10886name=byelapsed=0.067
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=18943name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=28200name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11923name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11490name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=28555name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11980name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23386name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29120name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23553name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12041name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=23630name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29368name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12160name=henceelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12275name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13156name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=29759name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8252name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12367name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=30056name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=13364name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=11327name=byelapsed=0.198
command_timing = :file=~~/afp/thys/Slicing/Basic/DynStandardControlDependence.thyoffset=12420name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24129name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/AdditionalLemmas.thyoffset=24464name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8964name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=14375name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=15494name=henceelapsed=0.024
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16302name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Distance.thyoffset=8867name=byelapsed=0.071
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49800name=byelapsed=0.010
ML_statistics = :now=1464804857.75tasks_ready=1290tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=16size_allocation=3405774848size_allocation_free=1216847496size_heap=4153409536size_heap_free_last_full_GC=0size_heap_free_last_GC=3406219616threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=138.468time_GC=5.06user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=15937name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=16005name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49960name=byelapsed=0.083
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16580name=haveelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=62911name=byelapsed=0.050
### Ambiguous input (line 477 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" true)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" true)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=49147name=byelapsed=0.122
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16630name=haveelapsed=0.031
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=63314name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17878name=haveelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16830name=showelapsed=0.016
### Ambiguous input (line 509 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 8 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" false)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" false)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" false)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" false)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one")))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" false)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###         ("\<^const>Groups.one_class.one")))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16865name=nextelapsed=0.021
### Ambiguous input (line 483 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("\<^const>Groups.one_class.one")))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.one_class.one"))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.one_class.one"))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.one_class.one"))
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("\<^const>Groups.one_class.one")))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20007name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17929name=haveelapsed=0.038
### Ambiguous input (line 564 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>WCFG.While_CFG" ("_position" prog')
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("\<^const>BasicDefs.edge_kind.Predicate"
###           ("_lambda" ("_position" s)
###             ("\<^const>HOL.eq"
###               ("_applC" ("_position" interpret)
###                 ("_cargs" ("_position" b) ("_position" s)))
###               ("_applC" ("_position" Some) ("_position" true)))))
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###     ("\<^const>BasicDefs.edge_kind.Predicate"
###       ("_lambda" ("_position" s)
###         ("\<^const>HOL.eq"
###           ("_applC" ("_position" interpret)
###             ("_cargs" ("_position" b) ("_position" s)))
###           ("_applC" ("_position" Some) ("_position" true)))))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))
###       ("\<^const>BasicDefs.edge_kind.Predicate"
###         ("_lambda" ("_position" s)
###           ("\<^const>HOL.eq"
###             ("_applC" ("_position" interpret)
###               ("_cargs" ("_position" b) ("_position" s)))
###             ("_applC" ("_position" Some) ("_position" true)))))
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=16911name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20057name=haveelapsed=0.029
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18165name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=17042name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=48584name=byelapsed=0.241
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18200name=nextelapsed=0.019
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20242name=showelapsed=0.019
### Ambiguous input (line 581 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et)
###       ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" et)
###     ("\<^const>WCFG.w_node.Node" ("\<^const>Groups.zero_class.zero"))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20697name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20277name=nextelapsed=0.019
### Ambiguous input (line 516 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 16 parse trees (10 displayed):
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###     ("\<^const>WCFG.While_CFG" ("_position" prog2)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l''))
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one"))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Groups.plus_class.plus"
###             ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###             ("\<^const>Groups.one_class.one")))
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l''))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Com.num_inner_nodes"
###           ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###             ("\<^const>Groups.one_class.one"))))
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("\<^const>WCFG.While_CFG" ("_position" prog2)
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("\<^const>Com.num_inner_nodes"
###             ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###               ("\<^const>Groups.one_class.one"))))
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l''))))
###     ("\<^const>Groups.plus_class.plus"
###       ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###       ("\<^const>Groups.one_class.one"))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###         ("_position" prog2))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("\<^const>Groups.plus_class.plus"
###           ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###           ("\<^const>Groups.one_class.one")))
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'')))
###     ("\<^const>Com.num_inner_nodes"
###       ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###         ("\<^const>Groups.one_class.one")))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.Cond" ("_position" b) ("_position" prog1)
###       ("_position" prog2))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("\<^const>Groups.plus_class.plus"
###         ("\<^const>Com.num_inner_nodes" ("_position" prog1))
###         ("\<^const>Groups.one_class.one")))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l''))
###       ("\<^const>Com.num_inner_nodes"
###         ("\<^const>Groups.plus_class.plus" ("_position" prog1)
###           ("\<^const>Groups.one_class.one"))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### Ambiguous input (line 571 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>WCFG.While_CFG" ("_position" prog')
###         ("\<^const>WCFG.label_incr" ("_position" n)
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l'))))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et) ("\<^const>WCFG.w_node.Node" ("_position" l')))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20825name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18278name=haveelapsed=0.040
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20354name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20860name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=18498name=showelapsed=0.014
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=64245name=byelapsed=0.059
### Ambiguous input (line 587 of "~~/afp/thys/Slicing/While/WCFG.thy") produces 4 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>Com.cmd.While" ("_position" b)
###       ("\<^const>WCFG.While_CFG" ("_position" prog')
###         ("\<^const>WCFG.label_incr"
###           ("\<^const>WCFG.w_node.Node" ("_position" l'))
###           ("_Numeral" ("_constify" ("_position" 2))))
###         ("_position" et) ("_position" n)))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>Com.cmd.While" ("_position" b)
###     ("\<^const>WCFG.While_CFG" ("_position" prog')
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et)
###       ("\<^const>WCFG.label_incr" ("_position" n)
###         ("_Numeral" ("_constify" ("_position" 2)))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.While_CFG"
###     ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###     ("\<^const>WCFG.label_incr"
###       ("\<^const>WCFG.w_node.Node" ("_position" l'))
###       ("_Numeral" ("_constify" ("_position" 2))))
###     ("_position" et)
###     ("\<^const>WCFG.label_incr" ("_position" n)
###       ("_Numeral" ("_constify" ("_position" 2))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>WCFG.label_incr"
###     ("\<^const>WCFG.While_CFG"
###       ("\<^const>Com.cmd.While" ("_position" b) ("_position" prog'))
###       ("\<^const>WCFG.label_incr"
###         ("\<^const>WCFG.w_node.Node" ("_position" l'))
###         ("_Numeral" ("_constify" ("_position" 2))))
###       ("_position" et) ("_position" n))
###     ("_Numeral" ("_constify" ("_position" 2)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20478name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=10123name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=20937name=haveelapsed=0.026
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6898name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=23075name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Slicing/While/WCFG.thyoffset=21061name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7002name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=7306name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=6117name=byelapsed=0.069
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19701name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=19805name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=30619name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=18920name=byelapsed=0.074
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/CDepInstantiations.thyoffset=29850name=byelapsed=0.073
ML_statistics = :now=1464804858.25tasks_ready=1053tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=16size_allocation=3405774848size_allocation_free=438206504size_heap=4153409536size_heap_free_last_full_GC=0size_heap_free_last_GC=3406219616threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=140.064time_GC=5.06user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Slicing/StaticIntra/Slice.thyoffset=15951name=byelapsed=0.081
ML_statistics = :now=1464804858.88tasks_ready=79tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=17size_allocation=3368026112size_allocation_free=2320931232size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=3368717840threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=142.324time_GC=5.224user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804859.39tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=17size_allocation=3368026112size_allocation_free=1870588328size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=3368717840threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=142.94time_GC=5.224user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804859.89tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=17size_allocation=3368026112size_allocation_free=1517113904size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=3368717840threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=143.34time_GC=5.224user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804860.39tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=17size_allocation=3368026112size_allocation_free=1164163888size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=3368717840threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=143.74time_GC=5.224user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804860.9tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=17size_allocation=3368026112size_allocation_free=473031768size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=3368717840threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=144.544time_GC=5.224user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804861.4tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=17size_allocation=3368026112size_allocation_free=122703232size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=3368717840threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=144.944time_GC=5.224user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804861.95tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=18size_allocation=3358588928size_allocation_free=3001270392size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=3359674768threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=145.484time_GC=5.296user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804862.46tasks_ready=0tasks_pending=0tasks_running=0tasks_passive=0tasks_urgent=0workers_total=8workers_active=0workers_waiting=0full_GCs=0partial_GCs=18size_allocation=3358588928size_allocation_free=2671913224size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=3359674768threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=145.884time_GC=5.296user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
Loading theory "Disjoin_Transform" (required by "WhileGraphSSA")
loading_theory = Disjoin_Transform
Loading theory "Serial_Rel"
loading_theory = Serial_Rel
Loading theory "While_Combinator_Exts"
loading_theory = While_Combinator_Exts
Loading theory "FormalSSA_Misc"
loading_theory = FormalSSA_Misc
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=168name=theoryelapsed=0.079
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=77name=theoryelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=152name=theoryelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=206name=definitionelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=151name=theoryelapsed=0.095
Proofs for inductive predicate(s) "subcmd"
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=669name=lemmaelapsed=0.020
### theory "While_Combinator_Exts"
### 0.148s elapsed time, 0.596s cpu time, 0.000s GC time
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=432name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=627name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=153name=inductiveelapsed=0.087
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=282name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1171name=haveelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1344name=fixelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1387name=henceelapsed=0.020
Found termination order:
  "(\<lambda>p. size (snd (snd (snd p)))) <*mlex*> {}"
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1511name=fixelapsed=0.018
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=393name=funelapsed=0.227
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=508name=funelapsed=0.157
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1554name=henceelapsed=0.022
### Ambiguous input (line 25 of "~~/afp/thys/Formal_SSA/Disjoin_Transform.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" maxVnameLen)
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))
###     ("_applC" ("_position" max)
###       ("_cargs" ("_applC" ("_position" length) ("_position" V))
###         ("_applC" ("_position" maxVnameLen_aux) ("_position" e))))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_Update" ("_position" maxVnameLen)
###       ("_updbind" ("_position" V) ("_position" e)))
###     ("_applC" ("_position" max)
###       ("_cargs" ("_applC" ("_position" length) ("_position" V))
###         ("_applC" ("_position" maxVnameLen_aux) ("_position" e))))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
### theory "Serial_Rel"
### 0.353s elapsed time, 1.500s cpu time, 0.000s GC time
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=7925name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1755name=henceelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=715name=byelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1932name=fixelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2037name=haveelapsed=0.021
ML_statistics = :now=1464804862.97tasks_ready=100tasks_pending=15tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=18size_allocation=3358588928size_allocation_free=1883981560size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=3359674768threads_in_ML=4threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=147.032time_GC=5.296user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=10201name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2099name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=1245name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=10629name=endelapsed=0.016
### theory "FormalSSA_Misc"
### 0.459s elapsed time, 1.944s cpu time, 0.000s GC time
Loading theory "Mapping_Exts"
loading_theory = Mapping_Exts
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2288name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=1479name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2425name=ultimatelyelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=1479name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2436name=showelapsed=0.018
Loading theory "Graph_path" (required by "SSA_CFG")
loading_theory = Graph_path
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=1569name=thuselapsed=0.022
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=705name=funelapsed=0.228
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=2082name=byelapsed=0.037
Proofs for inductive predicate(s) "newname"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=1178name=inductiveelapsed=0.060
### Ambiguous input (line 50 of "~~/afp/thys/Formal_SSA/Disjoin_Transform.thy") produces 2 parse trees:
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transform_aux)
###       ("_cargs" ("_position" V')
###         ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))))
###     ("\<^const>HOL.If"
###       ("\<^const>Set.member" ("_position" V)
###         ("_Update" ("_position" rhs)
###           ("_updbind" ("_position" V) ("_position" e))))
###       ("\<^const>Com.cmd.Seq"
###         ("\<^const>Com.cmd.LAss" ("_position" V') ("_position" e))
###         ("\<^const>Com.cmd.LAss" ("_position" V)
###           ("_applC" ("_position" Var) ("_position" V'))))
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))))
### ("\<^const>HOL.Trueprop"
###   ("\<^const>HOL.eq"
###     ("_applC" ("_position" transform_aux)
###       ("_cargs" ("_position" V')
###         ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))))
###     ("\<^const>HOL.If"
###       ("\<^const>Set.member" ("_position" V)
###         ("_applC" ("_position" rhs)
###           ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e))))
###       ("\<^const>Com.cmd.Seq"
###         ("\<^const>Com.cmd.LAss" ("_position" V') ("_position" e))
###         ("\<^const>Com.cmd.LAss" ("_position" V)
###           ("_applC" ("_position" Var) ("_position" V'))))
###       ("\<^const>Com.cmd.LAss" ("_position" V) ("_position" e)))))
### Fortunately, only one parse tree is well-formed and type-correct,
### but you may still want to disambiguate your grammar or your input.
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=196name=theoryelapsed=0.229
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=275name=lift_definitionelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=275name=lift_definitionelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=408name=lift_definitionelapsed=0.290
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=2232name=byelapsed=0.502
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=2386name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=559name=lift_definitionelapsed=0.048
Found termination order: "(\<lambda>p. size (snd p)) <*mlex*> {}"
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=2531name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=690name=lift_definitionelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=1879name=funelapsed=0.515
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=803name=lift_definitionelapsed=0.018
ML_statistics = :now=1464804863.72tasks_ready=157tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=19size_allocation=3360686080size_allocation_free=3360686080size_heap=4156555264size_heap_free_last_full_GC=0size_heap_free_last_GC=3362726312threads_in_ML=1threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=149.628time_GC=5.556user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=803name=lift_definitionelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=2734name=byelapsed=0.070
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=907name=definitionelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3042name=byelapsed=0.017
Found termination order: "size <*mlex*> {}"
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=2394name=funelapsed=0.139
### theory "Mapping_Exts"
### 0.840s elapsed time, 2.824s cpu time, 0.260s GC time
Loading theory "RBT_Mapping_Exts"
loading_theory = RBT_Mapping_Exts
### theory "Disjoin_Transform"
### 1.339s elapsed time, 4.936s cpu time, 0.260s GC time
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3445name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1303name=byelapsed=0.248
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3768name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3768name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3872name=thuselapsed=0.019
ML_statistics = :now=1464804864.23tasks_ready=178tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=19size_allocation=3360686080size_allocation_free=1818185376size_heap=4156555264size_heap_free_last_full_GC=0size_heap_free_last_GC=3362726312threads_in_ML=5threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=151.508time_GC=5.556user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4205name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4414name=letelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4467name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4467name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4509name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4933name=thuselapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5154name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=90name=theoryelapsed=0.533
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5154name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=1622name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5241name=showelapsed=0.020
### theory "RBT_Mapping_Exts"
### 0.586s elapsed time, 2.720s cpu time, 0.000s GC time
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5515name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1456name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5568name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6606name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6090name=showelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6606name=obtainelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6704name=obtainelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6704name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6806name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6806name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6966name=byelapsed=0.101
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6851name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=7162name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=7325name=byelapsed=0.307
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=872name=thuselapsed=0.020
ML_statistics = :now=1464804864.96tasks_ready=182tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=20size_allocation=3296722944size_allocation_free=3296722944size_heap=4160749568size_heap_free_last_full_GC=0size_heap_free_last_GC=3298153872threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=154.444time_GC=5.804user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=7506name=byelapsed=0.331
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=1623name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1171name=obtainelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=7877name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1171name=obtainelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1631name=obtainelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1315name=ultimatelyelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1631name=obtainelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1326name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1667name=letelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1712name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1804name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1921name=obtainelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1921name=obtainelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=2063name=henceelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=2206name=haveelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=2373name=finallyelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=2381name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8244name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8380name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8552name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8647name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8783name=thuselapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8828name=thuselapsed=0.022
ML_statistics = :now=1464804865.46tasks_ready=180tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=20size_allocation=3296722944size_allocation_free=2007868432size_heap=4160749568size_heap_free_last_full_GC=0size_heap_free_last_GC=3298153872threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=156.048time_GC=5.804user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=7991name=byelapsed=0.420
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9277name=applyelapsed=0.144
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9622name=applyelapsed=0.128
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9401name=byelapsed=0.127
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9985name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=10117name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2080name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9746name=byelapsed=0.153
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=10319name=applyelapsed=0.125
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2181name=byelapsed=0.080
ML_statistics = :now=1464804866.01tasks_ready=171tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=21size_allocation=3268411392size_allocation_free=3268411392size_heap=4171235328size_heap_free_last_full_GC=0size_heap_free_last_GC=3269540472threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=158.512time_GC=5.88user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=10420name=applyelapsed=0.299
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=10474name=byelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2411name=byelapsed=0.348
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=1653name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=1077name=applyelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2577name=applyelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/While_Combinator_Exts.thyoffset=2620name=byelapsed=0.073
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=1861name=byelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=2345name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=2597name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=2749name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=2823name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Mapping_Exts.thyoffset=2970name=byelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3100name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=4075name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3478name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3847name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3852name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4588name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3919name=qedelapsed=0.031
ML_statistics = :now=1464804866.51tasks_ready=135tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=21size_allocation=3268411392size_allocation_free=1988964944size_heap=4171235328size_heap_free_last_full_GC=0size_heap_free_last_GC=3269540472threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=160.112time_GC=5.88user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4611name=nextelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5198name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=333name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4653name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4697name=henceelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=632name=haveelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4797name=haveelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=799name=fixelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4871name=finallyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=811name=fixelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4879name=showelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=882name=henceelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=1866name=henceelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=1197name=noteelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=2166name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=1271name=showelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=2486name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=2699name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5621name=showelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6155name=showelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5680name=nextelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6178name=nextelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5720name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6250name=haveelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5782name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6327name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5782name=obtainelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5846name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6864name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=2398name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8879name=thuselapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8930name=nextelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Serial_Rel.thyoffset=1975name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=8964name=haveelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9019name=thuselapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3257name=showelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3504name=proofelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3318name=nextelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3644name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3362name=showelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3705name=nextelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3751name=showelapsed=0.021
ML_statistics = :now=1464804867.02tasks_ready=128tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=21size_allocation=3268411392size_allocation_free=1152016336size_heap=4171235328size_heap_free_last_full_GC=0size_heap_free_last_GC=3269540472threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=161.708time_GC=5.88user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4685name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=4917name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Disjoin_Transform.thyoffset=3863name=byelapsed=0.164
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=1128name=byelapsed=0.422
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=2207name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=1362name=applyelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=6278name=byelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=5859name=byelapsed=0.015
ML_statistics = :now=1464804867.67tasks_ready=109tasks_pending=13tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=22size_allocation=3282042880size_allocation_free=3282042880size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3283855752threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=163.324time_GC=6.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=9032name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/RBT_Mapping_Exts.thyoffset=2009name=byelapsed=0.610
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=312name=theoryelapsed=4.761
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=402name=hide_constelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=513name=definitionelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=581name=definitionelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=656name=definitionelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=921name=definitionelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=1126name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=1282name=lemmaelapsed=0.020
locale graph_pred_it_defs =
  fixes
    pred_list_it ::
      "'G \<Rightarrow> 'V \<Rightarrow> (('V \<times> 'W) list
    \<Rightarrow> bool)
   \<Rightarrow> ('V \<times> 'W
                  \<Rightarrow> ('V \<times> 'W) list
                                \<Rightarrow> ('V \<times> 'W) list)
                 \<Rightarrow> ('V \<times> 'W) list
                               \<Rightarrow> ('V \<times> 'W) list"
      
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=1379name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=1591name=definitionelapsed=0.026
locale graph_pred_it =
  fixes \<alpha> :: "'G \<Rightarrow> ('V, 'W) graph" 
    and invar :: "'G \<Rightarrow> bool" 
    and
    pred_list_it ::
      "'G \<Rightarrow> 'V \<Rightarrow> (('V \<times> 'W) list
    \<Rightarrow> bool)
   \<Rightarrow> ('V \<times> 'W
                  \<Rightarrow> ('V \<times> 'W) list
                                \<Rightarrow> ('V \<times> 'W) list)
                 \<Rightarrow> ('V \<times> 'W) list
                               \<Rightarrow> ('V \<times> 'W) list"
      
  assumes "graph_pred_it \<alpha> invar pred_list_it"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=1655name=localeelapsed=0.060
ML_statistics = :now=1464804868.17tasks_ready=0tasks_pending=12tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=22size_allocation=3282042880size_allocation_free=853690824size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=3283855752threads_in_ML=3threads_total=11threads_wait_condvar=6threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=166.212time_GC=6.028user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/FormalSSA_Misc.thyoffset=3190name=byelapsed=4.656
ML_statistics = :now=1464804868.83tasks_ready=0tasks_pending=14tasks_running=3tasks_passive=0tasks_urgent=0workers_total=8workers_active=3workers_waiting=0full_GCs=0partial_GCs=23size_allocation=3252682752size_allocation_free=3252682752size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=3253932920threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=167.272time_GC=6.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=2454name=recordelapsed=1.077
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=2592name=lemmaelapsed=0.010
locale Graph_path.StdGraphDefs =
  fixes ops :: "('V, 'W, 'G, 'm) Graph_path.graph_ops_scheme" 
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=2744name=localeelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=2893name=abbreviationelapsed=0.017
locale Graph_path.StdGraph =
  fixes ops :: "('a, 'b, 'c, 'd) Graph_path.graph_ops_scheme" 
  assumes "Graph_path.StdGraph ops"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=2969name=localeelapsed=0.087
ML_statistics = :now=1464804869.34tasks_ready=0tasks_pending=12tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=23size_allocation=3252682752size_allocation_free=2605421752size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=3253932920threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=168.156time_GC=6.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
locale graph_path_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=3055name=localeelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=3529name=definitionelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=3660name=definitionelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=3773name=definitionelapsed=0.038
Proofs for inductive predicate(s) "path"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=3969name=inductiveelapsed=0.087
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=4193name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=4351name=abbreviationelapsed=0.017
locale graph_path =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
  assumes "graph_path \<alpha>e \<alpha>n invar inEdges'"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=4412name=localeelapsed=0.089
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=4950name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=5478name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=5726name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=4845name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=5268name=showelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=5287name=byelapsed=0.010
ML_statistics = :now=1464804869.84tasks_ready=7tasks_pending=16tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=23size_allocation=3252682752size_allocation_free=2045872920size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=3253932920threads_in_ML=2threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=168.964time_GC=6.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=6946name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7248name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7450name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8201name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=6479name=byelapsed=0.106
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8718name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7886name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7011name=thuselapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7958name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8071name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8190name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7601name=byelapsed=0.076
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8402name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9117name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11046name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9436name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11444name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8491name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9178name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12741name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9671name=byelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14092name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=7072name=byelapsed=0.075
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14354name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9234name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10327name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18296name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10477name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18662name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19338name=lemmaelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10609name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20385name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22386name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22821name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10161name=byelapsed=0.201
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11006name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10873name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8558name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11236name=obtainelapsed=0.049
ML_statistics = :now=1464804870.35tasks_ready=31tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=23size_allocation=3252682752size_allocation_free=220046184size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=3253932920threads_in_ML=5threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=172.148time_GC=6.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
locale graph_Entry_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=24622name=localeelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8600name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11236name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=24883name=definitionelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=25022name=abbreviationelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8647name=showelapsed=0.412
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11344name=showelapsed=0.412
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11791name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12426name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11853name=haveelapsed=0.048
locale graph_Entry =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
  assumes "graph_Entry \<alpha>e \<alpha>n invar inEdges' Entry"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=25085name=localeelapsed=0.494
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12457name=haveelapsed=0.081
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11894name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10013name=byelapsed=0.902
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12569name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11938name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9202name=byelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12637name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30692name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11989name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12675name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32599name=definitionelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12116name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12968name=showelapsed=0.102
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14281name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32715name=definitionelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15687name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12179name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=9265name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14694name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32821name=definitionelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12263name=thuselapsed=0.048
ML_statistics = :now=1464804871.21tasks_ready=54tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=24size_allocation=3217031168size_allocation_free=2306971232size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3218447456threads_in_ML=5threads_total=11threads_wait_condvar=4threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=174.54time_GC=6.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16752name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15998name=byelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35565name=definitionelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17302name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16587name=showelapsed=0.079
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17106name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37093name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17650name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39304name=lemmaelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17154name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18528name=byelapsed=0.092
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40379name=lemmaelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17740name=obtainelapsed=0.054
Proofs for inductive predicate(s) "EntryPath"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17165name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10551name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17740name=obtainelapsed=0.048
  Proving monotonicity ...
  Proving the introduction rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18862name=obtainelapsed=0.047
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40922name=inductiveelapsed=0.098
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17848name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19650name=obtainelapsed=0.058
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19008name=obtainelapsed=0.051
### theory "Graph_path"
### 8.430s elapsed time, 28.500s cpu time, 1.248s GC time
Loading theory "SSA_CFG"
loading_theory = SSA_CFG
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10682name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19008name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19650name=obtainelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20643name=letelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19782name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19138name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20676name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19873name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=81name=theoryelapsed=0.114
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22565name=obtainelapsed=0.058
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19873name=obtainelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22994name=obtainelapsed=0.046
locale CFG_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=187name=localeelapsed=0.040
ML_statistics = :now=1464804871.71tasks_ready=82tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=24size_allocation=3217031168size_allocation_free=1603679488size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3218447456threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=176.348time_GC=6.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22707name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=547name=definitionelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23134name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20011name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22777name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20103name=showelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23201name=showelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=608name=definitionelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=742name=definitionelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=24286name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23620name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23957name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8570name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23620name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23957name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23722name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=24060name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=8659name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=24173name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11875name=byelapsed=0.032
locale CFG =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes "CFG \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=859name=localeelapsed=0.193
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11362name=byelapsed=0.204
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=25948name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26207name=haveelapsed=0.049
locale CFG =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes "CFG \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2132name=contextelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26726name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26330name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26726name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26376name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26814name=obtainelapsed=0.049
ML_statistics = :now=1464804872.21tasks_ready=91tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=24size_allocation=3217031168size_allocation_free=1127516088size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3218447456threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=177.94time_GC=6.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26429name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12538name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26814name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11827name=byelapsed=0.338
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26919name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=27454name=obtainelapsed=0.049
locale CFG_wf =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes "CFG_wf \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2938name=localeelapsed=0.191
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=27746name=byelapsed=0.075
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=27454name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28123name=showelapsed=0.044
locale CFG_SSA_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=3496name=localeelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=11949name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28160name=fixelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=27547name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=3904name=definitionelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=3959name=definitionelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28743name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28233name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29646name=haveelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29702name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28291name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28792name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=4019name=definitionelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=4199name=definitionelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28291name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28792name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29981name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=4258name=definitionelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28383name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28905name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30071name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=4336name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28438name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28963name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30171name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28511name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28963name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30202name=henceelapsed=0.039
ML_statistics = :now=1464804872.72tasks_ready=97tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=24size_allocation=3217031168size_allocation_free=568260896size_heap=4132438016size_heap_free_last_full_GC=0size_heap_free_last_GC=3218447456threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=179.544time_GC=6.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29055name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30248name=ultimatelyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30476name=obtainelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29122name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30259name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30476name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29197name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30573name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30925name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30627name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29254name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12059name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12724name=byelapsed=0.020
locale CFG_SSA =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
  assumes "CFG_SSA \<alpha>e \<alpha>n invar inEdges' Entry defs uses phis"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=4569name=localeelapsed=0.257
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29359name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32437name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=5939name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=12210name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6489name=lemmaelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13037name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32494name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14762name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13105name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32563name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15105name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13172name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16262name=henceelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15132name=letelapsed=0.318
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13267name=haveelapsed=0.334
locale CFG_SSA_wf_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10078name=localeelapsed=0.330
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16340name=thuselapsed=0.338
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15162name=letelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13326name=henceelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10654name=definitionelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10777name=abbreviationelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15200name=haveelapsed=0.044
ML_statistics = :now=1464804873.45tasks_ready=127tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=25size_allocation=3121610752size_allocation_free=3121610752size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3122856112threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=182.212time_GC=6.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16457name=haveelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10858name=abbreviationelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13380name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15271name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16511name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10950name=definitionelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13471name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10998name=definitionelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15271name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34367name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13545name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=11074name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15378name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34494name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13663name=ultimatelyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34673name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=11216name=definitionelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15421name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13674name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=11289name=definitionelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34909name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15486name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13699name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17028name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=11354name=definitionelapsed=0.043
Proofs for inductive predicate(s) "liveVal"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34909name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13727name=thuselapsed=0.047
  Proving monotonicity ...
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35033name=haveelapsed=0.049
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35865name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=11611name=inductiveelapsed=0.087
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35096name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35865name=obtainelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=11804name=definitionelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35169name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35949name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35519name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35949name=obtainelapsed=0.047
ML_statistics = :now=1464804873.95tasks_ready=147tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=25size_allocation=3121610752size_allocation_free=2762837304size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3122856112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=183.756time_GC=6.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35530name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36109name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36478name=byelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36109name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36677name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36260name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16626name=byelapsed=0.399
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36677name=obtainelapsed=0.042
locale CFG_SSA_wf =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
  assumes
    "CFG_SSA_wf \<alpha>e \<alpha>n invar inEdges' Entry defs uses phis"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=12022name=localeelapsed=0.273
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36356name=ultimatelyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36791name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37308name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36367name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36845name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37308name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38614name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15839name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36928name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37426name=letelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16390name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16733name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38614name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37008name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37482name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18979name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38712name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37061name=finallyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20013name=lemmaelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37519name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20489name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38712name=obtainelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37069name=showelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20690name=lemmaelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37674name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38898name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39131name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17661name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37836name=haveelapsed=0.049
ML_statistics = :now=1464804874.45tasks_ready=185tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=25size_allocation=3121610752size_allocation_free=2263556264size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3122856112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=185.364time_GC=6.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39226name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39476name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40297name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37962name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39476name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40586name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37962name=obtainelapsed=0.048
locale CFG_SSA_Transformed_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=27059name=localeelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39607name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40621name=ultimatelyelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38105name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40632name=haveelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39607name=obtainelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38181name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40682name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39724name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38375name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40758name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39831name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38430name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40855name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40091name=finallyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10562name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40099name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17936name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41304name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41338name=qedelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41533name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17991name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19103name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18027name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41728name=obtainelapsed=0.049
locale CFG_SSA_Transformed =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
  assumes
    "CFG_SSA_Transformed \<alpha>e \<alpha>n invar inEdges' Entry oldDefs
      oldUses defs uses phis var"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=27669name=localeelapsed=0.363
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42593name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=28849name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18027name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41728name=obtainelapsed=0.041
ML_statistics = :now=1464804874.95tasks_ready=197tasks_pending=12tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=25size_allocation=3121610752size_allocation_free=1507811080size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3122856112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=188.564time_GC=6.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29026name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42889name=henceelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41814name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18153name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31062name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=10693name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42913name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18226name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33598name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19206name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34186name=lemmaelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42982name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20763name=showelapsed=0.044
### theory "SSA_CFG"
### 3.558s elapsed time, 13.324s cpu time, 0.268s GC time
Loading theory "Construct_SSA"
loading_theory = Construct_SSA
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22789name=byelapsed=0.045
Loading theory "Minimality"
loading_theory = Minimality
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23213name=byelapsed=0.039
Loading theory "SSA_CFG_code" (required by "SSA_Transfer_Rules" via "Construct_SSA_code")
loading_theory = SSA_CFG_code
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20811name=nextelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20838name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=137name=theoryelapsed=0.108
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20907name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20907name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21022name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21022name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21135name=obtainelapsed=0.052
ML_statistics = :now=1464804875.45tasks_ready=254tasks_pending=9tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=25size_allocation=3121610752size_allocation_free=1076399872size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3122856112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=190.14time_GC=6.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21135name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21286name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=264name=theoryelapsed=0.398
locale graph_path =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
  assumes "graph_path \<alpha>e \<alpha>n invar inEdges'"
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=316name=contextelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21375name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=86name=theoryelapsed=0.447
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=186name=definitionelapsed=0.023
locale CFG_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=443name=contextelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21458name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=396name=definitionelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=468name=definitionelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21469name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=650name=definitionelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2722name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=660name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=773name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21570name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=773name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1196name=definitionelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20170name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1371name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3311name=definitionelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20239name=showelapsed=0.050
locale CFG =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes "CFG \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2552name=contextelapsed=0.065
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20289name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=23734name=byelapsed=0.012
locale CFG_SSA_Transformed =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
  assumes
    "CFG_SSA_Transformed \<alpha>e \<alpha>n invar inEdges' Entry oldDefs
      oldUses defs uses phis var"
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3420name=contextelapsed=0.119
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2572name=lift_definitionelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=24185name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3797name=lemmaelapsed=0.010
ML_statistics = :now=1464804875.96tasks_ready=296tasks_pending=9tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=25size_allocation=3121610752size_allocation_free=608204904size_heap=4155506688size_heap_free_last_full_GC=0size_heap_free_last_GC=3122856112threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=191.74time_GC=6.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=1784name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3675name=definitionelapsed=0.047
locale CFG_SSA_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3990name=contextelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3791name=abbreviationelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4019name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=1955name=byelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3873name=definitionelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2119name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=25959name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4147name=definitionelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4293name=lemmaelapsed=0.443
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=4188name=definitionelapsed=0.483
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=4494name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2616name=haveelapsed=0.490
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7262name=lemmaelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4917name=definitionelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12603name=lemmaelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=5083name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13899name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2673name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16639name=lemmaelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2673name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17256name=lemmaelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2771name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23290name=lemmaelapsed=0.012
locale CFG_SSA =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
  assumes "CFG_SSA \<alpha>e \<alpha>n invar inEdges' Entry defs uses phis"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=6773name=contextelapsed=0.096
### theory "Minimality"
### 1.594s elapsed time, 5.004s cpu time, 0.424s GC time
Loading theory "Construct_SSA_notriv"
loading_theory = Construct_SSA_notriv
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=2815name=showelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=261name=datatypeelapsed=1.589
instantiation
  Def :: linorder
  less_eq_Def == less_eq :: Def \<Rightarrow> Def \<Rightarrow> bool
  less_Def == less :: Def \<Rightarrow> Def \<Rightarrow> bool
locale CFG_SSA_ext_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=6902name=localeelapsed=0.073
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=7337name=abbreviationelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=391name=definitionelapsed=0.043
ML_statistics = :now=1464804876.87tasks_ready=314tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=26size_allocation=3106930688size_allocation_free=3106930688size_heap=4130340864size_heap_free_last_full_GC=0size_heap_free_last_GC=3108283328threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=193.064time_GC=7.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=7806name=definitionelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26875name=byelapsed=0.102
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=160name=theoryelapsed=0.114
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=441name=definitionelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=26448name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=27560name=byelapsed=0.033
locale CFG_SSA_Transformed_notriv_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=260name=localeelapsed=0.094
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29571name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=940name=abbreviationelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=1013name=abbreviationelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29720name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=1082name=definitionelapsed=0.042
locale CFG_Construct =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes "CFG_Construct \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=594name=localeelapsed=0.164
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=1155name=definitionelapsed=0.044
locale CFG_SSA_ext =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
  assumes
    "CFG_SSA_ext \<alpha>e \<alpha>n invar inEdges' Entry defs uses phis"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=7879name=localeelapsed=0.256
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=1235name=definitionelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=1292name=definitionelapsed=0.051
locale CFG_SSA_base_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=8527name=localeelapsed=0.093
ML_statistics = :now=1464804877.37tasks_ready=313tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=26size_allocation=3106930688size_allocation_free=1320389296size_heap=4130340864size_heap_free_last_full_GC=0size_heap_free_last_GC=3108283328threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=196.228time_GC=7.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
Found termination order:
  "(\<lambda>p. length (fst (snd (snd p)))) <*mlex*> {}"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=956name=funelapsed=0.441
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=1300name=definitionelapsed=0.047
locale CFG_SSA_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
  assumes
    "CFG_SSA_code \<alpha>e \<alpha>n invar inEdges' Entry defs uses phis"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=9440name=localeelapsed=0.333
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=1466name=definitionelapsed=0.039
locale CFG_SSA_Transformed_notriv =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
  assumes
    "CFG_SSA_Transformed_notriv \<alpha>e \<alpha>n invar inEdges' Entry
      oldDefs oldUses defs uses phis var chooseNext_all"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=1436name=localeelapsed=0.396
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=1541name=abbreviationelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=9981name=definitionelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=1630name=abbreviationelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=10934name=lemmaelapsed=0.013
locale CFG_SSA_wf =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
  assumes
    "CFG_SSA_wf \<alpha>e \<alpha>n invar inEdges' Entry defs uses phis"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7667name=contextelapsed=0.114
locale CFG_SSA_wf_base_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=12724name=localeelapsed=0.140
Proofs for inductive predicate(s) "liveVal'"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=13282name=definitionelapsed=0.040
  Proving monotonicity ...
ML_statistics = :now=1464804877.87tasks_ready=333tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=26size_allocation=3106930688size_allocation_free=413880328size_heap=4130340864size_heap_free_last_full_GC=0size_heap_free_last_GC=3108283328threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=197.824time_GC=7.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=13363name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7694name=inductiveelapsed=0.100
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30101name=byelapsed=0.848
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7912name=lemmaelapsed=0.304
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=13500name=definitionelapsed=0.344
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28487name=byelapsed=0.334
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9441name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=28529name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=1743name=functionelapsed=0.645
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30289name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=29171name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=1743name=functionelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2048name=terminationelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=30979name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2187name=definitionelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31030name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2306name=definitionelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31041name=fixelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2417name=definitionelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2721name=abbreviationelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2867name=lemmaelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31107name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4066name=abbreviationelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31107name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6646name=lemmaelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7829name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31184name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8159name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8747name=lemmaelapsed=0.024
locale CFG_SSA_step =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
    and g :: "'g" 
  assumes
    "CFG_SSA_step \<alpha>e \<alpha>n invar inEdges' Entry oldDefs oldUses
      defs uses phis var chooseNext_all g"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9733name=localeelapsed=0.405
ML_statistics = :now=1464804878.66tasks_ready=351tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=27size_allocation=3017801728size_allocation_free=2228071568size_heap=4147118080size_heap_free_last_full_GC=0size_heap_free_last_GC=3018981720threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=200.124time_GC=7.536user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31184name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=10470name=abbreviationelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9749name=lemmaelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=10510name=abbreviationelapsed=0.019
locale CFG_SSA_wf_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
  assumes
    "CFG_SSA_wf_code \<alpha>e \<alpha>n invar inEdges' Entry defs uses
      phis"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=13567name=localeelapsed=0.471
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=10242name=lemmaelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31312name=haveelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=10551name=sublocaleelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=10651name=lemmaelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11359name=lemmaelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31373name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=10551name=sublocaleelapsed=0.073
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31443name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=13231name=lemmaelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32109name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11483name=sublocaleelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14169name=lemmaelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11483name=sublocaleelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32120name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32360name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15269name=sublocaleelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15439name=sublocaleelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=5574name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15269name=sublocaleelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15439name=sublocaleelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=5693name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16498name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15990name=declareelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=5768name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24027name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=5928name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16023name=declareelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24904name=sublocaleelapsed=0.027
ML_statistics = :now=1464804879.17tasks_ready=396tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=27size_allocation=3017801728size_allocation_free=1369030208size_heap=4147118080size_heap_free_last_full_GC=0size_heap_free_last_GC=3018981720threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=201.724time_GC=7.536user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6110name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24904name=sublocaleelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6157name=henceelapsed=0.051
locale CFG_SSA_Transformed_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
  assumes
    "CFG_SSA_Transformed_code \<alpha>e \<alpha>n invar inEdges' Entry
      oldDefs oldUses defs uses phis var"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=15739name=localeelapsed=0.526
### theory "SSA_CFG_code"
### 4.142s elapsed time, 14.184s cpu time, 0.724s GC time
locale CFG_Construct =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes "CFG_Construct \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16071name=contextelapsed=0.133
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6235name=haveelapsed=0.050
locale CFG_SSA_Transformed_notriv_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28927name=contextelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16366name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16961name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28975name=abbreviationelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6689name=obtainelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6312name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29125name=abbreviationelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19752name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29172name=interpretationelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6689name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6360name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20964name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29172name=interpretationelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13077name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22523name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6889name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23214name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=7453name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=7573name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29338name=definitionelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14823name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=7847name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29415name=definitionelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13156name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14861name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29564name=definitionelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8011name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14912name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8307name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29640name=definitionelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14972name=haveelapsed=0.047
ML_statistics = :now=1464804879.67tasks_ready=412tasks_pending=8tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=27size_allocation=3017801728size_allocation_free=629106288size_heap=4147118080size_heap_free_last_full_GC=0size_heap_free_last_GC=3018981720threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=203.316time_GC=7.536user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29693name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8699name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=29747name=lemmaelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15056name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30150name=lemmaelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8756name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13241name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8756name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9141name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8859name=haveelapsed=0.380
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9141name=obtainelapsed=0.376
locale CFG_Construct_wf =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes
    "CFG_Construct_wf \<alpha>e \<alpha>n invar inEdges' Entry defs uses"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=24870name=localeelapsed=0.686
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8903name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9229name=obtainelapsed=0.053
locale CFG_SSA_Transformed_notriv =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
  assumes
    "CFG_SSA_Transformed_notriv \<alpha>e \<alpha>n invar inEdges' Entry
      oldDefs oldUses defs uses phis var chooseNext_all"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30593name=contextelapsed=0.502
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16314name=byelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27314name=sublocaleelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31203name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9229name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13310name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31806name=lemmaelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27314name=sublocaleelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13364name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31806name=lemmaelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9290name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13420name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27801name=sublocaleelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27801name=sublocaleelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=16556name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33347name=sublocaleelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9607name=showelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28233name=lemmaelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13529name=byelapsed=0.037
### theory "Construct_SSA"
### 5.321s elapsed time, 17.888s cpu time, 1.048s GC time
Loading theory "SSA_Semantics"
loading_theory = SSA_Semantics
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9751name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34391name=byelapsed=0.040
Loading theory "Construct_SSA_code" (required by "SSA_Transfer_Rules")
loading_theory = Construct_SSA_code
ML_statistics = :now=1464804880.45tasks_ready=426tasks_pending=6tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=28size_allocation=2988441600size_allocation_free=2988441600size_heap=4143972352size_heap_free_last_full_GC=0size_heap_free_last_GC=2989021792threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=204.928time_GC=7.86user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9751name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33347name=sublocaleelapsed=0.142
### theory "Construct_SSA_notriv"
### 3.761s elapsed time, 13.020s cpu time, 0.624s GC time
Loading theory "Construct_SSA_notriv_code"
loading_theory = Construct_SSA_notriv_code
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=118name=theoryelapsed=0.099
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9845name=showelapsed=0.048
locale CFG_SSA_Transformed =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
  assumes
    "CFG_SSA_Transformed \<alpha>e \<alpha>n invar inEdges' Entry oldDefs
      oldUses defs uses phis var"
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=219name=contextelapsed=0.117
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=280name=definitionelapsed=0.041
Proofs for inductive predicate(s) "bs"
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=432name=inductiveelapsed=0.116
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=602name=definitionelapsed=0.050
Proofs for inductive predicate(s) "ssaBS"
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13637name=byelapsed=0.388
ML_statistics = :now=1464804880.96tasks_ready=434tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=28size_allocation=2988441600size_allocation_free=1617723752size_heap=4143972352size_heap_free_last_full_GC=0size_heap_free_last_GC=2989021792threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=208.132time_GC=7.86user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15398name=byelapsed=0.031
  Proving monotonicity ...
  Proving the introduction rules ...
  Proving the elimination rules ...
  Proving the induction rule ...
  Proving the simplification rules ...
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_code.thyoffset=146name=theoryelapsed=0.533
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=876name=inductiveelapsed=0.149
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_code.thyoffset=273name=definitionelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1933name=lemmaelapsed=0.015
### theory "SSA_Semantics"
### 0.644s elapsed time, 2.576s cpu time, 0.000s GC time
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13687name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34979name=byelapsed=0.065
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15499name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34508name=byelapsed=0.262
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13788name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35129name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13863name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35268name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13903name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35268name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13970name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35452name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14023name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36203name=byelapsed=0.041
ML_statistics = :now=1464804881.47tasks_ready=434tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=28size_allocation=2988441600size_allocation_free=976796400size_heap=4143972352size_heap_free_last_full_GC=0size_heap_free_last_GC=2989021792threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=209.728time_GC=7.86user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=153name=theoryelapsed=0.903
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=12738name=applyelapsed=0.060
locale CFG_SSA_Transformed_notriv_base =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=305name=contextelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13805name=showelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=12786name=applyelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=353name=definitionelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=12869name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37388name=byelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36379name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=452name=definitionelapsed=0.043
locale CFG_Construct_linorder =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
  assumes
    "CFG_Construct_linorder \<alpha>e \<alpha>n invar inEdges' Entry defs
      uses"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_code.thyoffset=357name=localeelapsed=0.599
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=14826name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15232name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=556name=definitionelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=14912name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15278name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38658name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15654name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16022name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15693name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16022name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15798name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16152name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15809name=showelapsed=0.045
locale CFG_SSA_Transformed_notriv_base_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val, 'val list) mapping
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=901name=localeelapsed=0.230
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=36971name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16229name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=1745name=definitionelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16588name=obtainelapsed=0.049
ML_statistics = :now=1464804881.97tasks_ready=433tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=28size_allocation=2988441600size_allocation_free=300265576size_heap=4143972352size_heap_free_last_full_GC=0size_heap_free_last_GC=2989021792threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=211.316time_GC=7.86user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16325name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=1804name=definitionelapsed=0.363
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16588name=obtainelapsed=0.354
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16940name=obtainelapsed=0.360
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=2188name=definitionelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16650name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16940name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=2702name=definitionelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17477name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17073name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=2880name=definitionelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17477name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17159name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=3187name=definitionelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17548name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17272name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17548name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=3625name=definitionelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18076name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17664name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=3882name=definitionelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18076name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=3988name=definitionelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17735name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18169name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17788name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=4147name=definitionelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18243name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37507name=byelapsed=0.010
ML_statistics = :now=1464804882.75tasks_ready=456tasks_pending=5tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=29size_allocation=2936012800size_allocation_free=2331985232size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2937487104threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=213.88time_GC=8.16user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17859name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18459name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19237name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18537name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19237name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18537name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19369name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18650name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19452name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18661name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_code.thyoffset=824name=functionelapsed=1.382
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19568name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18758name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18758name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38821name=byelapsed=0.103
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18882name=thuselapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_code.thyoffset=824name=functionelapsed=0.169
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19808name=obtainelapsed=0.052
### theory "Construct_SSA_code"
### 2.716s elapsed time, 9.920s cpu time, 0.300s GC time
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37640name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20236name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19808name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20236name=obtainelapsed=0.048
ML_statistics = :now=1464804883.26tasks_ready=464tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=29size_allocation=2936012800size_allocation_free=1748190104size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2937487104threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=215.476time_GC=8.16user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19951name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21108name=proofelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20351name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21207name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20351name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20451name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21207name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21422name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24535name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21526name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24647name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24647name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22073name=obtainelapsed=0.056
locale CFG_SSA_Transformed_notriv_linorder =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
  assumes
    "CFG_SSA_Transformed_notriv_linorder \<alpha>e \<alpha>n invar inEdges'
      Entry oldDefs oldUses defs uses phis var chooseNext_all"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=4426name=localeelapsed=0.838
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24746name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22073name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24801name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22304name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24801name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22304name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24928name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22440name=showelapsed=0.045
ML_statistics = :now=1464804883.77tasks_ready=477tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=29size_allocation=2936012800size_allocation_free=1182408576size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2937487104threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=217.076time_GC=8.16user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38917name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39171name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20639name=byelapsed=0.611
### Rule already declared as introduction (intro)
### \<lbrakk>?v \<in> allUses ?g ?n; ?n \<in> set (\<alpha>n ?g)\<rbrakk>
### \<Longrightarrow> ?v \<in> allVars ?g
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25573name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=37884name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25319name=byelapsed=0.108
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25620name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26596name=byelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39239name=byelapsed=0.021
### Rule already declared as introduction (intro)
### \<lbrakk>?v \<in> allDefs ?g ?n; ?n \<in> set (\<alpha>n ?g)\<rbrakk>
### \<Longrightarrow> ?v \<in> allVars ?g
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26842name=byelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38065name=byelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39670name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38156name=byelapsed=0.018
locale CFG_SSA_Transformed_notriv_linorder =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and
    phis ::
      "'g \<Rightarrow> 'node \<times> 'val \<Rightarrow> 'val list option" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val \<Rightarrow> 'val list option)
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
  assumes
    "CFG_SSA_Transformed_notriv_linorder \<alpha>e \<alpha>n invar inEdges'
      Entry oldDefs oldUses defs uses phis var chooseNext_all"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=6704name=contextelapsed=0.378
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38232name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=6756name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39909name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=39993name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40609name=byelapsed=0.218
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=38442name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40879name=byelapsed=0.294
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40037name=thuselapsed=0.331
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=17949name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41315name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41777name=byelapsed=0.014
ML_statistics = :now=1464804884.54tasks_ready=454tasks_pending=4tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=30size_allocation=2887778304size_allocation_free=2887778304size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2889207080threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=219.676time_GC=8.44user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41550name=byelapsed=0.108
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29015name=byelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=40656name=byelapsed=0.711
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29317name=byelapsed=0.146
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29201name=byelapsed=0.251
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29600name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29696name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29743name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29783name=thuselapsed=0.044
ML_statistics = :now=1464804885.04tasks_ready=450tasks_pending=4tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=30size_allocation=2887778304size_allocation_free=1920111200size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2889207080threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=221.08time_GC=8.44user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41877name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41902name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42901name=byelapsed=0.281
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18176name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=41959name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31273name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42033name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31273name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42121name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31392name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42250name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32677name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42261name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33017name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33425name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42604name=byelapsed=0.969
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33028name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33506name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=18239name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=19240name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33141name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33933name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34546name=fixelapsed=0.043
ML_statistics = :now=1464804885.55tasks_ready=456tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=30size_allocation=2887778304size_allocation_free=1269316832size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2889207080threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=222.676time_GC=8.44user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33196name=ultimatelyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34006name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34689name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33207name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34102name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34790name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43047name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34113name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20776name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43095name=nextelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34790name=obtainelapsed=0.047
locale CFG_SSA_Transformed_notriv_linorder_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val, 'val list) mapping
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
  assumes
    "CFG_SSA_Transformed_notriv_linorder_code \<alpha>e \<alpha>n invar
      inEdges' Entry oldDefs oldUses defs uses phis var chooseNext_all"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7775name=localeelapsed=1.702
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20863name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34905name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20975name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43128name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21088name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34916name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43128name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21334name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21426name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43307name=fixelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35078name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21556name=byelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43379name=henceelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35177name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35201name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2648name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43503name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35230name=letelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2921name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43514name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35260name=assumeelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1028name=applyelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3121name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1094name=applyelapsed=0.031
ML_statistics = :now=1464804886.06tasks_ready=456tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=30size_allocation=2887778304size_allocation_free=380475208size_heap=4145020928size_heap_free_last_full_GC=0size_heap_free_last_GC=2889207080threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=225.864time_GC=8.44user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35597name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21649name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35597name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21923name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1185name=byelapsed=0.080
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1616name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35727name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21989name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2080name=fixelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22035name=showelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35727name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=20325name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2831name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2097name=haveelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35841name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2097name=haveelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35841name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3248name=fixelapsed=0.067
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2446name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35949name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3263name=haveelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3564name=noteelapsed=0.170
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37135name=henceelapsed=0.216
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3606name=showelapsed=0.058
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3954name=byelapsed=0.292
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4448name=haveelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37210name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4774name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=4944name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7483name=haveelapsed=0.047
ML_statistics = :now=1464804886.7tasks_ready=462tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=31size_allocation=2839543808size_allocation_free=2839543808size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2839961968threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=227.2time_GC=8.604user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12793name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5178name=fixelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7516name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12793name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5367name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7625name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12845name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5578name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7715name=obtainelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13726name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5578name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7715name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13726name=obtainelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5791name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8048name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13820name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=5351name=haveelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5902name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8150name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=5840name=fixelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5996name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8264name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5996name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8336name=fixelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=5855name=haveelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=6263name=noteelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6134name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=6322name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8620name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14164name=proofelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6910name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11176name=obtainelapsed=0.049
ML_statistics = :now=1464804887.21tasks_ready=482tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=31size_allocation=2839543808size_allocation_free=2452034040size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2839961968threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=228.788time_GC=8.604user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14268name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6985name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11176name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14317name=showelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7051name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11260name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17003name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7062name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11315name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17159name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7177name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11398name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17672name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7207name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12246name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7218name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17729name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12293name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17729name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23500name=letelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12304name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19324name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23664name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12575name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19324name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23664name=obtainelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43191name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20406name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=7482name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23776name=henceelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=7614name=byelapsed=0.019
ML_statistics = :now=1464804887.71tasks_ready=489tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=31size_allocation=2839543808size_allocation_free=2043427424size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2839961968threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=230.38time_GC=8.604user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=8450name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24252name=letelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=9202name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=2739name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24279name=letelapsed=0.049
### Metis: Unused theorems: "Construct_SSA.Def.distinct_1", "local.less_Def_def", "Construct_SSA.Def.exhaust"
### Metis: Unused theorems: "Construct_SSA.Def.distinct_1"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3079name=showelapsed=0.048
### Metis: Unused theorems: "Construct_SSA.Def.exhaust"
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24307name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=10468name=haveelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=506name=byelapsed=0.179
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24382name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=10882name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3406name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29972name=fixelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5547name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3406name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30162name=letelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5720name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3538name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30191name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5983name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3572name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=11135name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30221name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4189name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=11464name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=11477name=haveelapsed=0.018
*** Type unification failed: Variable 'a::type not of sort linorder
*** 
*** Type error in application: incompatible operand type
*** 
*** Operator:  RBT.filter ::
***   (??'a \<Rightarrow> ??'b \<Rightarrow> bool)
***   \<Rightarrow> (??'a, ??'b) RBT.rbt \<Rightarrow> (??'a, ??'b) RBT.rbt
*** Operand:   \<lambda>v'. v' \<noteq> v :: 'a \<Rightarrow> bool
*** 
*** Coercion Inference:
*** 
*** Local coercion insertion on the operand failed:
*** Variable 'a::type not of sort linorder
*** 
*** Now trying to infer coercions globally.
*** 
*** Coercion inference failed:
*** weak unification of subtype constraints fails
*** Clash of types "_ \<Rightarrow> _" and "bool"
*** 
*** At command "have" (line 273 of "~~/afp/thys/Formal_SSA/SSA_CFG_code.thy")
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30297name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4684name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=12520name=applyelapsed=0.037
*** Type unification failed: Variable 'a::type not of sort linorder
*** 
*** Type error in application: incompatible operand type
*** 
*** Operator:  RBT.filter ::
***   (??'a \<Rightarrow> ??'b \<Rightarrow> bool)
***   \<Rightarrow> (??'a, ??'b) RBT.rbt \<Rightarrow> (??'a, ??'b) RBT.rbt
*** Operand:   \<lambda>v'. v' \<noteq> v :: 'a \<Rightarrow> bool
*** 
*** Coercion Inference:
*** 
*** Local coercion insertion on the operand failed:
*** Variable 'a::type not of sort linorder
*** 
*** Now trying to infer coercions globally.
*** 
*** Coercion inference failed:
*** weak unification of subtype constraints fails
*** Clash of types "_ \<Rightarrow> _" and "bool"
*** 
*** At command "by" (line 296 of "~~/afp/thys/Formal_SSA/SSA_CFG_code.thy")
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30349name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6349name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6642name=byelapsed=0.021
ML_statistics = :now=1464804888.22tasks_ready=493tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=31size_allocation=2839543808size_allocation_free=1060133240size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2839961968threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=233.564time_GC=8.604user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42649name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6459name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6891name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8833name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8101name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6891name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6981name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8226name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8924name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8314name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9604name=thuselapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2038name=byelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9685name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3296name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=2060name=byelapsed=0.081
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3664name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3381name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3997name=byelapsed=0.071
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4479name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6860name=proofelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5403name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4569name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6949name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8126name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4641name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8338name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5090name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7978name=byelapsed=0.148
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8403name=obtainelapsed=0.045
ML_statistics = :now=1464804888.73tasks_ready=495tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=31size_allocation=2839543808size_allocation_free=589712472size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2839961968threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=235.16time_GC=8.604user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5101name=showelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9158name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8403name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9248name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8526name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8625name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=10194name=byelapsed=0.176
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14870name=applyelapsed=0.222
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14951name=applyelapsed=0.011
locale CFG_SSA_step_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val, 'val list) mapping
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
    and g :: "'g" 
  assumes
    "CFG_SSA_step_code \<alpha>e \<alpha>n invar inEdges' Entry oldDefs
      oldUses defs uses phis var chooseNext_all g"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=9008name=localeelapsed=3.477
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=10585name=byelapsed=0.329
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14302name=applyelapsed=0.420
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=15237name=applyelapsed=0.111
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11096name=applyelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14363name=applyelapsed=0.112
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11234name=applyelapsed=0.057
ML_statistics = :now=1464804889.38tasks_ready=491tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=32size_allocation=2841640960size_allocation_free=2841640960size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=2842900224threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=236.688time_GC=8.788user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14423name=applyelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14517name=applyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=14644name=applyelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=15725name=byelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=15517name=byelapsed=0.380
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11884name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11954name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12024name=haveelapsed=0.050
locale CFG_SSA_Transformed_notriv_linorder_code =
  fixes
    \<alpha>e ::
      "'g \<Rightarrow> ('node \<times> 'edgeD \<times> 'node) set" 
    and \<alpha>n :: "'g \<Rightarrow> 'node list" 
    and invar :: "'g \<Rightarrow> bool" 
    and
    inEdges' ::
      "'g \<Rightarrow> 'node \<Rightarrow> ('node \<times> 'edgeD) list" 
    and Entry :: "'g \<Rightarrow> 'node" 
    and oldDefs :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and oldUses :: "'g \<Rightarrow> 'node \<Rightarrow> 'var set" 
    and defs :: "'g \<Rightarrow> 'node \<Rightarrow> 'val set" 
    and uses :: "'g \<Rightarrow> ('node, 'val set) mapping" 
    and phis :: "'g \<Rightarrow> ('node \<times> 'val, 'val list) mapping" 
    and var :: "'g \<Rightarrow> 'val \<Rightarrow> 'var" 
    and
    chooseNext_all ::
      "('node \<Rightarrow> 'val set)
       \<Rightarrow> ('node \<times> 'val, 'val list) mapping
                     \<Rightarrow> 'g \<Rightarrow> 'node \<times> 'val"
      
  assumes
    "CFG_SSA_Transformed_notriv_linorder_code \<alpha>e \<alpha>n invar
      inEdges' Entry oldDefs oldUses defs uses phis var chooseNext_all"
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=9874name=contextelapsed=0.540
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12088name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=9931name=abbreviationelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12281name=byelapsed=0.170
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=9969name=abbreviationelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=10007name=abbreviationelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=10087name=interpretationelapsed=0.036
ML_statistics = :now=1464804889.89tasks_ready=490tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=32size_allocation=2841640960size_allocation_free=1907210640size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=2842900224threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=238.296time_GC=8.788user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12111name=qedelapsed=0.162
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=10087name=interpretationelapsed=0.109
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12816name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=10260name=interpretationelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12667name=byelapsed=0.256
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=10260name=interpretationelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=10842name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12992name=byelapsed=0.134
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31545name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=12221name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=13185name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13573name=lemmaelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31545name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14461name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14844name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31680name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=15054name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11090name=byelapsed=0.092
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11252name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32079name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=16307name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11450name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11551name=applyelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=13736name=applyelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17481name=lemmaelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17954name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11625name=applyelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11680name=applyelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=18596name=lemmaelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=11745name=applyelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19147name=lemmaelapsed=0.046
ML_statistics = :now=1464804890.39tasks_ready=504tasks_pending=4tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=32size_allocation=2841640960size_allocation_free=178933720size_heap=4165992448size_heap_free_last_full_GC=0size_heap_free_last_GC=2842900224threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=241.496time_GC=8.788user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19617name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=20171name=lemmaelapsed=0.141
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12019name=applyelapsed=0.196
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=20423name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12244name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=20856name=lemmaelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12297name=applyelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28206name=lemmaelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12440name=applyelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=13800name=byelapsed=0.362
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38176name=lemmaelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14132name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12481name=applyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14537name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13125name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43936name=definitionelapsed=0.135
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=44814name=abbreviationelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=44862name=abbreviationelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14763name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=44918name=abbreviationelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13336name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=44957name=abbreviationelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45519name=lemmaelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14994name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14336name=byelapsed=0.294
### theory "Construct_SSA_notriv_code"
### 10.422s elapsed time, 38.028s cpu time, 1.060s GC time
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15169name=byelapsed=0.043
### Ignoring duplicate rewrite rule:
### phis ?g1 (Entry ?g1, ?v1) \<equiv> None
ML_statistics = :now=1464804891tasks_ready=510tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=33size_allocation=2809135104size_allocation_free=1882942352size_heap=4176478208size_heap_free_last_full_GC=0size_heap_free_last_GC=2809626208threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=243.38time_GC=8.92user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13632name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15416name=applyelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15547name=applyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13632name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15636name=applyelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13755name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15780name=applyelapsed=0.072
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13818name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15836name=applyelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=15934name=applyelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15456name=applyelapsed=0.172
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=5624name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13882name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13911name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15845name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16413name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13961name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15984name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16713name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16062name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14055name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16819name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14055name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16874name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23421name=byelapsed=0.070
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14147name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23630name=obtainelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16874name=obtainelapsed=0.044
ML_statistics = :now=1464804891.5tasks_ready=516tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=33size_allocation=2809135104size_allocation_free=1304718336size_heap=4176478208size_heap_free_last_full_GC=0size_heap_free_last_GC=2809626208threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=244.972time_GC=8.92user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14198name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16978name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23630name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23755name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17036name=letelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23992name=byelapsed=0.058
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24273name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24305name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23802name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17067name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25336name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25522name=proofelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24401name=applyelapsed=0.070
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25630name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28668name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25161name=byelapsed=0.187
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16290name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28782name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28845name=thuselapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16617name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24438name=applyelapsed=0.225
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24584name=applyelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16692name=thuselapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17235name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17258name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24711name=applyelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16772name=obtainelapsed=0.052
ML_statistics = :now=1464804892.01tasks_ready=515tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=33size_allocation=2809135104size_allocation_free=798603160size_heap=4176478208size_heap_free_last_full_GC=0size_heap_free_last_GC=2809626208threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=246.564time_GC=8.92user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17351name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16772name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=24756name=applyelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17390name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16884name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6858name=byelapsed=0.069
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17426name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18867name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19987name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18867name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19644name=byelapsed=0.096
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18973name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19987name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6395name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21187name=proofelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20093name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19048name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21269name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20177name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19109name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21327name=thuselapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20253name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19109name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21430name=haveelapsed=0.188
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19279name=henceelapsed=0.180
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20253name=obtainelapsed=0.183
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21512name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20428name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19420name=haveelapsed=0.046
ML_statistics = :now=1464804892.64tasks_ready=525tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=34size_allocation=2802843648size_allocation_free=2802843648size_heap=4175429632size_heap_free_last_full_GC=0size_heap_free_last_GC=2803444872threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=249.18time_GC=9.056user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19500name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20546name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21623name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22335name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20619name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21722name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21850name=thuselapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22415name=obtainelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20619name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20754name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22415name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21965name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22493name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22735name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22073name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23444name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22815name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23499name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22815name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=6902name=byelapsed=0.124
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=7811name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23597name=haveelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22936name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23749name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22936name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23063name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23839name=showelapsed=0.048
ML_statistics = :now=1464804893.15tasks_ready=540tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=34size_allocation=2802843648size_allocation_free=2422851200size_heap=4175429632size_heap_free_last_full_GC=0size_heap_free_last_GC=2803444872threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=250.784time_GC=9.056user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23184name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=24451name=byelapsed=0.089
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=24595name=byelapsed=0.103
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14928name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15014name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11252name=applyelapsed=4.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30135name=byelapsed=0.066
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=15069name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8818name=byelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30575name=byelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9180name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=8883name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=24786name=byelapsed=0.287
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25426name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26281name=letelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27053name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25467name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26333name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30884name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26423name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31403name=interpretelapsed=0.080
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30884name=obtainelapsed=0.044
ML_statistics = :now=1464804893.66tasks_ready=525tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=34size_allocation=2802843648size_allocation_free=1717209880size_heap=4175429632size_heap_free_last_full_GC=0size_heap_free_last_GC=2803444872threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=252.384time_GC=9.056user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26499name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31009name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26554name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31051name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26565name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31062name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32131name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31110name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32183name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31403name=interpretelapsed=0.239
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33215name=thuselapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9329name=fixelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27646name=applyelapsed=0.120
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27738name=applyelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31554name=interpretelapsed=0.149
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9407name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33468name=interpretelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9407name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9489name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33468name=interpretelapsed=0.089
ML_statistics = :now=1464804894.16tasks_ready=532tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=34size_allocation=2802843648size_allocation_free=632897896size_heap=4175429632size_heap_free_last_full_GC=0size_heap_free_last_GC=2803444872threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=255.58time_GC=9.056user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9553name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28102name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34956name=interpretelapsed=0.073
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33388name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34956name=interpretelapsed=0.099
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9663name=byelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28499name=proofelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35122name=showelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28592name=haveelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30320name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28734name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30320name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28804name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31554name=interpretelapsed=0.455
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30412name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28839name=thuselapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31705name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9833name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30502name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36417name=interpretelapsed=0.182
ML_statistics = :now=1464804894.77tasks_ready=535tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=35size_allocation=2782920704size_allocation_free=2782920704size_heap=4173332480size_heap_free_last_full_GC=0size_heap_free_last_GC=2784138744threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=257.296time_GC=9.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37184name=interpretelapsed=0.269
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36417name=interpretelapsed=0.106
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36583name=haveelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30842name=byelapsed=0.391
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36721name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9896name=fixelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1410name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9951name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1410name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=10017name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1769name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1471name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1873name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2134name=proofelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1471name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2191name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1617name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2646name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=7261name=byelapsed=0.052
ML_statistics = :now=1464804895.28tasks_ready=536tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=35size_allocation=2782920704size_allocation_free=2125297272size_heap=4173332480size_heap_free_last_full_GC=0size_heap_free_last_GC=2784138744threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=258.848time_GC=9.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37184name=interpretelapsed=0.444
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2806name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13817name=byelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2885name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=35350name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2972name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=13941name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14007name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3040name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37374name=interpretelapsed=0.195
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=14052name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13917name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13276name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15255name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13276name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=15325name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16099name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13380name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16257name=byelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17018name=byelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=16668name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17204name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18125name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18192name=byelapsed=0.029
ML_statistics = :now=1464804895.78tasks_ready=510tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=35size_allocation=2782920704size_allocation_free=1462424096size_heap=4173332480size_heap_free_last_full_GC=0size_heap_free_last_GC=2784138744threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=260.444time_GC=9.196user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17764name=byelapsed=0.076
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18271name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17872name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18479name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=17812name=byelapsed=0.112
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19296name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19389name=byelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19489name=byelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18599name=byelapsed=0.159
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19655name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18821name=byelapsed=0.038
ML_statistics = :now=1464804896.37tasks_ready=497tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=36size_allocation=2759852032size_allocation_free=2759852032size_heap=4176478208size_heap_free_last_full_GC=0size_heap_free_last_GC=2760092160threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=262.96time_GC=9.308user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18710name=byelapsed=0.648
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=18912name=byelapsed=0.523
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37374name=interpretelapsed=1.146
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19964name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37528name=interpretelapsed=0.074
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=19881name=byelapsed=0.115
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37528name=interpretelapsed=0.099
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21349name=byelapsed=0.119
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37727name=henceelapsed=0.055
ML_statistics = :now=1464804896.87tasks_ready=491tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=36size_allocation=2759852032size_allocation_free=1919075472size_heap=4176478208size_heap_free_last_full_GC=0size_heap_free_last_GC=2760092160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=264.472time_GC=9.308user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21513name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37865name=interpretelapsed=0.069
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21634name=fixelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21726name=showelapsed=0.068
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=37865name=interpretelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=38031name=haveelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=38184name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22226name=byelapsed=0.119
### Rule already declared as introduction (intro)
### \<lbrakk>?P ?a; \<And>x. ?P x \<Longrightarrow> x = ?a\<rbrakk>
### \<Longrightarrow> (THE x. ?P x) = ?a
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=5642name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=5350name=byelapsed=0.093
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=5882name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=6426name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24876name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=5994name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=5994name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22411name=byelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24946name=byelapsed=0.021
ML_statistics = :now=1464804897.37tasks_ready=485tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=36size_allocation=2759852032size_allocation_free=1201166720size_heap=4176478208size_heap_free_last_full_GC=0size_heap_free_last_GC=2760092160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=266.06time_GC=9.308user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=6143name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22483name=fixelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22563name=assumeelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25684name=letelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=20407name=byelapsed=0.801
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22867name=letelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=6862name=applyelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25713name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7129name=applyelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22898name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25713name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7169name=applyelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7250name=applyelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25817name=letelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23000name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7288name=applyelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24272name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25866name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7371name=assumeelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24283name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25866name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25980name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7509name=interpretelapsed=0.122
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29637name=byelapsed=0.081
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26069name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29771name=byelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26144name=obtainelapsed=0.052
ML_statistics = :now=1464804897.93tasks_ready=486tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=37size_allocation=2746220544size_allocation_free=2746220544size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2746826408threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=269.176time_GC=9.388user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29868name=showelapsed=0.130
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26144name=obtainelapsed=0.131
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29933name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26260name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29964name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26328name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=29964name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30038name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30038name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30146name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30196name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30280name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7509name=interpretelapsed=0.603
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30428name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7677name=thuselapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42060name=byelapsed=0.010
ML_statistics = :now=1464804898.43tasks_ready=491tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=37size_allocation=2746220544size_allocation_free=2081270496size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2746826408threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=270.776time_GC=9.388user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42183name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30428name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31471name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30572name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32663name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31528name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31559name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31559name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31613name=letelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32713name=byelapsed=0.180
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31661name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31744name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31890name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31890name=obtainelapsed=0.051
ML_statistics = :now=1464804898.94tasks_ready=493tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=37size_allocation=2746220544size_allocation_free=1476082224size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2746826408threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=272.372time_GC=9.388user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32044name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32044name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32173name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32173name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=42311name=byelapsed=0.437
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32353name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33463name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33071name=byelapsed=0.080
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=33921name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34049name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34733name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31340name=byelapsed=1.220
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34845name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=34137name=byelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43060name=byelapsed=0.081
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35002name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43239name=byelapsed=0.095
ML_statistics = :now=1464804899.44tasks_ready=478tasks_pending=1tasks_running=6tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=37size_allocation=2746220544size_allocation_free=805893312size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2746826408threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=273.964time_GC=9.388user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1220name=showelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35156name=byelapsed=0.138
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1901name=showelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2661name=byelapsed=0.156
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2940name=byelapsed=0.276
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=3134name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35655name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21730name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21799name=showelapsed=0.049
ML_statistics = :now=1464804899.96tasks_ready=475tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=38size_allocation=2738880512size_allocation_free=2738880512size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2739450088threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=275.576time_GC=9.456user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21847name=qedelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=1874name=byelapsed=0.118
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35783name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22019name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22118name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22189name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22238name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22311name=qedelapsed=0.043
ML_statistics = :now=1464804900.47tasks_ready=473tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=38size_allocation=2738880512size_allocation_free=997013208size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2739450088threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=278.776time_GC=9.456user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43445name=byelapsed=1.190
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3074name=byelapsed=0.238
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=35898name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=43526name=byelapsed=0.944
### Rule already declared as introduction (intro)
### (\<And>x. ?f x = ?g x) \<Longrightarrow> ?f = ?g
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36029name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36073name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36185name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36300name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=2315name=byelapsed=0.215
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3687name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=3452name=byelapsed=0.243
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36370name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36472name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37227name=byelapsed=0.081
ML_statistics = :now=1464804900.98tasks_ready=468tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=39size_allocation=2731540480size_allocation_free=2731540480size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2732254360threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=280.88time_GC=9.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36564name=ultimatelyelapsed=0.084
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36583name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4837name=byelapsed=0.170
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36697name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5000name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36748name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7504name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36816name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12893name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36890name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13007name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37001name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13079name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37033name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13090name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37044name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13241name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=37087name=showelapsed=0.049
ML_statistics = :now=1464804901.48tasks_ready=471tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=39size_allocation=2731540480size_allocation_free=2180123072size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2732254360threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=282.476time_GC=9.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13676name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13687name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5849name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8110name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13842name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7977name=byelapsed=0.188
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=5949name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=5641name=byelapsed=0.128
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6061name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8315name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8220name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6188name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6290name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6381name=haveelapsed=0.050
ML_statistics = :now=1464804901.98tasks_ready=464tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=39size_allocation=2731540480size_allocation_free=1470656992size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2732254360threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=284.064time_GC=9.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6499name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6648name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6740name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6759name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=6367name=byelapsed=0.205
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8707name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8801name=henceelapsed=0.049
ML_statistics = :now=1464804902.48tasks_ready=467tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=39size_allocation=2731540480size_allocation_free=772152984size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2732254360threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=285.656time_GC=9.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=4593name=byelapsed=1.664
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8877name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6962name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8922name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11235name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7037name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8988name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14431name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14431name=haveelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8999name=haveelapsed=0.102
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14519name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14568name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9123name=haveelapsed=0.084
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11037name=henceelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14601name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11141name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14601name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14916name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14916name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15029name=showelapsed=0.048
ML_statistics = :now=1464804903.05tasks_ready=470tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=40size_allocation=2733637632size_allocation_free=2733637632size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2734469328threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=287.464time_GC=9.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17015name=byelapsed=0.175
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17172name=byelapsed=0.199
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11520name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7106name=byelapsed=0.319
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=17716name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11570name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12279name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11570name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=7245name=byelapsed=0.058
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11723name=letelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18053name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11778name=haveelapsed=0.045
ML_statistics = :now=1464804903.55tasks_ready=466tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=40size_allocation=2733637632size_allocation_free=1192044528size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2734469328threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=290.624time_GC=9.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18053name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12202name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18363name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12399name=byelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18363name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19447name=obtainelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18550name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19447name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18550name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19748name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18728name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19242name=thuselapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12586name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23742name=byelapsed=0.116
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43289name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20510name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43360name=letelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20550name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43417name=letelapsed=0.051
ML_statistics = :now=1464804904.06tasks_ready=469tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=40size_allocation=2733637632size_allocation_free=520985256size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2734469328threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=292.216time_GC=9.544user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20583name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43494name=letelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20583name=obtainelapsed=0.051
### Rewrite rule not in simpset:
### phiArg ?g ?v ?v' \<equiv>
### \<exists>vs. phi ?g ?v = Some vs \<and> ?v' \<in> set vs
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43528name=noteelapsed=0.065
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20841name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43848name=obtainelapsed=0.122
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20930name=fixelapsed=0.125
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43848name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21367name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44446name=obtainelapsed=0.078
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21636name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21636name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44446name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21792name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44963name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22758name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44963name=obtainelapsed=0.054
ML_statistics = :now=1464804904.61tasks_ready=477tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=41size_allocation=2723151872size_allocation_free=2723151872size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2724065184threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=293.384time_GC=9.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23867name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45219name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3095name=byelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24338name=byelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45538name=obtainelapsed=0.072
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45538name=obtainelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45798name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45907name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=6166name=byelapsed=3.151
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=46017name=ultimatelyelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=46028name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24865name=obtainelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=46215name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=24865name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=10921name=byelapsed=0.024
ML_statistics = :now=1464804905.11tasks_ready=478tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=41size_allocation=2723151872size_allocation_free=1361914696size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2724065184threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=296.568time_GC=9.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25737name=obtainelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG_code.thyoffset=10814name=byelapsed=0.413
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3482name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5607name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25737name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3559name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5780name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30252name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3697name=fixelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25938name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4262name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25938name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3778name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3822name=showelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4652name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26132name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30334name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4730name=fixelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26132name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30507name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30556name=nextelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26327name=letelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4801name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26364name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30666name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4801name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30840name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4985name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26403name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31115name=henceelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5038name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26403name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5143name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27486name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31341name=obtainelapsed=0.053
ML_statistics = :now=1464804905.61tasks_ready=485tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=41size_allocation=2723151872size_allocation_free=916672872size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2724065184threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=298.168time_GC=9.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5181name=henceelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27562name=showelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31341name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=6403name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31514name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5265name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31525name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5332name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31711name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42661name=byelapsed=0.136
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31711name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8124name=byelapsed=0.078
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7052name=thuselapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31804name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8970name=fixelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7155name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9021name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32012name=henceelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7198name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32151name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8399name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7289name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42541name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8453name=nextelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7371name=letelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9615name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8501name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9696name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7401name=haveelapsed=0.050
ML_statistics = :now=1464804906.11tasks_ready=488tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=41size_allocation=2723151872size_allocation_free=457432480size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2724065184threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=299.768time_GC=9.608user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8635name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3757name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7547name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3830name=qedelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7618name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5510name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7038name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7629name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5574name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7079name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4684name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5620name=nextelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7105name=showelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8478name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5646name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4735name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5114name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9192name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4735name=obtainelapsed=0.172
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9337name=obtainelapsed=0.171
### Rule already declared as elimination (elim)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m; ?l \<in> set ?ns\<rbrakk>
### \<Longrightarrow> ?l \<in> set (\<alpha>n ?g)
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8569name=byelapsed=0.200
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4824name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9337name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4914name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9422name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=8704name=byelapsed=0.077
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4987name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9471name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5050name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9577name=nextelapsed=0.044
ML_statistics = :now=1464804906.71tasks_ready=490tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=42size_allocation=2713714688size_allocation_free=2713714688size_heap=4177526784size_heap_free_last_full_GC=0size_heap_free_last_GC=2714366784threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=301.896time_GC=9.728user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11916name=byelapsed=0.076
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9605name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=11965name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=10594name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12053name=byelapsed=0.099
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=12099name=byelapsed=0.079
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=12460name=haveelapsed=0.057
### Rule already declared as introduction (intro)
### (\<And>x. ?f x = ?g x) \<Longrightarrow> ?f = ?g
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31618name=byelapsed=0.104
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=12893name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14760name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14968name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13880name=applyelapsed=0.122
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13345name=finallyelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31731name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13353name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31786name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31801name=fixelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31876name=haveelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13978name=applyelapsed=0.190
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14008name=applyelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=31941name=haveelapsed=0.049
ML_statistics = :now=1464804907.22tasks_ready=478tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=42size_allocation=2713714688size_allocation_free=2155035456size_heap=4177526784size_heap_free_last_full_GC=0size_heap_free_last_GC=2714366784threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=303.492time_GC=9.728user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=32019name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14257name=applyelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=15379name=byelapsed=0.235
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14307name=applyelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=15584name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=15915name=byelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=16238name=byelapsed=0.079
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=16678name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=16963name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17014name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17094name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17854name=byelapsed=0.195
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17276name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=18484name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19476name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19549name=showelapsed=0.048
ML_statistics = :now=1464804907.72tasks_ready=475tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=42size_allocation=2713714688size_allocation_free=1015559696size_heap=4177526784size_heap_free_last_full_GC=0size_heap_free_last_GC=2714366784threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=306.664time_GC=9.728user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=18933name=applyelapsed=0.388
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=18981name=applyelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19936name=applyelapsed=0.443
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19984name=applyelapsed=0.051
ML_statistics = :now=1464804908.3tasks_ready=475tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=43size_allocation=2689597440size_allocation_free=2689597440size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2690103000threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=308.692time_GC=9.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=20128name=byelapsed=0.133
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=20329name=byelapsed=0.282
ML_statistics = :now=1464804908.8tasks_ready=473tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=43size_allocation=2689597440size_allocation_free=1848497360size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2690103000threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=310.292time_GC=9.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=19125name=byelapsed=0.790
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21328name=fixelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21403name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21571name=interpretelapsed=0.098
ML_statistics = :now=1464804909.3tasks_ready=474tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=43size_allocation=2689597440size_allocation_free=1075554024size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2690103000threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=311.892time_GC=9.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804909.85tasks_ready=474tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=44size_allocation=2684354560size_allocation_free=2684354560size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2684820808threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=313.832time_GC=9.848user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21571name=interpretelapsed=0.888
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21715name=letelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21814name=letelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21865name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21969name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=22042name=interpretelapsed=0.094
ML_statistics = :now=1464804910.35tasks_ready=477tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=44size_allocation=2684354560size_allocation_free=1900142952size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2684820808threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=315.388time_GC=9.848user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=22042name=interpretelapsed=0.275
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=22348name=showelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28571name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28571name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28706name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28844name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=29243name=haveelapsed=0.052
ML_statistics = :now=1464804910.86tasks_ready=481tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=44size_allocation=2684354560size_allocation_free=454031592size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2684820808threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=318.536time_GC=9.848user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=29434name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38626name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38794name=interpretelapsed=0.099
ML_statistics = :now=1464804911.4tasks_ready=483tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=45size_allocation=2680160256size_allocation_free=2680160256size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2680608792threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=319.492time_GC=9.908user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804911.91tasks_ready=483tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=45size_allocation=2680160256size_allocation_free=1821236752size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2680608792threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=321.036time_GC=9.908user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38794name=interpretelapsed=0.905
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38955name=obtainelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38955name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39152name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39276name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39453name=haveelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39916name=haveelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=40088name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=40174name=haveelapsed=0.054
ML_statistics = :now=1464804912.41tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=45size_allocation=2680160256size_allocation_free=356769048size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2680608792threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=324.06time_GC=9.908user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=40366name=haveelapsed=0.069
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=40842name=haveelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41000name=haveelapsed=0.122
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41411name=haveelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41820name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14548name=byelapsed=0.145
ML_statistics = :now=1464804912.93tasks_ready=493tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=46size_allocation=2672820224size_allocation_free=2672820224size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2673096552threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=324.912time_GC=9.968user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12939name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12976name=thuselapsed=0.056
ML_statistics = :now=1464804913.44tasks_ready=494tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=46size_allocation=2672820224size_allocation_free=1038969328size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2673096552threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=328.112time_GC=9.968user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13138name=byelapsed=0.542
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=14780name=byelapsed=0.258
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45082name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45337name=applyelapsed=0.043
ML_statistics = :now=1464804913.94tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=46size_allocation=2672820224size_allocation_free=272314368size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2673096552threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=329.596time_GC=9.968user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804914.46tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=47size_allocation=2665480192size_allocation_free=1831059512size_heap=4190109696size_heap_free_last_full_GC=0size_heap_free_last_GC=2665912656threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=331.724time_GC=10.004user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804914.96tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=47size_allocation=2665480192size_allocation_free=1037147408size_heap=4190109696size_heap_free_last_full_GC=0size_heap_free_last_GC=2665912656threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=333.292time_GC=10.004user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804915.47tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=48size_allocation=2665480192size_allocation_free=2665480192size_heap=4191158272size_heap_free_last_full_GC=0size_heap_free_last_GC=2666449808threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=335.18time_GC=10.032user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804915.97tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=48size_allocation=2665480192size_allocation_free=1764612944size_heap=4191158272size_heap_free_last_full_GC=0size_heap_free_last_GC=2666449808threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=336.78time_GC=10.032user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804916.48tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=48size_allocation=2665480192size_allocation_free=896776320size_heap=4191158272size_heap_free_last_full_GC=0size_heap_free_last_GC=2666449808threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=338.364time_GC=10.032user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804916.99tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=49size_allocation=2663383040size_allocation_free=1739571008size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2663710344threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=341.552time_GC=10.06user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804917.5tasks_ready=490tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=49size_allocation=2663383040size_allocation_free=830315560size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2663710344threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=343.152time_GC=10.06user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=14320name=byelapsed=10.373
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45757name=applyelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=20744name=byelapsed=9.221
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45829name=applyelapsed=0.185
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=46410name=byelapsed=0.072
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=46683name=byelapsed=0.064
ML_statistics = :now=1464804918tasks_ready=485tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=50size_allocation=2663383040size_allocation_free=2663383040size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2663862792threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=344.656time_GC=10.088user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45366name=applyelapsed=4.580
ML_statistics = :now=1464804918.51tasks_ready=485tasks_pending=1tasks_running=7tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=50size_allocation=2663383040size_allocation_free=1790065872size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2663862792threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=346.236time_GC=10.088user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45435name=byelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13729name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=13847name=byelapsed=0.088
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16320name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=47094name=proofelapsed=0.686
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=48040name=assumeelapsed=0.068
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=48654name=obtainelapsed=0.081
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15894name=byelapsed=0.188
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=48654name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16438name=byelapsed=0.100
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=45872name=byelapsed=1.104
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49471name=interpretelapsed=0.082
ML_statistics = :now=1464804919.02tasks_ready=479tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=51size_allocation=2661285888size_allocation_free=2661285888size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2661898160threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=349.52time_GC=10.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14017name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16050name=byelapsed=0.087
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16761name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16075name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16848name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=16966name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23722name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14299name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17024name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14430name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17151name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14466name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17234name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14509name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17282name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14658name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17309name=henceelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17454name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14880name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17559name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14891name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14916name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17636name=obtainelapsed=0.059
ML_statistics = :now=1464804919.52tasks_ready=479tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=51size_allocation=2661285888size_allocation_free=1957520512size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2661898160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=351.108time_GC=10.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14952name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17636name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15010name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17901name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15050name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49471name=interpretelapsed=0.666
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18121name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49632name=letelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25709name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18192name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25799name=nextelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49688name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18375name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25852name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49951name=thuselapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25941name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18474name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50130name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28711name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18474name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28814name=byelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16628name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18608name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16703name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16853name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50294name=interpretelapsed=0.111
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18711name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17414name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19603name=showelapsed=0.044
ML_statistics = :now=1464804920.03tasks_ready=484tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=51size_allocation=2661285888size_allocation_free=1472504264size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2661898160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=352.708time_GC=10.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=16895name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17538name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19011name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20131name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19061name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21301name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17600name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17620name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20190name=byelapsed=0.084
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17670name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19210name=byelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17732name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17752name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20359name=byelapsed=0.061
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17810name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17846name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19319name=byelapsed=0.112
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21549name=byelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19464name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=19513name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20470name=byelapsed=0.082
ML_statistics = :now=1464804920.54tasks_ready=467tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=51size_allocation=2661285888size_allocation_free=777300720size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2661898160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=354.308time_GC=10.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=21797name=byelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22449name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=20767name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22002name=byelapsed=0.156
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22506name=byelapsed=0.175
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23473name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22888name=byelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23640name=byelapsed=0.029
ML_statistics = :now=1464804921.16tasks_ready=456tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=52size_allocation=2659188736size_allocation_free=1645185000size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=2660275912threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=357.384time_GC=10.24user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50294name=interpretelapsed=1.205
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23777name=byelapsed=0.317
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=22084name=byelapsed=0.520
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50536name=interpretelapsed=0.108
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50536name=interpretelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23852name=byelapsed=0.101
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23197name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26886name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50914name=interpretelapsed=0.098
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=23127name=byelapsed=0.269
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25455name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=27005name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25496name=proofelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50914name=interpretelapsed=0.066
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25619name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=51302name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26065name=qedelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=30923name=byelapsed=0.116
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=51390name=haveelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26445name=byelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26542name=byelapsed=0.032
ML_statistics = :now=1464804921.67tasks_ready=446tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=52size_allocation=2659188736size_allocation_free=861742688size_heap=4174381056size_heap_free_last_full_GC=0size_heap_free_last_GC=2660275912threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=358.984time_GC=10.24user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=51671name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26609name=byelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32298name=applyelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31146name=byelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32482name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33293name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=51852name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32531name=applyelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33549name=proofelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=52026name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32632name=showelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33573name=interpretelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33182name=qedelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=52261name=haveelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=52559name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9503name=byelapsed=0.087
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=52685name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33462name=fixelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33582name=haveelapsed=0.145
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=53006name=haveelapsed=0.162
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33630name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=53770name=haveelapsed=0.069
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33750name=thuselapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33573name=interpretelapsed=0.408
ML_statistics = :now=1464804922.22tasks_ready=450tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=53size_allocation=2621440000size_allocation_free=2621440000size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2621810728threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=360.868time_GC=10.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33840name=nextelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=54554name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33881name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33750name=interpretelapsed=0.075
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=54748name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33881name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=54828name=letelapsed=0.068
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33946name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33750name=interpretelapsed=0.086
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33922name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34031name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=55018name=letelapsed=0.084
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33943name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34243name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35225name=proofelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33996name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35237name=fixelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=55209name=showelapsed=0.079
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34087name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35266name=interpretelapsed=0.073
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=56236name=haveelapsed=0.069
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34165name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=56236name=haveelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=24283name=byelapsed=29.629
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34203name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=56705name=haveelapsed=0.075
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34285name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=56705name=haveelapsed=0.016
ML_statistics = :now=1464804922.73tasks_ready=464tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=53size_allocation=2621440000size_allocation_free=2161287112size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2621810728threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=362.364time_GC=10.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34379name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35266name=interpretelapsed=0.173
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35443name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=57351name=haveelapsed=0.090
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34499name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28636name=byelapsed=0.187
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=57351name=haveelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35509name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34653name=showelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28827name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=58753name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30433name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35611name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34847name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=31773name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28946name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59062name=haveelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35749name=showelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30592name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28971name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59376name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35981name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=28990name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59488name=henceelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30698name=qedelapsed=0.084
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36098name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59488name=henceelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29001name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=60031name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36265name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29318name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36740name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1441name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29395name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=9969name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=60170name=haveelapsed=0.077
ML_statistics = :now=1464804923.23tasks_ready=472tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=53size_allocation=2621440000size_allocation_free=1604915040size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2621810728threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=363.952time_GC=10.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29466name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2258name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61306name=ultimatelyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29486name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2338name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29538name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2338name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29632name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2440name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29672name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2499name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61323name=showelapsed=0.211
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30082name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2573name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61323name=showelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2663name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2913name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2852name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=1628name=byelapsed=0.074
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13347name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3124name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13467name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=21993name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4820name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13467name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6383name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13593name=obtainelapsed=0.048
ML_statistics = :now=1464804923.73tasks_ready=473tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=53size_allocation=2621440000size_allocation_free=677661808size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2621810728threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=367.148time_GC=10.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6411name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=38123name=byelapsed=0.129
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13593name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6495name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13693name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13757name=showelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6999name=ultimatelyelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13784name=qedelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=38201name=byelapsed=0.111
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=5950name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=7010name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=6188name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=22986name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23078name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25943name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=25777name=byelapsed=0.101
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23136name=showelapsed=0.064
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24353name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26211name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26099name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26020name=byelapsed=0.078
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26339name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30235name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30105name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=7722name=byelapsed=0.180
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=26274name=byelapsed=0.273
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30631name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31483name=byelapsed=0.086
ML_statistics = :now=1464804924.38tasks_ready=455tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=54size_allocation=2617245696size_allocation_free=2617245696size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2618218424threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=368.896time_GC=10.484user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30758name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30810name=nextelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30498name=byelapsed=0.373
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30823name=fixelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30901name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32118name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36679name=byelapsed=1.524
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31960name=byelapsed=0.204
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1318name=fixelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1433name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=31699name=byelapsed=0.407
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32229name=byelapsed=0.231
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=32373name=byelapsed=0.227
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=21781name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1433name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=22171name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2049name=fixelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1531name=haveelapsed=0.048
ML_statistics = :now=1464804924.88tasks_ready=443tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=54size_allocation=2617245696size_allocation_free=1834850160size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2618218424threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=370.492time_GC=10.484user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2133name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1587name=obtainelapsed=0.049
### Rule already declared as elimination (elim)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m;
###  ?g \<turnstile> ?m-?ms\<rightarrow>?l\<rbrakk>
### \<Longrightarrow> ?g \<turnstile> ?n-?ns @ tl ?ms\<rightarrow>?l
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36125name=byelapsed=0.109
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1587name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36633name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36412name=byelapsed=0.103
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1685name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36950name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1722name=ultimatelyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13129name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1733name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=36354name=byelapsed=0.270
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13700name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6441name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13338name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6243name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6548name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=8744name=byelapsed=0.014
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13338name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14470name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13424name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=6772name=byelapsed=0.118
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9194name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12963name=byelapsed=0.294
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13528name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9479name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13596name=ultimatelyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13607name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9479name=obtainelapsed=0.048
ML_statistics = :now=1464804925.38tasks_ready=422tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=54size_allocation=2617245696size_allocation_free=1109060544size_heap=4169138176size_heap_free_last_full_GC=0size_heap_free_last_GC=2618218424threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=372.092time_GC=10.484user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9571name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15124name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9635name=henceelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15398name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9746name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=14767name=byelapsed=0.252
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15531name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11849name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15942name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11990name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16377name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12068name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16498name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18501name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18688name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19842name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19875name=nextelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19687name=byelapsed=0.120
ML_statistics = :now=1464804925.92tasks_ready=422tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=55size_allocation=2579496960size_allocation_free=2579496960size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2580981328threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=375.152time_GC=10.552user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19906name=haveelapsed=0.118
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18818name=fixelapsed=0.125
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20356name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18946name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18291name=byelapsed=0.460
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19050name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20523name=byelapsed=0.065
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20728name=byelapsed=0.064
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19206name=showelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=43941name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21435name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11084name=byelapsed=0.825
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44302name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21480name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21885name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21537name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21967name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22833name=thuselapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45318name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22892name=nextelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45363name=nextelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22936name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45405name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22973name=thuselapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45471name=showelapsed=0.043
ML_statistics = :now=1464804926.42tasks_ready=425tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=55size_allocation=2579496960size_allocation_free=2054344288size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2580981328threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=376.74time_GC=10.552user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45755name=byelapsed=0.217
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44355name=qedelapsed=0.622
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45838name=byelapsed=0.409
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25092name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=46226name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25857name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25092name=obtainelapsed=0.046
ML_statistics = :now=1464804926.92tasks_ready=420tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=55size_allocation=2579496960size_allocation_free=1255706976size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2580981328threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=378.34time_GC=10.552user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25380name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45987name=byelapsed=0.324
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25380name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4368name=fixelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25519name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4450name=henceelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25519name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4524name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3808name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25641name=ultimatelyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25652name=showelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3914name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=3954name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4010name=nextelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4050name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4145name=showelapsed=0.047
ML_statistics = :now=1464804927.42tasks_ready=424tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=55size_allocation=2579496960size_allocation_free=600316648size_heap=4181721088size_heap_free_last_full_GC=0size_heap_free_last_GC=2580981328threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=379.944time_GC=10.552user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44749name=byelapsed=1.634
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4929name=byelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26061name=byelapsed=0.994
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=5015name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26559name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26607name=showelapsed=0.045
ML_statistics = :now=1464804927.99tasks_ready=420tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=56size_allocation=2581594112size_allocation_free=1703973632size_heap=4180672512size_heap_free_last_full_GC=0size_heap_free_last_GC=2582714944threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=382.84time_GC=10.64user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26707name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4663name=byelapsed=0.925
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26756name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26857name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27706name=thuselapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26908name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27756name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26966name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27928name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27086name=ultimatelyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28017name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27097name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28146name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26255name=byelapsed=1.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27180name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31557name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28233name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27238name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28256name=letelapsed=0.047
### Rewrite rule not in simpset:
### phiArg ?g ?v ?v' \<equiv>
### \<exists>vs. phi ?g ?v = Some vs \<and> ?v' \<in> set vs
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27360name=ultimatelyelapsed=0.042
ML_statistics = :now=1464804928.49tasks_ready=419tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=56size_allocation=2581594112size_allocation_free=1128144808size_heap=4180672512size_heap_free_last_full_GC=0size_heap_free_last_GC=2582714944threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=384.44time_GC=10.64user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28444name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27371name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31860name=byelapsed=0.148
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29654name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9120name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9179name=nextelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32372name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29728name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9215name=obtainelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29793name=ultimatelyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32372name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29804name=showelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9215name=obtainelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32554name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8412name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=9344name=showelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32554name=obtainelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=7439name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=8534name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7067name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32817name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32817name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7222name=henceelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32922name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7273name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=3770name=byelapsed=0.154
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4783name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7328name=nextelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33020name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5713name=thuselapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7382name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33020name=obtainelapsed=0.046
ML_statistics = :now=1464804928.99tasks_ready=417tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=56size_allocation=2581594112size_allocation_free=663086280size_heap=4180672512size_heap_free_last_full_GC=0size_heap_free_last_GC=2582714944threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=386.036time_GC=10.64user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5811name=nextelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7382name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33444name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30863name=proofelapsed=1.265
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5843name=letelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7546name=haveelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=30943name=showelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5875name=letelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33444name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5923name=haveelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35294name=obtainelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31008name=showelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7613name=obtainelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=31049name=qedelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9380name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6002name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35294name=obtainelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7613name=obtainelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4866name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35385name=henceelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7755name=thuselapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6099name=haveelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=4931name=byelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5005name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6561name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5070name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35476name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9644name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35476name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=9507name=byelapsed=0.100
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35655name=obtainelapsed=0.159
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=16785name=byelapsed=0.146
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17038name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13110name=applyelapsed=0.191
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35655name=obtainelapsed=0.053
ML_statistics = :now=1464804929.56tasks_ready=412tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=57size_allocation=2566914048size_allocation_free=2566914048size_heap=4177526784size_heap_free_last_full_GC=0size_heap_free_last_GC=2568881656threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=388.5time_GC=10.744user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35760name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35760name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=17148name=byelapsed=0.179
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35878name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=12652name=byelapsed=0.451
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35878name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21915name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=21514name=byelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36166name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28993name=applyelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=22652name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=29126name=applyelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42303name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=22906name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42502name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23144name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=29167name=byelapsed=0.097
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=29352name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23322name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=29790name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23333name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=30599name=applyelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38737name=byelapsed=0.063
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=30840name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39140name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23358name=nextelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31016name=applyelapsed=0.017
ML_statistics = :now=1464804930.06tasks_ready=401tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=57size_allocation=2566914048size_allocation_free=1950074600size_heap=4177526784size_heap_free_last_full_GC=0size_heap_free_last_GC=2568881656threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=390.104time_GC=10.744user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23386name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39602name=applyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31035name=applyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=40283name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39769name=applyelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=40950name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31209name=applyelapsed=0.132
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=39810name=byelapsed=0.109
ML_statistics = :now=1464804930.56tasks_ready=395tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=57size_allocation=2566914048size_allocation_free=1206584312size_heap=4177526784size_heap_free_last_full_GC=0size_heap_free_last_GC=2568881656threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=391.704time_GC=10.744user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41267name=applyelapsed=0.758
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41349name=byelapsed=0.107
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=42146name=applyelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41695name=applyelapsed=0.805
ML_statistics = :now=1464804931.12tasks_ready=394tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=58size_allocation=2546991104size_allocation_free=2546991104size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2548627688threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=393.884time_GC=10.808user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804931.62tasks_ready=394tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=58size_allocation=2546991104size_allocation_free=1670538952size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2548627688threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=395.48time_GC=10.808user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=13181name=byelapsed=2.303
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=41776name=byelapsed=0.773
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=12962name=byelapsed=0.067
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14359name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49434name=byelapsed=0.139
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14612name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14711name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14755name=henceelapsed=0.049
ML_statistics = :now=1464804932.15tasks_ready=384tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=59size_allocation=2548039680size_allocation_free=2548039680size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2549525848threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=398.876time_GC=10.836user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14843name=showelapsed=0.077
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17370name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17499name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17580name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17972name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18061name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=15063name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=25721name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18267name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=17247name=byelapsed=0.616
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18434name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18550name=byelapsed=0.056
ML_statistics = :now=1464804932.66tasks_ready=369tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=59size_allocation=2548039680size_allocation_free=1755149280size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2549525848threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=400.472time_GC=10.836user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26020name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26443name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26500name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26547name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26635name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26726name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26885name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26885name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27075name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27150name=thuselapsed=0.047
ML_statistics = :now=1464804933.16tasks_ready=376tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=59size_allocation=2548039680size_allocation_free=1065569400size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2549525848threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=402.072time_GC=10.836user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804933.69tasks_ready=376tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=60size_allocation=2551185408size_allocation_free=2551185408size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2552197800threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=404.196time_GC=10.88user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=49837name=byelapsed=1.741
ML_statistics = :now=1464804934.19tasks_ready=374tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=60size_allocation=2551185408size_allocation_free=1678900368size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2552197800threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=405.796time_GC=10.88user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18787name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18940name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19554name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19565name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19682name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19779name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19811name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17549name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17681name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17949name=showelapsed=0.048
ML_statistics = :now=1464804934.69tasks_ready=372tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=60size_allocation=2551185408size_allocation_free=875228688size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2552197800threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=407.396time_GC=10.88user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18033name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18084name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18159name=showelapsed=0.087
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26909name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25708name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25780name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=50236name=byelapsed=1.858
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25807name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32766name=applyelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25829name=nextelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32851name=fixelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=25875name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26008name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32906name=interpretelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=52833name=applyelapsed=0.012
ML_statistics = :now=1464804935.21tasks_ready=365tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=61size_allocation=2542796800size_allocation_free=2542796800size_heap=4190109696size_heap_free_last_full_GC=0size_heap_free_last_GC=2544254208threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=409.352time_GC=10.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33610name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=53733name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33715name=byelapsed=0.100
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=33786name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=54517name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=32906name=interpretelapsed=0.237
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34013name=byelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=33075name=thuselapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34256name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34079name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34038name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34128name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=56582name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=57070name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=55551name=applyelapsed=0.090
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34365name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=55937name=applyelapsed=0.055
ML_statistics = :now=1464804935.71tasks_ready=344tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=61size_allocation=2542796800size_allocation_free=1004381168size_heap=4190109696size_heap_free_last_full_GC=0size_heap_free_last_GC=2544254208threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=412.528time_GC=10.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=58121name=applyelapsed=0.129
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=56091name=byelapsed=0.121
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34612name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35597name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34806name=byelapsed=0.066
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=58314name=applyelapsed=0.283
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35708name=byelapsed=0.195
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=34936name=byelapsed=0.099
ML_statistics = :now=1464804936.28tasks_ready=336tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=62size_allocation=2540699648size_allocation_free=2540699648size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2542162928threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=414.48time_GC=10.996user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59207name=byelapsed=0.066
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=58429name=byelapsed=0.295
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=30637name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59712name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59858name=applyelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=59939name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=35940name=byelapsed=0.202
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=36224name=byelapsed=0.062
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29129name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29440name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29200name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2278name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2387name=byelapsed=0.015
ML_statistics = :now=1464804936.79tasks_ready=321tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=62size_allocation=2540699648size_allocation_free=1714263936size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2542162928threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=416.08time_GC=10.996user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29578name=byelapsed=0.251
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29795name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29888name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=2518name=byelapsed=0.068
ML_statistics = :now=1464804937.29tasks_ready=318tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=62size_allocation=2540699648size_allocation_free=872121032size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2542162928threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=417.68time_GC=10.996user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=62915name=applyelapsed=0.192
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=63006name=applyelapsed=0.112
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=63107name=byelapsed=0.178
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3201name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3201name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3296name=haveelapsed=0.050
ML_statistics = :now=1464804937.8tasks_ready=317tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=63size_allocation=2523922432size_allocation_free=2523922432size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2525250048threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=419.352time_GC=11.044user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3386name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3386name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3536name=ultimatelyelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3547name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3706name=letelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3811name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3915name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3964name=haveelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4106name=obtainelapsed=0.055
ML_statistics = :now=1464804938.31tasks_ready=323tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=63size_allocation=2523922432size_allocation_free=1147277520size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2525250048threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=422.516time_GC=11.044user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4106name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4293name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4370name=henceelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4610name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4674name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4685name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13506name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=60628name=applyelapsed=2.027
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=60859name=applyelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4904name=thuselapsed=0.099
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5010name=nextelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=60878name=applyelapsed=0.075
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=60948name=applyelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5052name=fixelapsed=0.049
ML_statistics = :now=1464804938.81tasks_ready=326tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=63size_allocation=2523922432size_allocation_free=464474056size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2525250048threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=424.06time_GC=11.044user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61006name=applyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5137name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61029name=applyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61249name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5265name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=61268name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13642name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5411name=fixelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6585name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5530name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6670name=haveelapsed=0.130
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5572name=haveelapsed=0.116
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6795name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5643name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6806name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=13770name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5747name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5893name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=7057name=byelapsed=0.077
ML_statistics = :now=1464804939.33tasks_ready=327tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=64size_allocation=2522873856size_allocation_free=2522873856size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2524241984threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=425.292time_GC=11.108user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5904name=haveelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23463name=obtainelapsed=0.066
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6065name=henceelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23463name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6238name=thuselapsed=0.047
### Ignoring duplicate rewrite rule:
### ?g1 \<turnstile> ?n1-[]\<rightarrow>?m1 \<equiv> False
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23745name=thuselapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30681name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23818name=nextelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=30964name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1552name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23867name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2298name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24003name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2327name=letelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24117name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2368name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1706name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2460name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=1798name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13460name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2531name=ultimatelyelapsed=0.049
ML_statistics = :now=1464804939.83tasks_ready=325tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=64size_allocation=2522873856size_allocation_free=1928613128size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2524241984threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=426.88time_GC=11.108user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9291name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2542name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9345name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2595name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9542name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9436name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=13633name=byelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15184name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15514name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9839name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15578name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9906name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15701name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9906name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15852name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10030name=letelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15888name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10074name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15899name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10896name=thuselapsed=0.049
ML_statistics = :now=1464804940.33tasks_ready=328tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=64size_allocation=2522873856size_allocation_free=800299376size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2524241984threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=430.076time_GC=11.108user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10935name=nextelapsed=0.051
### Rule already declared as elimination (elim)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m;
###  ?g \<turnstile> ?m-?ms\<rightarrow>?l\<rbrakk>
### \<Longrightarrow> ?g \<turnstile> ?n-?ns @ tl ?ms\<rightarrow>?l
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=11915name=byelapsed=0.138
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10984name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15989name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12029name=byelapsed=0.066
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16119name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=12133name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16537name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16287name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20019name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16323name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20113name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16334name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=18972name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20124name=haveelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20307name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=19115name=byelapsed=0.235
### Rule already declared as introduction (intro)
### ?P ?x \<Longrightarrow> \<exists>x. ?P x
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44007name=fixelapsed=0.164
ML_statistics = :now=1464804940.93tasks_ready=321tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=65size_allocation=2512388096size_allocation_free=2512388096size_heap=4178575360size_heap_free_last_full_GC=0size_heap_free_last_GC=2513727160threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=432.052time_GC=11.208user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44327name=byelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=21550name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44054name=obtainelapsed=0.094
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22055name=fixelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44054name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22133name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=45422name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44205name=thuselapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=23004name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4480name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25306name=byelapsed=0.265
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=25664name=byelapsed=0.226
ML_statistics = :now=1464804941.43tasks_ready=305tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=65size_allocation=2512388096size_allocation_free=1781366472size_heap=4178575360size_heap_free_last_full_GC=0size_heap_free_last_GC=2513727160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=433.596time_GC=11.208user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=4075name=byelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26740name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26891name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26590name=byelapsed=0.097
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=26941name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27025name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27959name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28107name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27298name=byelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=27213name=byelapsed=0.085
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28539name=obtainelapsed=0.053
### Rewrite rule not in simpset:
### phiArg ?g ?v ?v' \<equiv>
### \<exists>vs. phi ?g ?v = Some vs \<and> ?v' \<in> set vs
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28539name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28736name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29459name=henceelapsed=0.048
ML_statistics = :now=1464804941.93tasks_ready=289tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=65size_allocation=2512388096size_allocation_free=883628768size_heap=4178575360size_heap_free_last_full_GC=0size_heap_free_last_GC=2513727160threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=435.196time_GC=11.208user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29556name=thuselapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31253name=applyelapsed=11.883
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31454name=applyelapsed=0.094
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31582name=applyelapsed=0.216
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31761name=applyelapsed=0.024
ML_statistics = :now=1464804942.49tasks_ready=286tasks_pending=1tasks_running=6tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=66size_allocation=2490368000size_allocation_free=2490368000size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2491464224threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=436.936time_GC=11.284user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31781name=applyelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32465name=byelapsed=0.985
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31828name=applyelapsed=0.246
ML_statistics = :now=1464804943tasks_ready=284tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=66size_allocation=2490368000size_allocation_free=697486056size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2491464224threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=440.108time_GC=11.284user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32870name=byelapsed=0.703
ML_statistics = :now=1464804943.5tasks_ready=282tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=67size_allocation=2484076544size_allocation_free=2484076544size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2485639480threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=441.392time_GC=11.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32962name=byelapsed=0.268
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=31940name=applyelapsed=0.942
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32038name=applyelapsed=0.083
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7314name=byelapsed=0.223
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32081name=applyelapsed=0.170
ML_statistics = :now=1464804944.01tasks_ready=280tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=67size_allocation=2484076544size_allocation_free=1574829944size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2485639480threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=442.988time_GC=11.32user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32235name=applyelapsed=0.094
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33105name=byelapsed=0.551
ML_statistics = :now=1464804944.51tasks_ready=279tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=68size_allocation=2487222272size_allocation_free=2487222272size_heap=4191158272size_heap_free_last_full_GC=0size_heap_free_last_GC=2488516256threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=445.808time_GC=11.344user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=5745name=byelapsed=0.081
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7488name=byelapsed=0.082
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33665name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=42397name=applyelapsed=13.657
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33748name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33748name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33895name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33906name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33984name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34030name=obtainelapsed=0.066
ML_statistics = :now=1464804945.01tasks_ready=281tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=68size_allocation=2487222272size_allocation_free=1745159344size_heap=4191158272size_heap_free_last_full_GC=0size_heap_free_last_GC=2488516256threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=447.36time_GC=11.344user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34030name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34349name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34426name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34437name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34437name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34541name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34541name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34668name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34790name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34872name=henceelapsed=0.047
ML_statistics = :now=1464804945.51tasks_ready=287tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=68size_allocation=2487222272size_allocation_free=1128301304size_heap=4191158272size_heap_free_last_full_GC=0size_heap_free_last_GC=2488516256threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=448.844time_GC=11.344user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34951name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34962name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35016name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=32689name=byelapsed=3.728
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35016name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7569name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35198name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35347name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7739name=byelapsed=0.068
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6060name=byelapsed=0.083
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35425name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6253name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=42548name=applyelapsed=1.210
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6335name=showelapsed=0.099
ML_statistics = :now=1464804946.03tasks_ready=282tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=69size_allocation=2486173696size_allocation_free=2486173696size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2487817464threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=451.38time_GC=11.396user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=42722name=applyelapsed=0.128
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6462name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=6574name=byelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=7781name=byelapsed=0.263
### Rule already declared as elimination (elim)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m;
###  ?m \<in> set (old.predecessors ?g ?m')\<rbrakk>
### \<Longrightarrow> ?g \<turnstile> ?n-?ns @ [?m']\<rightarrow>?m'
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35824name=byelapsed=0.106
### Rule already declared as elimination (elim)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m;
###  ?m \<in> set (old.predecessors ?g ?m')\<rbrakk>
### \<Longrightarrow> ?g \<turnstile> ?n-?ns @ [?m']\<rightarrow>?m'
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35942name=byelapsed=0.104
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=22844name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36281name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36343name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36456name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36544name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36555name=haveelapsed=0.045
ML_statistics = :now=1464804946.53tasks_ready=287tasks_pending=1tasks_running=6tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=69size_allocation=2486173696size_allocation_free=1570621616size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2487817464threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=452.972time_GC=11.396user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36690name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36840name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36928name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36939name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37074name=thuselapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37163name=showelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23034name=byelapsed=0.101
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23308name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23487name=henceelapsed=0.055
ML_statistics = :now=1464804947.03tasks_ready=285tasks_pending=1tasks_running=6tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=69size_allocation=2486173696size_allocation_free=888913088size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2487817464threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=454.568time_GC=11.396user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23750name=haveelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23995name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24006name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24033name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24094name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24207name=haveelapsed=0.100
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42396name=byelapsed=1.139
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24266name=henceelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=14856name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24337name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24337name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24419name=showelapsed=0.048
ML_statistics = :now=1464804947.57tasks_ready=285tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=70size_allocation=2474639360size_allocation_free=2474639360size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2476442152threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=456.504time_GC=11.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18072name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18021name=byelapsed=0.182
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26109name=fixelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26180name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32257name=applyelapsed=3.586
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26319name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26795name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26662name=byelapsed=0.157
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27246name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27325name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27399name=nextelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=18850name=byelapsed=0.189
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27462name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19061name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27582name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19129name=henceelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32303name=applyelapsed=0.383
ML_statistics = :now=1464804948.07tasks_ready=281tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=70size_allocation=2474639360size_allocation_free=1772241512size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2476442152threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=458.108time_GC=11.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27623name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19230name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19325name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19416name=ultimatelyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19714name=byelapsed=0.133
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19427name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19996name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19520name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20152name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=17962name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18105name=byelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20391name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18253name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20535name=obtainelapsed=0.055
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18303name=nextelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32322name=applyelapsed=0.385
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20535name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18353name=haveelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32495name=applyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18434name=henceelapsed=0.041
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20739name=haveelapsed=0.046
ML_statistics = :now=1464804948.57tasks_ready=287tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=70size_allocation=2474639360size_allocation_free=576215184size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2476442152threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=461.308time_GC=11.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18600name=showelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20942name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20942name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21118name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21322name=haveelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21961name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22134name=haveelapsed=0.122
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22268name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22279name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22437name=henceelapsed=0.047
ML_statistics = :now=1464804949.12tasks_ready=290tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=71size_allocation=2467299328size_allocation_free=2467299328size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2468587040threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=462.624time_GC=11.512user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22487name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22498name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22543name=ultimatelyelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22554name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22657name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23257name=ultimatelyelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23268name=showelapsed=0.048
ML_statistics = :now=1464804949.62tasks_ready=291tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=71size_allocation=2467299328size_allocation_free=1786149024size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2468587040threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=464.216time_GC=11.512user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804950.12tasks_ready=291tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=71size_allocation=2467299328size_allocation_free=132919992size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2468587040threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=467.388time_GC=11.512user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34108name=byelapsed=0.837
command_timing = :file=~~/afp/thys/Formal_SSA/Graph_path.thyoffset=34211name=byelapsed=0.347
ML_statistics = :now=1464804950.66tasks_ready=288tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=72size_allocation=2452619264size_allocation_free=1557966520size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2454038928threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=469.22time_GC=11.588user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29242name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=42758name=applyelapsed=4.640
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=42985name=applyelapsed=0.037
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43096name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=29958name=byelapsed=0.076
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3261name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3478name=byelapsed=0.128
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3607name=byelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=3834name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4054name=byelapsed=0.014
ML_statistics = :now=1464804951.16tasks_ready=278tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=72size_allocation=2452619264size_allocation_free=695039688size_heap=4183818240size_heap_free_last_full_GC=0size_heap_free_last_GC=2454038928threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=470.82time_GC=11.588user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4214name=byelapsed=0.647
ML_statistics = :now=1464804951.67tasks_ready=277tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=73size_allocation=2443182080size_allocation_free=2443182080size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2444731840threads_in_ML=2threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=472.112time_GC=11.624user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4328name=byelapsed=0.031
### Rule already declared as elimination (elim)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m;
###  ?g \<turnstile> ?m-?ms\<rightarrow>?l\<rbrakk>
### \<Longrightarrow> ?g \<turnstile> ?n-?ns @ tl ?ms\<rightarrow>?l
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=26021name=byelapsed=3.460
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4621name=byelapsed=0.053
ML_statistics = :now=1464804952.18tasks_ready=274tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=73size_allocation=2443182080size_allocation_free=1525843856size_heap=4188012544size_heap_free_last_full_GC=0size_heap_free_last_GC=2444731840threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=473.704time_GC=11.624user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4486name=byelapsed=0.492
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4937name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=4725name=byelapsed=0.198
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5330name=byelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6606name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5203name=byelapsed=0.170
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5593name=byelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5682name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6730name=byelapsed=0.196
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5829name=byelapsed=0.010
### Rule already declared as introduction (intro)
### \<lbrakk>?g \<turnstile> ?n-?ns\<rightarrow>?m;
###  ?n' \<in> set (old.predecessors ?g ?n)\<rbrakk>
### \<Longrightarrow> ?g \<turnstile> ?n'-?n' # ?ns\<rightarrow>?m
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=5979name=byelapsed=0.039
ML_statistics = :now=1464804952.7tasks_ready=263tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=74size_allocation=2447376384size_allocation_free=2447376384size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2449091624threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=476.484time_GC=11.648user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23727name=byelapsed=0.122
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6212name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6285name=byelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23758name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=23913name=byelapsed=0.077
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24033name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_Semantics.thyoffset=6853name=byelapsed=0.502
command_timing = :file=~~/afp/thys/Formal_SSA/SSA_CFG.thyoffset=24142name=byelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2398name=byelapsed=0.140
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2490name=byelapsed=0.126
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=2567name=byelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43122name=applyelapsed=2.373
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15610name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9975name=byelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=9375name=byelapsed=0.086
ML_statistics = :now=1464804953.2tasks_ready=244tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=74size_allocation=2447376384size_allocation_free=1570407008size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2449091624threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=478.088time_GC=11.648user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15743name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10155name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=15912name=byelapsed=0.059
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10277name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10357name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16161name=byelapsed=0.070
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10427name=ultimatelyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20064name=byelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10438name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=16347name=byelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10566name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10632name=haveelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=20238name=byelapsed=0.105
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10776name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22224name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22338name=haveelapsed=0.046
ML_statistics = :now=1464804953.7tasks_ready=241tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=74size_allocation=2447376384size_allocation_free=749014600size_heap=4192206848size_heap_free_last_full_GC=0size_heap_free_last_GC=2449091624threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=479.684time_GC=11.648user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22398name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44155name=byelapsed=0.188
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22521name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22552name=nextelapsed=0.094
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=44248name=byelapsed=0.144
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22603name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22663name=showelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28626name=byelapsed=0.094
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28875name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29486name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33687name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33822name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=28934name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=33918name=byelapsed=0.067
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29163name=nextelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29182name=fixelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29250name=haveelapsed=0.046
ML_statistics = :now=1464804954.25tasks_ready=239tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=75size_allocation=2446327808size_allocation_free=1786939528size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2447899256threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=483.064time_GC=11.696user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29315name=ultimatelyelapsed=0.044
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29326name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34262name=byelapsed=0.189
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34406name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34606name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=34521name=byelapsed=0.033
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35091name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=35226name=byelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36380name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43200name=applyelapsed=1.377
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43380name=applyelapsed=0.038
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43487name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36323name=byelapsed=0.226
ML_statistics = :now=1464804954.75tasks_ready=223tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=75size_allocation=2446327808size_allocation_free=958733232size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2447899256threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=484.664time_GC=11.696user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36639name=byelapsed=0.354
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=36736name=byelapsed=0.400
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37115name=byelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37283name=fixelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37023name=byelapsed=0.418
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37478name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23707name=byelapsed=0.041
ML_statistics = :now=1464804955.29tasks_ready=218tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=76size_allocation=2434793472size_allocation_free=2434793472size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2436245144threads_in_ML=3threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=486.38time_GC=11.752user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37699name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=23957name=byelapsed=0.071
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37699name=obtainelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24019name=byelapsed=0.016
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37848name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24513name=haveelapsed=0.058
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38018name=henceelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24793name=haveelapsed=0.056
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38154name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25062name=ultimatelyelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38165name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25073name=showelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38311name=haveelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25102name=nextelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38529name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25153name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38529name=obtainelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25395name=obtainelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38767name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25395name=obtainelapsed=0.042
ML_statistics = :now=1464804955.79tasks_ready=224tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=76size_allocation=2434793472size_allocation_free=1823995176size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2436245144threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=487.98time_GC=11.752user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25535name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38848name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25648name=haveelapsed=0.057
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38994name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39046name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26117name=haveelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26264name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39184name=ultimatelyelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=26243name=byelapsed=0.032
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39195name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27268name=byelapsed=0.021
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39267name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27337name=byelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39345name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27719name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27870name=nextelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39490name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27887name=fixelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39490name=obtainelapsed=0.051
ML_statistics = :now=1464804956.29tasks_ready=227tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=76size_allocation=2434793472size_allocation_free=1333854584size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2436245144threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=489.58time_GC=11.752user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27995name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39636name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28100name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39636name=obtainelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19270name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39813name=letelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=19461name=byelapsed=0.031
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39865name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20052name=byelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40563name=henceelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40714name=obtainelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20258name=byelapsed=0.138
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40714name=obtainelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40883name=obtainelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40883name=obtainelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20496name=byelapsed=0.144
ML_statistics = :now=1464804956.79tasks_ready=225tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=76size_allocation=2434793472size_allocation_free=200172744size_heap=4185915392size_heap_free_last_full_GC=0size_heap_free_last_GC=2436245144threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=492.728time_GC=11.752user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41051name=letelapsed=0.072
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20669name=byelapsed=0.053
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41118name=haveelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42049name=henceelapsed=0.151
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18514name=byelapsed=0.167
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43511name=applyelapsed=2.491
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42107name=ultimatelyelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=20778name=byelapsed=0.069
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA.thyoffset=18613name=byelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42118name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21056name=byelapsed=0.077
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21409name=showelapsed=0.054
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21501name=haveelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21579name=haveelapsed=0.050
ML_statistics = :now=1464804957.39tasks_ready=226tasks_pending=1tasks_running=5tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=77size_allocation=2426404864size_allocation_free=1739850344size_heap=4178575360size_heap_free_last_full_GC=0size_heap_free_last_GC=2427385304threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=494.896time_GC=11.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21678name=ultimatelyelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21177name=byelapsed=0.299
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21689name=showelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21748name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22187name=byelapsed=0.095
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21815name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22769name=haveelapsed=0.052
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22874name=ultimatelyelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22885name=showelapsed=0.051
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22978name=nextelapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23060name=haveelapsed=0.050
ML_statistics = :now=1464804957.9tasks_ready=223tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=77size_allocation=2426404864size_allocation_free=1074530216size_heap=4178575360size_heap_free_last_full_GC=0size_heap_free_last_GC=2427385304threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=496.496time_GC=11.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23112name=thuselapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22379name=byelapsed=0.463
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10405name=byelapsed=0.012
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10498name=byelapsed=0.039
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10693name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=22444name=byelapsed=0.028
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29028name=henceelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29097name=thuselapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29365name=byelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=37770name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=24994name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38176name=byelapsed=0.088
ML_statistics = :now=1464804958.47tasks_ready=198tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=78size_allocation=2404384768size_allocation_free=2404384768size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2406014544threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=498.668time_GC=11.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43587name=applyelapsed=1.459
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43704name=applyelapsed=0.036
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38639name=byelapsed=0.120
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43803name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25230name=applyelapsed=0.023
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25257name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=25308name=byelapsed=0.078
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38796name=byelapsed=0.027
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=38916name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39022name=byelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=10308name=byelapsed=0.858
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26199name=byelapsed=0.030
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39206name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26360name=henceelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39290name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=27825name=byelapsed=0.010
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26467name=henceelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27715name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39564name=byelapsed=0.097
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27884name=nextelapsed=0.045
ML_statistics = :now=1464804958.97tasks_ready=185tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=78size_allocation=2404384768size_allocation_free=1578255608size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2406014544threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=500.256time_GC=11.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32625name=applyelapsed=10.495
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27985name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=28022name=byelapsed=0.042
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39725name=byelapsed=0.135
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=39950name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40036name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40804name=byelapsed=0.103
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40973name=byelapsed=0.022
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40095name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32675name=applyelapsed=0.252
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41203name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40155name=thuselapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41312name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40298name=showelapsed=0.045
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41371name=showelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40355name=showelapsed=0.046
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=42165name=byelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41437name=haveelapsed=0.047
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=21864name=byelapsed=0.019
ML_statistics = :now=1464804959.47tasks_ready=180tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=78size_allocation=2404384768size_allocation_free=896604136size_heap=4182769664size_heap_free_last_full_GC=0size_heap_free_last_GC=2406014544threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=501.844time_GC=11.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41507name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32698name=applyelapsed=0.252
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41572name=showelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=22919name=byelapsed=0.092
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41634name=haveelapsed=0.048
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41753name=thuselapsed=0.049
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv.thyoffset=23157name=byelapsed=0.117
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=29052name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26679name=applyelapsed=0.029
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26823name=applyelapsed=0.035
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27815name=byelapsed=0.196
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=26848name=applyelapsed=0.136
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=28085name=byelapsed=0.109
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40069name=byelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32720name=applyelapsed=0.541
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27144name=applyelapsed=0.141
ML_statistics = :now=1464804960.06tasks_ready=170tasks_pending=1tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=79size_allocation=2397044736size_allocation_free=2397044736size_heap=4179623936size_heap_free_last_full_GC=0size_heap_free_last_GC=2397997224threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=504.044time_GC=12.016user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27385name=applyelapsed=0.050
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40216name=byelapsed=0.060
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41345name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=40493name=byelapsed=0.024
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41468name=byelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41546name=byelapsed=0.015
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41694name=byelapsed=0.040
command_timing = :file=~~/afp/thys/Formal_SSA/Minimality.thyoffset=41930name=byelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32741name=applyelapsed=0.255
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43822name=applyelapsed=1.923
ML_statistics = :now=1464804960.56tasks_ready=0tasks_pending=0tasks_running=3tasks_passive=0tasks_urgent=0workers_total=8workers_active=3workers_waiting=0full_GCs=0partial_GCs=79size_allocation=2397044736size_allocation_free=1572723896size_heap=4179623936size_heap_free_last_full_GC=0size_heap_free_last_GC=2397997224threads_in_ML=4threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=505.608time_GC=12.016user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32761name=applyelapsed=0.274
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=43893name=byelapsed=0.286
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32780name=applyelapsed=0.454
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32862name=applyelapsed=0.011
ML_statistics = :now=1464804961.07tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=79size_allocation=2397044736size_allocation_free=194944048size_heap=4179623936size_heap_free_last_full_GC=0size_heap_free_last_GC=2397997224threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=508.2time_GC=12.016user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=32988name=applyelapsed=0.288
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33163name=applyelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33182name=applyelapsed=0.086
ML_statistics = :now=1464804961.61tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=80size_allocation=2380267520size_allocation_free=2380267520size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2381324056threads_in_ML=1threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=508.568time_GC=12.076user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804962.11tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=80size_allocation=2380267520size_allocation_free=1483745288size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2381324056threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=510.172time_GC=12.076user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804962.61tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=80size_allocation=2380267520size_allocation_free=1090237232size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2381324056threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=510.972time_GC=12.076user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804963.11tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=80size_allocation=2380267520size_allocation_free=686880608size_heap=4186963968size_heap_free_last_full_GC=0size_heap_free_last_GC=2381324056threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=511.768time_GC=12.076user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804963.64tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=2380267520size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=1threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=513.08time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804964.14tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=1942382296size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=513.88time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33228name=applyelapsed=3.173
ML_statistics = :now=1464804964.64tasks_ready=0tasks_pending=1tasks_running=2tasks_passive=0tasks_urgent=0workers_total=8workers_active=2workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=1516555880size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=2threads_total=11threads_wait_condvar=7threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=514.68time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27411name=applyelapsed=4.654
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=27595name=byelapsed=0.044
ML_statistics = :now=1464804965.14tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=1110692640size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=2threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=515.492time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804965.64tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=665267880size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=516.324time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33293name=applyelapsed=1.045
ML_statistics = :now=1464804966.15tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=442865320size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=516.724time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804966.65tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=81size_allocation=2380267520size_allocation_free=238288552size_heap=4189061120size_heap_free_last_full_GC=0size_heap_free_last_GC=2381372984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=517.128time_GC=12.096user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33336name=applyelapsed=1.085
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33508name=applyelapsed=0.107
ML_statistics = :now=1464804967.15tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=2385510400size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=517.664time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804967.65tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=2138202080size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=518.064time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804968.15tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=1893779392size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=518.468time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804968.66tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=1464268888size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=519.272time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804969.16tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=1243963432size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=519.672time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804969.66tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=1022609432size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=520.072time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804970.16tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=586281144size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=520.876time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804970.66tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=382752928size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=521.276time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804971.17tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=82size_allocation=2385510400size_allocation_free=163496048size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386207296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=521.676time_GC=12.116user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804971.68tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=2160312384size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=522.376time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804972.18tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=1941055536size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=522.78time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804972.68tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=1719701520size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=523.18time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804973.18tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=1506211856size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=523.584time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804973.69tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=1064640640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=524.384time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804974.19tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=844335200size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=524.788time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804974.69tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=622981192size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=525.188time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804975.19tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=83size_allocation=2385510400size_allocation_free=411064416size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2386869040threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=525.588time_GC=12.132user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804975.69tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=2384461824size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=526.356time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804976.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=2158126968size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=526.76time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804976.7tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=1934675880size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=527.16time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804977.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=1723807656size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=527.56time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804977.7tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=1297965160size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=528.36time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804978.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=1087096944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=528.76time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804978.7tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=879374488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=529.16time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804979.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=671652088size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=529.56time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804979.7tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=84size_allocation=2384461824size_allocation_free=238469568size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385610608threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=530.364time_GC=12.148user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804980.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=2384461824size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=530.856time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33529name=applyelapsed=13.476
ML_statistics = :now=1464804980.71tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=2177001472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=531.256time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804981.21tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=1969278928size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=531.656time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33576name=applyelapsed=1.032
ML_statistics = :now=1464804981.71tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=1764177880size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=532.06time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804982.21tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=1323655296size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=532.86time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33596name=applyelapsed=0.988
ML_statistics = :now=1464804982.71tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=1106495600size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=533.26time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804983.21tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=894578784size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=533.66time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33615name=applyelapsed=0.998
ML_statistics = :now=1464804983.71tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=673224808size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=534.06time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804984.21tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=85size_allocation=2384461824size_allocation_free=229556464size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385491256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=534.86time_GC=12.164user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33633name=applyelapsed=0.975
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33704name=applyelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33810name=applyelapsed=0.011
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=33934name=applyelapsed=0.192
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34105name=applyelapsed=0.017
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34123name=applyelapsed=0.075
ML_statistics = :now=1464804984.72tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=2384461824size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=535.3time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804985.22tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=2164418504size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=535.7time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34168name=applyelapsed=0.904
ML_statistics = :now=1464804985.72tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=1951453112size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=536.1time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804986.22tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=1733244936size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=536.504time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34231name=applyelapsed=0.781
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34401name=applyelapsed=0.050
ML_statistics = :now=1464804986.72tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=1281188000size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=537.304time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804987.23tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=1036765248size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=537.704time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804987.73tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=810168408size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=538.104time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804988.23tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=581474312size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=538.504time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804988.73tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=86size_allocation=2384461824size_allocation_free=125223112size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2385663968threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=539.308time_GC=12.184user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804989.23tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=2383413248size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=539.528time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804989.74tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=1921132744size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=540.332time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804990.24tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=1695584472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=540.732time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34421name=applyelapsed=4.259
ML_statistics = :now=1464804990.74tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=1476852008size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=541.132time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804991.24tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=1262838000size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=541.536time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34465name=applyelapsed=0.688
ML_statistics = :now=1464804991.75tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=821266968size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=542.336time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34482name=applyelapsed=0.680
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34631name=applyelapsed=0.018
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34699name=applyelapsed=0.020
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=34842name=applyelapsed=0.026
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35078name=applyelapsed=0.013
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35250name=applyelapsed=0.034
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35268name=applyelapsed=0.060
ML_statistics = :now=1464804992.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=599912976size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=542.736time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804992.75tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=87size_allocation=2383413248size_allocation_free=368073320size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384135984threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=543.136time_GC=12.2user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804993.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=2383413248size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=543.812time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804993.75tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=2171758504size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=544.212time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804994.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=1955647376size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=544.612time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804994.76tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=1751070560size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=545.016time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804995.26tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=1331519496size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=545.816time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804995.76tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=1115408312size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=546.216time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804996.26tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=902442976size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=546.616time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804996.76tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=692623312size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=547.016time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804997.26tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=88size_allocation=2383413248size_allocation_free=283557992size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2384409632threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=547.82time_GC=12.22user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804997.78tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=2382364672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=548.352time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804998.28tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=2157078472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=548.752time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804998.78tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=1931530096size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=549.152time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804999.29tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=1704409000size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=549.556time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464804999.79tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=1254449224size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=550.356time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805000.29tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=1034143768size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=550.76time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805000.79tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=806498304size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=551.16time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805001.3tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=581998592size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=551.56time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805001.8tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=89size_allocation=2382364672size_allocation_free=135184576size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383262216threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=552.364time_GC=12.236user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805002.3tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=2382364672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=552.608time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805002.8tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=1946298408size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=553.428time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805003.31tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=1734381720size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=553.828time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805003.81tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=1526134864size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=554.232time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805004.31tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=1314218064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=554.632time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805004.81tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=884181232size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=555.432time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805005.32tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=667021488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=555.832time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35363name=applyelapsed=13.361
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35478name=applyelapsed=0.012
ML_statistics = :now=1464805005.82tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=451958992size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=556.232time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35604name=applyelapsed=0.246
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35779name=applyelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35798name=applyelapsed=0.094
ML_statistics = :now=1464805006.32tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=90size_allocation=2382364672size_allocation_free=245285080size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383150336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=556.632time_GC=12.256user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805006.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=2162409592size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=557.452time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805007.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=1943152744size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=557.852time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805007.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=1716555784size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=558.252time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805008.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=1495201824size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=558.652time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805008.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=1049436328size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=559.456time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35844name=applyelapsed=2.922
ML_statistics = :now=1464805009.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=821790872size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=559.856time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805009.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=595193984size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=560.256time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35909name=applyelapsed=0.988
ML_statistics = :now=1464805010.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=91size_allocation=2382364672size_allocation_free=367548504size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2383365272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=560.656time_GC=12.276user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805010.85tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=2381316096size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=561.328time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=35952name=applyelapsed=1.042
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36124name=applyelapsed=0.102
ML_statistics = :now=1464805011.35tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=2168612672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=561.728time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805011.85tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=1916850088size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=562.128time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805012.35tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=1457977472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=562.928time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805012.85tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=1238720544size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=563.332time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805013.35tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=1018415168size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=563.732time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805013.86tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=801255456size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=564.132time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805014.36tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=369121232size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=564.932time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805014.86tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=92size_allocation=2381316096size_allocation_free=154058864size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2382904504threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=565.332time_GC=12.304user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805015.36tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=2380267520size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=565.616time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805015.87tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=1933715536size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=566.42time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805016.37tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=1711312952size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=566.82time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805016.87tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=1504639008size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=567.22time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805017.37tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=1285382096size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=567.624time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805017.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=846956712size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=568.424time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805018.38tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=624554064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=568.824time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805018.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=405297256size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=569.224time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805019.38tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=93size_allocation=2380267520size_allocation_free=187088968size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381242736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=569.628time_GC=12.324user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805019.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=2158215336size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=570.368time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805020.39tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=1933715576size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=570.772time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805020.89tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=1711312992size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=571.172time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805021.39tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=1490483280size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=571.572time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805021.89tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=1071980720size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=572.42time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805022.39tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=853772504size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=572.82time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805022.9tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=637661384size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=573.22time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805023.4tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=94size_allocation=2380267520size_allocation_free=418404584size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380991520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=573.624time_GC=12.348user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805023.9tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=2380267520size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=574.404time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805024.4tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=2160224176size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=574.808time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805024.91tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=1933627328size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=575.208time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805025.41tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=1710176160size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=575.612time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805025.91tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=1262313544size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=576.412time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805026.41tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=1039910936size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=576.812time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805026.92tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=815411216size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=577.212time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805027.42tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=597202952size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=577.612time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805027.92tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=95size_allocation=2380267520size_allocation_free=164020376size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2381940224threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=578.416time_GC=12.36user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36145name=applyelapsed=17.143
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36347name=applyelapsed=0.056
ML_statistics = :now=1464805028.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=2379218944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=578.708time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805028.94tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=1882335352size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=579.512time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805029.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=1653641320size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=579.912time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805029.94tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=1425471552size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=580.312time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805030.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=1198874656size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=580.712time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805030.94tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=743672000size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=581.516time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805031.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=513929400size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=581.916time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805031.95tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=96size_allocation=2379218944size_allocation_free=294672528size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380457152threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=582.316time_GC=12.376user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805032.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=2379218944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=582.876time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805032.97tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=2158126992size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=583.276time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805033.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=1943064408size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=583.68time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805033.97tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=1536620576size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=584.48time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805034.48tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=1317363704size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=584.88time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805034.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=1092863984size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=585.28time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805035.48tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=868364224size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=585.68time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805035.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=421550224size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=586.484time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805036.49tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=97size_allocation=2379218944size_allocation_free=201244744size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379917520threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=586.884time_GC=12.392user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805037tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=2379218944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=587.252time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805037.51tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=1912744128size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=588.056time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805038.01tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=1685098664size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=588.456time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805038.51tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=1464793200size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=588.856time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805039.01tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=1246584928size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=589.256time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805039.51tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=818645200size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=590.06time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805040.02tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=590999776size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=590.46time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805040.52tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=98size_allocation=2379218944size_allocation_free=364402896size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2380863192threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=590.86time_GC=12.408user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805041.03tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=2378170368size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=591.516time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805041.53tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=2170709952size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=591.916time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805042.03tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=1964036000size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=592.316time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805042.54tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=1748449184size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=592.716time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805043.04tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=1328898112size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=593.516time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805043.54tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=1125369904size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=593.916time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805044.04tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=920793080size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=594.32time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805044.54tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=712021984size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=594.72time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805045.04tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=99size_allocation=2378170368size_allocation_free=288276592size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379652736threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=595.52time_GC=12.428user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805045.55tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=2378170368size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=596.068time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805046.05tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=2164418424size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=596.468time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805046.55tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=1947258696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=596.868time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805047.05tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=1730098960size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=597.272time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805047.55tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=1284333504size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=598.072time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805048.05tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=1066125200size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=598.472time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805048.56tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=836382560size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=598.872time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805049.06tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=612931392size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=599.276time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805049.56tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=100size_allocation=2378170368size_allocation_free=157728720size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379438752threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=600.076time_GC=12.444user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805050.06tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=2378170368size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=600.352time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805050.56tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=2163369912size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=600.752time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805051.07tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=1749061736size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=601.556time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805051.57tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=1521940552size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=601.956time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805052.07tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=1299537976size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=602.356time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805052.57tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=1069795304size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=602.768time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805053.08tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=614592696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=603.572time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805053.58tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=383801488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=604.288time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805054.08tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=101size_allocation=2378170368size_allocation_free=154058888size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379358400threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=604.688time_GC=12.46user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805054.59tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=2152972320size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=605.368time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805055.1tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=1928472592size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=605.768time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805055.6tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=1705021464size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=606.168time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805056.1tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=1478424632size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=606.568time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805056.6tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=1041047784size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=607.372time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805057.1tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=814450936size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=607.772time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805057.6tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=588902696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=608.172time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805058.1tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=102size_allocation=2378170368size_allocation_free=363354184size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379260112threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=608.572time_GC=12.476user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805058.61tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=2378170368size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=609.224time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805059.11tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=2149738432size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=609.624time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805059.61tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=1687195720size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=610.428time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805060.12tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=1459025984size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=610.828time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805060.62tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=1235574832size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=611.244time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805061.12tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=1024706544size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=611.644time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805061.63tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=599912568size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=612.448time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805062.13tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=377509944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=612.848time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36473name=applyelapsed=34.142
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36586name=applyelapsed=0.011
ML_statistics = :now=1464805062.63tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=103size_allocation=2378170368size_allocation_free=141475672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379019568threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=613.252time_GC=12.492user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36710name=applyelapsed=0.240
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36881name=applyelapsed=0.025
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36899name=applyelapsed=0.112
ML_statistics = :now=1464805063.13tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=2111029344size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=613.924time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805063.64tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=1860315208size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=614.328time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805064.14tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=1647349776size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=614.728time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805064.64tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=1430714384size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=615.128time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805065.15tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=1001726064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=615.94time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805065.65tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=787712128size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=616.34time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805066.15tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=570552424size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=616.74time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805066.65tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=104size_allocation=2378170368size_allocation_free=351295568size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2379596280threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=617.144time_GC=12.516user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805067.16tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=2377121792size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=617.792time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805067.66tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=2165467008size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=618.192time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805068.16tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=1950404456size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=618.592time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805068.67tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=1516173288size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=619.396time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805069.17tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=1301110696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=619.796time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805069.67tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=1081853608size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=620.2time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805070.18tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=860499888size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=620.6time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805070.68tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=440948880size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=621.4time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805071.18tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=105size_allocation=2377121792size_allocation_free=234277024size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378055896threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=621.804time_GC=12.532user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805071.68tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=2377121792size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=622.272time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805072.19tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=2177001344size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=622.672time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805072.69tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=1757450328size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=623.472time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805073.19tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=1541863472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=623.876time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805073.7tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=1328898080size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=624.276time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805074.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=1116981296size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=624.676time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805074.7tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=695333040size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=625.524time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805075.2tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=472930568size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=625.924time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805075.71tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=106size_allocation=2377121792size_allocation_free=266256616size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377889952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=626.324time_GC=12.548user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805076.21tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=2377121792size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=626.804time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805076.72tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=2153932680size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=627.208time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805077.22tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=1694535696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=628.008time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805077.72tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=1472133064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=628.412time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805078.22tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=1235050416size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=628.812time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=36944name=applyelapsed=15.777
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37161name=applyelapsed=0.098
ML_statistics = :now=1464805078.73tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=1009502088size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=629.212time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37211name=applyelapsed=0.099
ML_statistics = :now=1464805079.23tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=571076640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=630.016time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805079.74tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=107size_allocation=2377121792size_allocation_free=266885120size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2378633480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=630.416time_GC=12.564user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805080.24tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=2376073216size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=630.768time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805080.74tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=1940007040size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=631.568time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805081.24tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=1714458696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=631.968time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805081.74tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=1491531848size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=632.372time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805082.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=1271226400size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=632.772time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805082.75tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=820217976size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=633.572time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805083.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=598863960size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=633.972time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805083.76tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=108size_allocation=2376073216size_allocation_free=372267112size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376842480threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=634.376time_GC=12.584user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805084.27tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=2376073216size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=635.04time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805084.77tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=2151835480size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=635.444time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805085.28tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=1925238544size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=635.888time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805085.78tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=1696544448size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=636.288time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805086.28tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=1237147528size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=637.088time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805086.79tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=1009502048size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=637.492time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805087.29tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=789196592size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=637.892time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805087.79tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=578328280size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=638.292time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805088.29tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=109size_allocation=2376073216size_allocation_free=157728664size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2377756760threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=639.092time_GC=12.596user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805088.8tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=2375024640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=639.376time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805089.3tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=2152884160size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=639.776time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805089.8tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=1701875880size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=640.58time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805090.31tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=1475803392size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=640.98time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805090.81tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=1248157912size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=641.38time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805091.31tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=1023658160size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=641.78time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805091.82tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=566358344size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=642.584time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805092.32tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=110size_allocation=2375024640size_allocation_free=338712888size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376505960threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=642.984time_GC=12.612user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805092.82tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=2375024640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=643.604time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805093.33tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=2147641208size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=644.008time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805093.83tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=1917898584size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=644.408time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805094.33tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=1692874544size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=644.808time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805094.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=1240817488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=645.612time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805095.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=1015269296size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=646.012time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805095.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=792866696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=646.412time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805096.35tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=568366952size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=646.812time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805096.85tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=111size_allocation=2375024640size_allocation_free=119455728size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376288296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=647.616time_GC=12.628user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805097.35tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=2375024640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=647.832time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805097.86tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=1923229728size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=648.636time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805098.36tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=1693487112size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=649.036time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805098.86tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=1465841600size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=649.436time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805099.36tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=1237147512size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=649.836time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805099.87tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=776702032size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=650.636time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805100.37tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=557445168size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=651.04time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805100.87tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=112size_allocation=2375024640size_allocation_free=329799712size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376187976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=651.44time_GC=12.644user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805101.38tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=2375024640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=652.032time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805101.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=2164418480size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=652.432time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805102.38tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=1945161632size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=652.836time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805102.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=1511454776size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=653.636time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805103.39tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=1289052184size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=654.036time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805103.89tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=1067698176size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=654.44time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805104.39tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=842149856size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=654.84time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805104.9tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=395335816size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=655.644time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805105.4tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=113size_allocation=2375024640size_allocation_free=172933224size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376003704threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=656.044time_GC=12.664user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805105.91tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=2375024640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=656.356time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805106.41tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=1920084016size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=657.156time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805106.92tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=1692438552size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=657.556time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805107.42tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=1465841624size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=657.956time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805107.92tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=1237147584size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=658.36time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805108.43tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=771459144size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=659.164time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805108.93tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=545910784size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=659.564time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805109.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=114size_allocation=2375024640size_allocation_free=329799696size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375841648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=659.964time_GC=12.684user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805109.94tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=2375024640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=660.552time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805110.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=2147641264size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=660.956time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805110.95tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=1923141512size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=661.356time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805111.45tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=1479997512size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=662.156time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805111.96tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=1260740400size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=662.556time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805112.46tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=1039386624size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=662.956time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805112.96tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=818032584size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=663.36time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805113.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=365975664size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=664.16time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805113.97tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=115size_allocation=2375024640size_allocation_free=143573096size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2376644592threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=664.56time_GC=12.704user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805114.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=2145632312size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=665.22time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805114.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=1917986824size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=665.64time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805115.48tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=1690341352size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=666.04time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805115.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=1460598704size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=666.444time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805116.48tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=1005396056size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=667.248time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805116.99tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=777750568size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=667.648time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805117.49tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=549056488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=668.048time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805118tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=116size_allocation=2373976064size_allocation_free=319313904size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375373072threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=668.448time_GC=12.724user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805118.5tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=2373976064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=669.008time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805119.01tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=2149738488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=669.408time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805119.51tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=1700827280size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=670.212time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805120.01tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=1476851840size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=670.612time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805120.52tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=1249206376size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=671.012time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805121.02tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=1021560888size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=671.412time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805121.53tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=565309680size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=672.216time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805122.03tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=117size_allocation=2373976064size_allocation_free=338712768size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375136120threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=672.616time_GC=12.74user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805122.55tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=2373976064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=673.208time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805123.06tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=2147641120size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=673.608time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805123.56tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=1921044224size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=674.008time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805124.07tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=1474754472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=674.804time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805124.58tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=1252351856size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=675.204time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805125.08tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=1032046368size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=675.628time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805125.59tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=803352360size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=676.036time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805126.1tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=349198288size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=676.836time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805126.6tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=118size_allocation=2373976064size_allocation_free=135184344size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375003272threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=677.236time_GC=12.756user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805127.11tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=2373976064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=677.508time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805127.62tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=1916938360size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=678.312time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805128.12tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=1685098576size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=678.716time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805128.63tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=1456928840size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=679.116time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805129.15tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=1230331928size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=679.52time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805129.67tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=769888384size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=680.332time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805130.19tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=541194384size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=680.74time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805130.71tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=119size_allocation=2373976064size_allocation_free=312500352size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374806008threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=681.156time_GC=12.776user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805131.24tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=2373976064size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=681.716time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805131.74tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=1926375496size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=682.52time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805132.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=1700827160size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=682.92time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805132.75tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=1475803144size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=683.32time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805133.25tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=1249206256size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=683.72time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805133.75tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=817072272size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=684.524time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805134.26tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=596766784size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=684.924time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805134.76tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2373976064size_allocation_free=387995720size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=685.324time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805135.27tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=120size_allocation=2375024640size_allocation_free=180273176size_heap=4194304000size_heap_free_last_full_GC=0size_heap_free_last_GC=2374650648threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=685.724time_GC=12.792user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805135.78tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=2149826672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=686.472time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805136.28tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=1905403952size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=686.876time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805136.78tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=1671467024size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=687.276time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805137.29tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=1453258720size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=687.676time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805137.79tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=983375984size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=688.504time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805138.3tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=755730464size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=688.904time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805138.8tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=524941408size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=689.308time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805139.3tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=121size_allocation=2373976064size_allocation_free=69738792size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2375556576threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=690.108time_GC=12.812user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805139.81tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=2372927488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=690.236time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805140.31tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=1902258056size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=691.04time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805140.81tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=1674612808size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=691.44time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805141.32tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=1441200216size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=691.844time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805141.82tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=1208311856size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=692.244time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805142.32tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=753108944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=693.044time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805142.82tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=519172256size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=693.448time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805143.33tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=122size_allocation=2372927488size_allocation_free=292575368size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374185912threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=693.848time_GC=12.832user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805143.83tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=2372927488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=694.352time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805144.33tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=2154981256size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=694.756time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805144.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=1686147080size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=695.556time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805145.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=1442772896size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=695.96time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37255name=applyelapsed=66.958
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37357name=applyelapsed=0.043
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37461name=applyelapsed=0.010
ML_statistics = :now=1464805145.84tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=1210933168size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=696.36time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37583name=applyelapsed=0.211
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37750name=applyelapsed=0.019
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37767name=applyelapsed=0.055
ML_statistics = :now=1464805146.34tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=993773456size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=696.76time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805146.85tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=541716488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=697.564time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805147.35tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=325605352size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=697.964time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805147.85tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=123size_allocation=2372927488size_allocation_free=136757248size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373919096threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=698.372time_GC=12.852user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805148.37tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=2159263888size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=699.088time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805148.87tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=1942104192size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=699.488time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805149.38tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=1723895872size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=699.892time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805149.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=1507260488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=700.292time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805150.38tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=1060446416size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=701.096time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805150.88tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=821266600size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=701.496time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805151.39tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=595718240size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=701.896time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805151.89tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=124size_allocation=2372927488size_allocation_free=373315688size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2374258256threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=702.3time_GC=12.876user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805152.41tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=2371878912size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=702.968time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805152.91tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=2135058304size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=703.368time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=37811name=applyelapsed=7.217
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38022name=applyelapsed=0.065
ML_statistics = :now=1464805153.41tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=1693487072size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=704.172time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38070name=applyelapsed=0.066
ML_statistics = :now=1464805153.92tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=1465841648size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=704.572time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805154.42tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=1227710384size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=704.972time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805154.92tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=1007404944size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=705.372time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805155.43tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=570028072size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=706.172time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805155.93tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=349722584size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=706.592time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805156.43tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=125size_allocation=2371878912size_allocation_free=129417176size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372678296threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=706.992time_GC=12.896user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805156.93tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=2140389528size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=707.632time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805157.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=1907501152size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=708.032time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805157.94tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=1681952848size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=708.436time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805158.44tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=1448540232size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=708.836time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805158.95tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=981803216size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=709.64time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805159.45tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=758352056size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=710.04time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805159.95tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=535949488size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=710.44time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805160.45tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=126size_allocation=2371878912size_allocation_free=310401160size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2373226336threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=710.84time_GC=12.916user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805160.96tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=2370830336size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=711.376time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805161.46tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=1915889712size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=712.22time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805161.96tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=1690341376size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=712.62time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805162.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=1467414528size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=713.024time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805162.97tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=1236623312size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=713.424time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805163.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=779323376size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=714.224time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805163.97tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=550629440size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=714.628time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805164.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=127size_allocation=2370830336size_allocation_free=322983968size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372024952threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=715.028time_GC=12.928user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805164.97tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=2370830336size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=715.6time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805165.47tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=2139252600size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=716.004time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805165.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=1904267176size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=716.404time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805166.48tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=1431238712size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=717.204time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805166.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=1195204592size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=717.608time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805167.48tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=961267640size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=718.012time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805167.98tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=728379336size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=718.416time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805168.49tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=128size_allocation=2370830336size_allocation_free=265836656size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371852584threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=719.212time_GC=12.944user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805168.99tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=2370830336size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=719.704time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805169.49tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=2137133968size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=720.104time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805169.99tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=1911607192size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=720.504time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805170.5tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=1684486056size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=720.904time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805171tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=1235574912size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=721.72time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805171.5tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=1010026672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=722.12time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805172.01tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=777138440size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=722.52time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805172.51tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=550541536size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=722.92time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805173.01tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=129size_allocation=2370830336size_allocation_free=107921768size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371661048threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=723.72time_GC=12.96user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805173.51tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=2370830336size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=723.908time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805174.02tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=1891772472size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=724.708time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805174.52tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=1652592672size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=725.112time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805175.02tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=1415510008size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=725.512time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805175.53tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=1180524496size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=725.912time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805176.03tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=720078984size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=726.736time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805176.53tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=492433504size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=727.136time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
ML_statistics = :now=1464805177.03tasks_ready=0tasks_pending=1tasks_running=1tasks_passive=0tasks_urgent=0workers_total=8workers_active=1workers_waiting=0full_GCs=0partial_GCs=130size_allocation=2370830336size_allocation_free=265836584size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2372038976threads_in_ML=1threads_total=11threads_wait_condvar=8threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=727.536time_GC=12.98user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
command_timing = :file=~~/afp/thys/Formal_SSA/Construct_SSA_notriv_code.thyoffset=38113name=applyelapsed=24.047
ML_statistics = :now=1464805177.54tasks_ready=292tasks_pending=0tasks_running=4tasks_passive=0tasks_urgent=0workers_total=8workers_active=4workers_waiting=0full_GCs=0partial_GCs=131size_allocation=2369781760size_allocation_free=2369781760size_heap=4193255424size_heap_free_last_full_GC=0size_heap_free_last_GC=2371212192threads_in_ML=1threads_total=11threads_wait_condvar=5threads_wait_IO=0threads_wait_mutex=0threads_wait_signal=1time_CPU=727.992time_GC=13user_counter0=0user_counter1=0user_counter2=0user_counter3=0user_counter4=0user_counter5=0user_counter6=0user_counter7=0
isabelle document -c -o 'pdf' -n 'document' -t '' /media/data/jenkins/workspace/afp-repo-afp/browser_info/AFP/Formal_SSA/document 2>&1
isabelle document -c -o 'pdf' -n 'outline' -t '/proof,/ML' /media/data/jenkins/workspace/afp-repo-afp/browser_info/AFP/Formal_SSA/outline 2>&1
This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex)
 restricted \write18 enabled.
entering extended mode
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 79 languages loaded.

(./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def))
(/usr/share/texlive/texmf-dist/tex/latex/quotmark/quotmark.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
For additional information on amsmath, use the `?' option.
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def
(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg)
(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty)
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty))))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de
f)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code.
tex)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet
ric.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod
e.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerari
thmetics.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct.
code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation
s.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t
ex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code.
tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code.
tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex
) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex
)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65
.sty)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18
.sty)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/math/pgfmath.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarytopaths.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarypositioning.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarycalc.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibraryarrows.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code.
tex)) (./isabelle.sty (./comment.sty Excluding comment 'comment')
Including comment 'isadelimtheory' Including comment 'isatagtheory'
Including comment 'isadelimproof' Including comment 'isatagproof'
Including comment 'isadelimML' Including comment 'isatagML'
Including comment 'isadelimvisible' Including comment 'isatagvisible'
Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible')
(./isabelletags.sty Including comment 'isadelimproof'
Excluding comment 'isatagproof' Including comment 'isadelimML'
Excluding comment 'isatagML') (./isabellesym.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty))
(./pdfsetup.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty))
(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty)
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg)

Package hyperref Warning: Option `pagecolor' is not available anymore.

(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty))

Package hyperref Message: Driver (autodetected): hpdftex.

(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty))
No file root.aux.
ABD: EveryShipout initializing macros
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg))
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd)

LaTeX Warning: Citation `braun13cc' on page 1 undefined on input line 48.


LaTeX Warning: Citation `barthe14' on page 1 undefined on input line 48.

(./session.tex (./Sublist.tex) (./RBT_Set.tex) (./Mapping.tex)
(./RBT_Mapping.tex) (./Char_ord.tex) (./List_lexord.tex) (./Com.tex)
(./AuxLemmas.tex) (./BasicDefs.tex) (./WCFG.tex) (./CFG.tex) (./CFGExit.tex)
(./Interpretation.tex) (./Labels.tex) (./CFG_wf.tex) (./CFGExit_wf.tex)
(./Observable.tex) (./Distance.tex) (./DynDataDependence.tex)
(./DataDependence.tex) (./SemanticsCFG.tex) (./Slice.tex) (./Postdomination.tex
) (./DynStandardControlDependence.tex) (./StandardControlDependence.tex)
(./DynWeakControlDependence.tex) (./WeakControlDependence.tex) (./PDG.tex)
(./WeakOrderDependence.tex) (./CDepInstantiations.tex) (./WellFormed.tex)
(./AdditionalLemmas.tex) (./Graph.tex) (./GraphSpec.tex) (./FormalSSA_Misc.tex
[1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] [2] [3] [4])
(./Serial_Rel.tex [5]
Overfull \hbox (3.40428pt too wide) in paragraph at lines 41--43
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 iterated[]serial[]on[]linear$\OT1/cmr
/m/n/10 :$ \T1/cmr/m/it/10 iterated[]serial[]on A r x $\OT1/cmr/m/n/10 ($\T1/cm
r/m/it/10 n$\OT1/cmr/m/n/10 +$\T1/cmr/m/it/10 m$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/
m/it/10 iterated[]serial[]on
) (./Mapping_Exts.tex [6]
Overfull \hbox (30.45937pt too wide) in paragraph at lines 137--153
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]Mapping[]lookup $\OT1/cmr/m/
n/10 [$\T1/cmr/m/it/10 simp$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 code[]unfold$\O
T1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 Mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 lookup

Overfull \hbox (6.28238pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]lookup[]map$\OT1/cmr/m/n/10 
:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map f g m$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 a $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]o
ption

Overfull \hbox (6.899pt too wide) in paragraph at lines 289--291
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]eq[]iff$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 m1 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m2 $\OMS/cmsy/m/n/10  []!
$ $\OT1/cmr/m/n/10 ($$\OMS/cmsy/m/n/10 8 $\T1/cmr/m/it/10 k$\OML/cmm/m/it/10 :$
 \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup m1 k $\OT1/
cmr/m/n/10 =$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 looku
p

Overfull \hbox (5.08723pt too wide) in paragraph at lines 343--345
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 map[]default[]eq$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map[]default k v f m
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m $\OMS/cmsy/m/n/10  []!$ $\OT1/cmr/m/n/10
 ($$\OMS/cmsy/m/n/10 9 $\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 M
ap-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
[7]) (./RBT_Mapping_Exts.tex
Overfull \hbox (45.4871pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mmap[]rbt[]code $\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mmap f $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mapping t$\
OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 Mapping

Overfull \hbox (80.39288pt too wide) in paragraph at lines 211--213
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]add[]code $\OT1/cmr/m/n/10 [
$\T1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mapping[]add $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Ma
pping t1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$
\T1/cmr/m/it/10 Mapping
) (./Graph_path.tex [8] [9] [10] [11] [12] [13]
Overfull \hbox (8.362pt too wide) in paragraph at lines 953--955
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 path[]by[]tail$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ $[]$\T1/cmr/m/it/10 path g $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 n$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m
/n/10 #$\T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 )$$;$ \T1/cmr/m/it/10 path g $\OT1/c
mr/m/n/10 ($\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ns$\OT1/c
mr/m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 path g $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ms$\OT1/cmr/m/n/10 )$
$[]$

Overfull \hbox (20.01353pt too wide) in paragraph at lines 1061--1063
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 elem[]set[]implies[]elem[]tl[]app[]
cons$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/
10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set xs $\OT1/cmr/m/n/10 =[]\OMS/cmsy/
m/n/10 )$ \T1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 tl $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ys$\OT1/cmr/m/n/
10 @$\T1/cmr/m/it/10 y$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 xs$\OT1/cmr/m/n/10 )$$
)$[] 
[14] [15] [16] [17] [18] [19] [20]) (./SSA_CFG.tex [21] [22] [23]
Overfull \hbox (12.80359pt too wide) in paragraph at lines 290--292
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]defs $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 phiDefs[]def allDefs[]def phiUses[]def allUses[]def allVars[]
def
[24] [25] [26]
Overfull \hbox (1.3536pt too wide) in paragraph at lines 829--831
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]wf[]defs $\OT1/cmr/m/n/
10 =$ \T1/cmr/m/it/10 CFG[]SSA[]defs defNode[]code phi[]def isTrivialPhi[]def
[27] [28] [29] [30] [31]) (./Minimality.tex

LaTeX Warning: Citation `braun13cc' on page 32 undefined on input line 10.

[32] [33]) (./Construct_SSA.tex [34] [35] [36] [37] [38] [39] [40]
Overfull \hbox (21.67505pt too wide) in paragraph at lines 1718--1719
[][]    \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr
/m/it/10 n$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 ns$\OMS/cmsy/m/n/10 !$\T1/cmr/m
/it/10 m n $[]$ set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 tl ns$\OT1/cmr/m/n/10 )$
 \T1/cmr/m/it/10 v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/i
t/10 :$\T1/cmr/m/it/10 allDefs g n v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun
[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses
[41] [42]) (./Construct_SSA_notriv.tex [43]
Overfull \hbox (0.50066pt too wide) in paragraph at lines 61--62
[][]  $\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base $
\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in-v
ar in-Edges$ [] $ En-try old-Defs oldUses
[44]
Overfull \hbox (19.0183pt too wide) in paragraph at lines 335--337
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 sub-sti-tu-tion$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 re-dun-dant g $\OT1/
cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 isTriv-ial-Phi g $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 chooseNext g$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 subst
itution
[45] [46]
Overfull \hbox (13.66513pt too wide) in paragraph at lines 1086--1088
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 chooseNext[]eliminated$\OT1/cmr/m/n
/10 :$ \T1/cmr/m/it/10 chooseNext g $[]$ step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 allDefs g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 defNode g $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 chooseNext

Overfull \hbox (0.34885pt too wide) in paragraph at lines 1581--1583
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv
$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv $\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n
[47] [48] [49]) (./SSA_Semantics.tex [50]) (./While_Combinator_Exts.tex
[51]) (./SSA_CFG_code.tex) (./Construct_SSA_code.tex)
(./Construct_SSA_notriv_code.tex
Overfull \hbox (5.98059pt too wide) in paragraph at lines 34--36
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 substNext[]code g next $\OMS/cmsy/m/n/10 ^^Q
$ $\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 i
f v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 snd next then substitution[]code
[52]
Overfull \hbox (11.98946pt too wide) in paragraph at lines 107--108
[][]    \T1/cmr/m/it/10 fold $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$\T1/cmr/m
/it/10 n$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 update n $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 List$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 map $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 id$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 snd next $\OT1/cmr/m/n/10 :$$=$ \T1/cmr/m/it/10 next$ [] $$\OT1/cmr
/m/n/10 )$$)$ $($\T1/cmr/m/it/10 the $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup

Overfull \hbox (12.97588pt too wide) in paragraph at lines 108--109
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 sorted[]list[]of[]set $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n
/10 )$ $($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nod
es[]of[]phis

Overfull \hbox (4.0448pt too wide) in paragraph at lines 114--115
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 let old[]phis $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ \T1/cmr/m/it/10 id 
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 l
ookup nodes[]of[]phis
[53]
Overfull \hbox (13.59372pt too wide) in paragraph at lines 125--127
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 step[]codem g next next$ [] $ nodes[]of[]use
s nodes[]of[]phis $\OT1/cmr/m/n/10 =$ $($\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (6.30238pt too wide) in paragraph at lines 134--136
[][]\T1/cmr/bx/n/10 locale \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linor
der $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base
[54]
Overfull \hbox (11.81181pt too wide) in paragraph at lines 342--343
[][]$\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linorder
 $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in
-var in-Edges$ [] $ En-try old-Defs oldUses
[55]
Overfull \hbox (0.95255pt too wide) in paragraph at lines 367--368
\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 var $\OML/cmm/m/it/10 ^^U$\T1/cmr/
m/it/10 uses phis$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 chooseNext[]all uses $\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mappi
ng

Overfull \hbox (104.92482pt too wide) in paragraph at lines 453--455
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 redundant[]ign$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]cod
e $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10
 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code

Overfull \hbox (24.16965pt too wide) in paragraph at lines 475--477
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 uses$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 const u$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/
10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (5.11174pt too wide) in paragraph at lines 496--498
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/1
0 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code
[56]
Overfull \hbox (29.6548pt too wide) in paragraph at lines 518--520
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $m[]ign$\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it
/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem

Overfull \hbox (51.08165pt too wide) in paragraph at lines 673--675
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]ign$\OT1/cmr/m/n/10 [$\T1/cmr
/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 step[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const u$\OT
1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 step[]codem
[57]
Overfull \hbox (8.04977pt too wide) in paragraph at lines 771--772
[][]  \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m
/it/10 nodes[]of[]phis $\OMS/cmsy/m/n/10 ^^Y$$[][]$ \T1/cmr/m/it/10 ssa$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of g \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 
Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis

Overfull \hbox (7.95027pt too wide) in paragraph at lines 819--820
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [] $[]codem g next $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ \T
1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$

Overfull \hbox (40.8658pt too wide) in paragraph at lines 876--877
[][]    \T1/cmr/m/it/10 Some $\OT1/cmr/m/n/10 ($$($\T1/cmr/m/it/10 case[]option
 $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Set$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 substitution[]code
[58]
Overfull \hbox (33.3333pt too wide) in paragraph at lines 1041--1043
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]phis$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [
] $[]codem g next next$ [] $ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (31.08868pt too wide) in paragraph at lines 1087--1088
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (40.67703pt too wide) in paragraph at lines 1837--1838
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 nodes[]of[]uses$ [] $ g next $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phidefNodes
[59]
Overfull \hbox (15.93558pt too wide) in paragraph at lines 2099--2101
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]uses$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$ [
] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code
[60]) (./Disjoin_Transform.tex
Overfull \hbox (14.60175pt too wide) in paragraph at lines 37--38
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxVnameLen[]aux $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 e1 \T1/cmr/m/n/10 ^^S [] ^^T \T1/cmr/m/it/10 e2$\OT1/cmr/m/n/10 )
$ $=$ \T1/cmr/m/it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux e
1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (20.5284pt too wide) in paragraph at lines 44--45
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxV-name-Len $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 if $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 b$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 c$[][]$ else c$[][]$$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 max $\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen c$[][]$$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/
it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux
[61] [62]
Overfull \hbox (18.42184pt too wide) in paragraph at lines 305--307
[][]\T1/cmr/bx/n/10 corollary \T1/cmr/m/it/10 Defs[]Uses[]transform[]disjoint $
\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 De
fs $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 transform c$\OT1/cmr/m/n/10 )$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10 Uses $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 transform
))
No file root.bbl.
[63] (./root.aux)

Package rerunfilecheck Warning: File `root.out' has changed.
(rerunfilecheck)                Rerun to get outlines right
(rerunfilecheck)                or use package `bookmark'.


LaTeX Warning: There were undefined references.

 )
(see the transcript file for additional information){/usr/share/texmf/fonts/enc
/dvips/cm-super/cm-super-t1.enc}</usr/share/texlive/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmex10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/ams
fonts/cm/cmmi10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr1
0.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></usr/shar
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texl
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texlive/texmf-dist
/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/share/texmf/fonts/type1/public
/cm-super/sfbx1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1095.p
fb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1200.pfb></usr/share/texmf
/fonts/type1/public/cm-super/sfbx1440.pfb></usr/share/texmf/fonts/type1/public/
cm-super/sfrm1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfrm1095.pf
b></usr/share/texmf/fonts/type1/public/cm-super/sfrm1200.pfb></usr/share/texmf/
fonts/type1/public/cm-super/sfrm1728.pfb></usr/share/texmf/fonts/type1/public/c
m-super/sfti1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfti1095.pfb
>
Output written on root.pdf (63 pages, 404594 bytes).
Transcript written on root.log.
This is BibTeX, Version 0.99d (TeX Live 2015/dev/Debian)
The top-level auxiliary file: root.aux
The style file: abbrv.bst
Database file #1: root.bib
This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex)
 restricted \write18 enabled.
entering extended mode
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 79 languages loaded.

(./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def))
(/usr/share/texlive/texmf-dist/tex/latex/quotmark/quotmark.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
For additional information on amsmath, use the `?' option.
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def
(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg)
(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty)
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty))))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de
f)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code.
tex)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet
ric.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod
e.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerari
thmetics.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct.
code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation
s.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t
ex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code.
tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code.
tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex
) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex
)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65
.sty)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18
.sty)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/math/pgfmath.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarytopaths.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarypositioning.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarycalc.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibraryarrows.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code.
tex)) (./isabelle.sty (./comment.sty Excluding comment 'comment')
Including comment 'isadelimtheory' Including comment 'isatagtheory'
Including comment 'isadelimproof' Including comment 'isatagproof'
Including comment 'isadelimML' Including comment 'isatagML'
Including comment 'isadelimvisible' Including comment 'isatagvisible'
Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible')
(./isabelletags.sty Including comment 'isadelimproof'
Excluding comment 'isatagproof' Including comment 'isadelimML'
Excluding comment 'isatagML') (./isabellesym.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty))
(./pdfsetup.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty))
(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty)
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg)

Package hyperref Warning: Option `pagecolor' is not available anymore.

(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty))

Package hyperref Message: Driver (autodetected): hpdftex.

(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty))
(./root.aux) ABD: EveryShipout initializing macros
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg))
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty))
(./root.out) (./root.out)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd)

LaTeX Warning: Citation `braun13cc' on page 1 undefined on input line 48.


LaTeX Warning: Citation `barthe14' on page 1 undefined on input line 48.

(./root.toc [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}])
(./session.tex (./Sublist.tex) (./RBT_Set.tex) (./Mapping.tex)
(./RBT_Mapping.tex) (./Char_ord.tex) (./List_lexord.tex) (./Com.tex)
(./AuxLemmas.tex) (./BasicDefs.tex) (./WCFG.tex) (./CFG.tex) (./CFGExit.tex)
(./Interpretation.tex) (./Labels.tex) (./CFG_wf.tex) (./CFGExit_wf.tex)
(./Observable.tex) (./Distance.tex) (./DynDataDependence.tex)
(./DataDependence.tex) (./SemanticsCFG.tex) (./Slice.tex) (./Postdomination.tex
) (./DynStandardControlDependence.tex) (./StandardControlDependence.tex)
(./DynWeakControlDependence.tex) (./WeakControlDependence.tex) (./PDG.tex)
(./WeakOrderDependence.tex) (./CDepInstantiations.tex) (./WellFormed.tex)
(./AdditionalLemmas.tex) (./Graph.tex) (./GraphSpec.tex) (./FormalSSA_Misc.tex
[2] [3] [4] [5]) (./Serial_Rel.tex
Overfull \hbox (3.40428pt too wide) in paragraph at lines 41--43
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 iterated[]serial[]on[]linear$\OT1/cmr
/m/n/10 :$ \T1/cmr/m/it/10 iterated[]serial[]on A r x $\OT1/cmr/m/n/10 ($\T1/cm
r/m/it/10 n$\OT1/cmr/m/n/10 +$\T1/cmr/m/it/10 m$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/
m/it/10 iterated[]serial[]on
) (./Mapping_Exts.tex [6]
Overfull \hbox (30.45937pt too wide) in paragraph at lines 137--153
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]Mapping[]lookup $\OT1/cmr/m/
n/10 [$\T1/cmr/m/it/10 simp$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 code[]unfold$\O
T1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 Mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 lookup

Overfull \hbox (6.28238pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]lookup[]map$\OT1/cmr/m/n/10 
:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map f g m$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 a $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]o
ption
[7]
Overfull \hbox (6.899pt too wide) in paragraph at lines 289--291
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]eq[]iff$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 m1 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m2 $\OMS/cmsy/m/n/10  []!
$ $\OT1/cmr/m/n/10 ($$\OMS/cmsy/m/n/10 8 $\T1/cmr/m/it/10 k$\OML/cmm/m/it/10 :$
 \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup m1 k $\OT1/
cmr/m/n/10 =$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 looku
p

Overfull \hbox (5.08723pt too wide) in paragraph at lines 343--345
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 map[]default[]eq$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map[]default k v f m
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m $\OMS/cmsy/m/n/10  []!$ $\OT1/cmr/m/n/10
 ($$\OMS/cmsy/m/n/10 9 $\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 M
ap-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
) (./RBT_Mapping_Exts.tex [8]
Overfull \hbox (45.4871pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mmap[]rbt[]code $\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mmap f $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mapping t$\
OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 Mapping

Overfull \hbox (80.39288pt too wide) in paragraph at lines 211--213
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]add[]code $\OT1/cmr/m/n/10 [
$\T1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mapping[]add $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Ma
pping t1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$
\T1/cmr/m/it/10 Mapping
) (./Graph_path.tex [9] [10] [11] [12] [13]
Overfull \hbox (8.362pt too wide) in paragraph at lines 953--955
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 path[]by[]tail$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ $[]$\T1/cmr/m/it/10 path g $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 n$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m
/n/10 #$\T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 )$$;$ \T1/cmr/m/it/10 path g $\OT1/c
mr/m/n/10 ($\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ns$\OT1/c
mr/m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 path g $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ms$\OT1/cmr/m/n/10 )$
$[]$

Overfull \hbox (20.01353pt too wide) in paragraph at lines 1061--1063
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 elem[]set[]implies[]elem[]tl[]app[]
cons$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/
10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set xs $\OT1/cmr/m/n/10 =[]\OMS/cmsy/
m/n/10 )$ \T1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 tl $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ys$\OT1/cmr/m/n/
10 @$\T1/cmr/m/it/10 y$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 xs$\OT1/cmr/m/n/10 )$$
)$[] 
[14] [15] [16] [17] [18] [19] [20] [21]) (./SSA_CFG.tex [22] [23]
Overfull \hbox (12.80359pt too wide) in paragraph at lines 290--292
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]defs $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 phiDefs[]def allDefs[]def phiUses[]def allUses[]def allVars[]
def
[24] [25] [26]
Overfull \hbox (1.3536pt too wide) in paragraph at lines 829--831
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]wf[]defs $\OT1/cmr/m/n/
10 =$ \T1/cmr/m/it/10 CFG[]SSA[]defs defNode[]code phi[]def isTrivialPhi[]def
[27] [28] [29] [30] [31]) (./Minimality.tex

LaTeX Warning: Citation `braun13cc' on page 32 undefined on input line 10.

[32] [33] [34]) (./Construct_SSA.tex [35] [36] [37] [38] [39] [40]
Overfull \hbox (21.67505pt too wide) in paragraph at lines 1718--1719
[][]    \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr
/m/it/10 n$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 ns$\OMS/cmsy/m/n/10 !$\T1/cmr/m
/it/10 m n $[]$ set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 tl ns$\OT1/cmr/m/n/10 )$
 \T1/cmr/m/it/10 v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/i
t/10 :$\T1/cmr/m/it/10 allDefs g n v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun
[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses
[41] [42]) (./Construct_SSA_notriv.tex [43]
Overfull \hbox (0.50066pt too wide) in paragraph at lines 61--62
[][]  $\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base $
\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in-v
ar in-Edges$ [] $ En-try old-Defs oldUses
[44]
Overfull \hbox (19.0183pt too wide) in paragraph at lines 335--337
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 sub-sti-tu-tion$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 re-dun-dant g $\OT1/
cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 isTriv-ial-Phi g $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 chooseNext g$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 subst
itution
[45] [46]
Overfull \hbox (13.66513pt too wide) in paragraph at lines 1086--1088
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 chooseNext[]eliminated$\OT1/cmr/m/n
/10 :$ \T1/cmr/m/it/10 chooseNext g $[]$ step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 allDefs g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 defNode g $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 chooseNext
[47]
Overfull \hbox (0.34885pt too wide) in paragraph at lines 1581--1583
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv
$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv $\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n
[48] [49]) (./SSA_Semantics.tex [50] [51]) (./While_Combinator_Exts.tex)
(./SSA_CFG_code.tex) (./Construct_SSA_code.tex)
(./Construct_SSA_notriv_code.tex
Overfull \hbox (5.98059pt too wide) in paragraph at lines 34--36
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 substNext[]code g next $\OMS/cmsy/m/n/10 ^^Q
$ $\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 i
f v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 snd next then substitution[]code
[52] [53]
Overfull \hbox (11.98946pt too wide) in paragraph at lines 107--108
[][]    \T1/cmr/m/it/10 fold $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$\T1/cmr/m
/it/10 n$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 update n $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 List$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 map $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 id$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 snd next $\OT1/cmr/m/n/10 :$$=$ \T1/cmr/m/it/10 next$ [] $$\OT1/cmr
/m/n/10 )$$)$ $($\T1/cmr/m/it/10 the $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup

Overfull \hbox (12.97588pt too wide) in paragraph at lines 108--109
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 sorted[]list[]of[]set $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n
/10 )$ $($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nod
es[]of[]phis

Overfull \hbox (4.0448pt too wide) in paragraph at lines 114--115
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 let old[]phis $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ \T1/cmr/m/it/10 id 
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 l
ookup nodes[]of[]phis

Overfull \hbox (13.59372pt too wide) in paragraph at lines 125--127
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 step[]codem g next next$ [] $ nodes[]of[]use
s nodes[]of[]phis $\OT1/cmr/m/n/10 =$ $($\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (6.30238pt too wide) in paragraph at lines 134--136
[][]\T1/cmr/bx/n/10 locale \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linor
der $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base
[54]
Overfull \hbox (11.81181pt too wide) in paragraph at lines 342--343
[][]$\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linorder
 $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in
-var in-Edges$ [] $ En-try old-Defs oldUses
[55]
Overfull \hbox (0.95255pt too wide) in paragraph at lines 367--368
\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 var $\OML/cmm/m/it/10 ^^U$\T1/cmr/
m/it/10 uses phis$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 chooseNext[]all uses $\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mappi
ng
[56]
Overfull \hbox (104.92482pt too wide) in paragraph at lines 453--455
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 redundant[]ign$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]cod
e $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10
 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code

Overfull \hbox (24.16965pt too wide) in paragraph at lines 475--477
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 uses$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 const u$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/
10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (5.11174pt too wide) in paragraph at lines 496--498
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/1
0 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code

Overfull \hbox (29.6548pt too wide) in paragraph at lines 518--520
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $m[]ign$\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it
/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem
[57]
Overfull \hbox (51.08165pt too wide) in paragraph at lines 673--675
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]ign$\OT1/cmr/m/n/10 [$\T1/cmr
/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 step[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const u$\OT
1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 step[]codem

Overfull \hbox (8.04977pt too wide) in paragraph at lines 771--772
[][]  \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m
/it/10 nodes[]of[]phis $\OMS/cmsy/m/n/10 ^^Y$$[][]$ \T1/cmr/m/it/10 ssa$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of g \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 
Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis

Overfull \hbox (7.95027pt too wide) in paragraph at lines 819--820
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [] $[]codem g next $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ \T
1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$
[58]
Overfull \hbox (40.8658pt too wide) in paragraph at lines 876--877
[][]    \T1/cmr/m/it/10 Some $\OT1/cmr/m/n/10 ($$($\T1/cmr/m/it/10 case[]option
 $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Set$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 substitution[]code

Overfull \hbox (33.3333pt too wide) in paragraph at lines 1041--1043
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]phis$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [
] $[]codem g next next$ [] $ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of
[59]
Overfull \hbox (31.08868pt too wide) in paragraph at lines 1087--1088
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (40.67703pt too wide) in paragraph at lines 1837--1838
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 nodes[]of[]uses$ [] $ g next $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phidefNodes
[60]
Overfull \hbox (15.93558pt too wide) in paragraph at lines 2099--2101
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]uses$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$ [
] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code
) (./Disjoin_Transform.tex [61]
Overfull \hbox (14.60175pt too wide) in paragraph at lines 37--38
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxVnameLen[]aux $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 e1 \T1/cmr/m/n/10 ^^S [] ^^T \T1/cmr/m/it/10 e2$\OT1/cmr/m/n/10 )
$ $=$ \T1/cmr/m/it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux e
1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (20.5284pt too wide) in paragraph at lines 44--45
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxV-name-Len $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 if $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 b$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 c$[][]$ else c$[][]$$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 max $\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen c$[][]$$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/
it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux
[62]
Overfull \hbox (18.42184pt too wide) in paragraph at lines 305--307
[][]\T1/cmr/bx/n/10 corollary \T1/cmr/m/it/10 Defs[]Uses[]transform[]disjoint $
\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 De
fs $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 transform c$\OT1/cmr/m/n/10 )$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10 Uses $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 transform
)) (./root.bbl) [63] (./root.aux)

LaTeX Warning: There were undefined references.


LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right.

 )
(see the transcript file for additional information){/usr/share/texmf/fonts/enc
/dvips/cm-super/cm-super-t1.enc}</usr/share/texlive/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmex10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/ams
fonts/cm/cmmi10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr1
0.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></usr/shar
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texl
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texlive/texmf-dist
/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/share/texmf/fonts/type1/public
/cm-super/sfbx1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1095.p
fb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1200.pfb></usr/share/texmf
/fonts/type1/public/cm-super/sfbx1440.pfb></usr/share/texmf/fonts/type1/public/
cm-super/sfrm1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfrm1095.pf
b></usr/share/texmf/fonts/type1/public/cm-super/sfrm1200.pfb></usr/share/texmf/
fonts/type1/public/cm-super/sfrm1728.pfb></usr/share/texmf/fonts/type1/public/c
m-super/sfti1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfti1095.pfb
>
Output written on root.pdf (63 pages, 426099 bytes).
Transcript written on root.log.
This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex)
 restricted \write18 enabled.
entering extended mode
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 79 languages loaded.

(./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def))
(/usr/share/texlive/texmf-dist/tex/latex/quotmark/quotmark.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
For additional information on amsmath, use the `?' option.
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def
(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg)
(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty)
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty))))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de
f)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code.
tex)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet
ric.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod
e.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerari
thmetics.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct.
code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation
s.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t
ex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code.
tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code.
tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex
) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex
)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65
.sty)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18
.sty)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/math/pgfmath.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarytopaths.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarypositioning.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarycalc.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibraryarrows.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code.
tex)) (./isabelle.sty (./comment.sty Excluding comment 'comment')
Including comment 'isadelimtheory' Including comment 'isatagtheory'
Including comment 'isadelimproof' Including comment 'isatagproof'
Including comment 'isadelimML' Including comment 'isatagML'
Including comment 'isadelimvisible' Including comment 'isatagvisible'
Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible')
(./isabelletags.sty Including comment 'isadelimproof'
Excluding comment 'isatagproof' Including comment 'isadelimML'
Excluding comment 'isatagML') (./isabellesym.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty))
(./pdfsetup.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty))
(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty)
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg)

Package hyperref Warning: Option `pagecolor' is not available anymore.

(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty))

Package hyperref Message: Driver (autodetected): hpdftex.

(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty))
(./root.aux) ABD: EveryShipout initializing macros
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg))
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty))
(./root.out) (./root.out)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) (./root.toc [1{/var/
lib/texmf/fonts/map/pdftex/updmap/pdftex.map}]) (./session.tex (./Sublist.tex)
(./RBT_Set.tex) (./Mapping.tex) (./RBT_Mapping.tex) (./Char_ord.tex)
(./List_lexord.tex) (./Com.tex) (./AuxLemmas.tex) (./BasicDefs.tex) (./WCFG.tex
) (./CFG.tex) (./CFGExit.tex) (./Interpretation.tex) (./Labels.tex)
(./CFG_wf.tex) (./CFGExit_wf.tex) (./Observable.tex) (./Distance.tex)
(./DynDataDependence.tex) (./DataDependence.tex) (./SemanticsCFG.tex)
(./Slice.tex) (./Postdomination.tex) (./DynStandardControlDependence.tex)
(./StandardControlDependence.tex) (./DynWeakControlDependence.tex)
(./WeakControlDependence.tex) (./PDG.tex) (./WeakOrderDependence.tex)
(./CDepInstantiations.tex) (./WellFormed.tex) (./AdditionalLemmas.tex)
(./Graph.tex) (./GraphSpec.tex) (./FormalSSA_Misc.tex [2] [3] [4] [5])
(./Serial_Rel.tex
Overfull \hbox (3.40428pt too wide) in paragraph at lines 41--43
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 iterated[]serial[]on[]linear$\OT1/cmr
/m/n/10 :$ \T1/cmr/m/it/10 iterated[]serial[]on A r x $\OT1/cmr/m/n/10 ($\T1/cm
r/m/it/10 n$\OT1/cmr/m/n/10 +$\T1/cmr/m/it/10 m$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/
m/it/10 iterated[]serial[]on
) (./Mapping_Exts.tex [6]
Overfull \hbox (30.45937pt too wide) in paragraph at lines 137--153
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]Mapping[]lookup $\OT1/cmr/m/
n/10 [$\T1/cmr/m/it/10 simp$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 code[]unfold$\O
T1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 Mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 lookup

Overfull \hbox (6.28238pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]lookup[]map$\OT1/cmr/m/n/10 
:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map f g m$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 a $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]o
ption
[7]
Overfull \hbox (6.899pt too wide) in paragraph at lines 289--291
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]eq[]iff$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 m1 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m2 $\OMS/cmsy/m/n/10  []!
$ $\OT1/cmr/m/n/10 ($$\OMS/cmsy/m/n/10 8 $\T1/cmr/m/it/10 k$\OML/cmm/m/it/10 :$
 \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup m1 k $\OT1/
cmr/m/n/10 =$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 looku
p

Overfull \hbox (5.08723pt too wide) in paragraph at lines 343--345
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 map[]default[]eq$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map[]default k v f m
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m $\OMS/cmsy/m/n/10  []!$ $\OT1/cmr/m/n/10
 ($$\OMS/cmsy/m/n/10 9 $\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 M
ap-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
) (./RBT_Mapping_Exts.tex [8]
Overfull \hbox (45.4871pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mmap[]rbt[]code $\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mmap f $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mapping t$\
OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 Mapping

Overfull \hbox (80.39288pt too wide) in paragraph at lines 211--213
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]add[]code $\OT1/cmr/m/n/10 [
$\T1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mapping[]add $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Ma
pping t1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$
\T1/cmr/m/it/10 Mapping
) (./Graph_path.tex [9] [10] [11] [12] [13]
Overfull \hbox (8.362pt too wide) in paragraph at lines 953--955
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 path[]by[]tail$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ $[]$\T1/cmr/m/it/10 path g $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 n$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m
/n/10 #$\T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 )$$;$ \T1/cmr/m/it/10 path g $\OT1/c
mr/m/n/10 ($\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ns$\OT1/c
mr/m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 path g $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ms$\OT1/cmr/m/n/10 )$
$[]$

Overfull \hbox (20.01353pt too wide) in paragraph at lines 1061--1063
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 elem[]set[]implies[]elem[]tl[]app[]
cons$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/
10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set xs $\OT1/cmr/m/n/10 =[]\OMS/cmsy/
m/n/10 )$ \T1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 tl $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ys$\OT1/cmr/m/n/
10 @$\T1/cmr/m/it/10 y$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 xs$\OT1/cmr/m/n/10 )$$
)$[] 
[14] [15] [16] [17] [18] [19] [20] [21]) (./SSA_CFG.tex [22] [23]
Overfull \hbox (12.80359pt too wide) in paragraph at lines 290--292
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]defs $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 phiDefs[]def allDefs[]def phiUses[]def allUses[]def allVars[]
def
[24] [25] [26]
Overfull \hbox (1.3536pt too wide) in paragraph at lines 829--831
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]wf[]defs $\OT1/cmr/m/n/
10 =$ \T1/cmr/m/it/10 CFG[]SSA[]defs defNode[]code phi[]def isTrivialPhi[]def
[27] [28] [29] [30] [31]) (./Minimality.tex [32] [33] [34])
(./Construct_SSA.tex [35] [36] [37] [38] [39] [40]
Overfull \hbox (21.67505pt too wide) in paragraph at lines 1718--1719
[][]    \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr
/m/it/10 n$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 ns$\OMS/cmsy/m/n/10 !$\T1/cmr/m
/it/10 m n $[]$ set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 tl ns$\OT1/cmr/m/n/10 )$
 \T1/cmr/m/it/10 v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/i
t/10 :$\T1/cmr/m/it/10 allDefs g n v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun
[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses
[41] [42]) (./Construct_SSA_notriv.tex [43]
Overfull \hbox (0.50066pt too wide) in paragraph at lines 61--62
[][]  $\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base $
\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in-v
ar in-Edges$ [] $ En-try old-Defs oldUses
[44]
Overfull \hbox (19.0183pt too wide) in paragraph at lines 335--337
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 sub-sti-tu-tion$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 re-dun-dant g $\OT1/
cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 isTriv-ial-Phi g $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 chooseNext g$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 subst
itution
[45] [46]
Overfull \hbox (13.66513pt too wide) in paragraph at lines 1086--1088
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 chooseNext[]eliminated$\OT1/cmr/m/n
/10 :$ \T1/cmr/m/it/10 chooseNext g $[]$ step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 allDefs g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 defNode g $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 chooseNext
[47]
Overfull \hbox (0.34885pt too wide) in paragraph at lines 1581--1583
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv
$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv $\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n
[48] [49]) (./SSA_Semantics.tex [50] [51]) (./While_Combinator_Exts.tex)
(./SSA_CFG_code.tex) (./Construct_SSA_code.tex)
(./Construct_SSA_notriv_code.tex
Overfull \hbox (5.98059pt too wide) in paragraph at lines 34--36
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 substNext[]code g next $\OMS/cmsy/m/n/10 ^^Q
$ $\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 i
f v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 snd next then substitution[]code
[52] [53]
Overfull \hbox (11.98946pt too wide) in paragraph at lines 107--108
[][]    \T1/cmr/m/it/10 fold $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$\T1/cmr/m
/it/10 n$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 update n $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 List$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 map $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 id$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 snd next $\OT1/cmr/m/n/10 :$$=$ \T1/cmr/m/it/10 next$ [] $$\OT1/cmr
/m/n/10 )$$)$ $($\T1/cmr/m/it/10 the $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup

Overfull \hbox (12.97588pt too wide) in paragraph at lines 108--109
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 sorted[]list[]of[]set $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n
/10 )$ $($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nod
es[]of[]phis

Overfull \hbox (4.0448pt too wide) in paragraph at lines 114--115
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 let old[]phis $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ \T1/cmr/m/it/10 id 
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 l
ookup nodes[]of[]phis

Overfull \hbox (13.59372pt too wide) in paragraph at lines 125--127
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 step[]codem g next next$ [] $ nodes[]of[]use
s nodes[]of[]phis $\OT1/cmr/m/n/10 =$ $($\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (6.30238pt too wide) in paragraph at lines 134--136
[][]\T1/cmr/bx/n/10 locale \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linor
der $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base
[54]
Overfull \hbox (11.81181pt too wide) in paragraph at lines 342--343
[][]$\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linorder
 $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in
-var in-Edges$ [] $ En-try old-Defs oldUses
[55]
Overfull \hbox (0.95255pt too wide) in paragraph at lines 367--368
\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 var $\OML/cmm/m/it/10 ^^U$\T1/cmr/
m/it/10 uses phis$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 chooseNext[]all uses $\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mappi
ng
[56]
Overfull \hbox (104.92482pt too wide) in paragraph at lines 453--455
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 redundant[]ign$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]cod
e $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10
 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code

Overfull \hbox (24.16965pt too wide) in paragraph at lines 475--477
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 uses$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 const u$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/
10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (5.11174pt too wide) in paragraph at lines 496--498
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/1
0 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code

Overfull \hbox (29.6548pt too wide) in paragraph at lines 518--520
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $m[]ign$\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it
/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem
[57]
Overfull \hbox (51.08165pt too wide) in paragraph at lines 673--675
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]ign$\OT1/cmr/m/n/10 [$\T1/cmr
/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 step[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const u$\OT
1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 step[]codem

Overfull \hbox (8.04977pt too wide) in paragraph at lines 771--772
[][]  \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m
/it/10 nodes[]of[]phis $\OMS/cmsy/m/n/10 ^^Y$$[][]$ \T1/cmr/m/it/10 ssa$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of g \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 
Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis

Overfull \hbox (7.95027pt too wide) in paragraph at lines 819--820
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [] $[]codem g next $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ \T
1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$
[58]
Overfull \hbox (40.8658pt too wide) in paragraph at lines 876--877
[][]    \T1/cmr/m/it/10 Some $\OT1/cmr/m/n/10 ($$($\T1/cmr/m/it/10 case[]option
 $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Set$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 substitution[]code

Overfull \hbox (33.3333pt too wide) in paragraph at lines 1041--1043
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]phis$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [
] $[]codem g next next$ [] $ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of
[59]
Overfull \hbox (31.08868pt too wide) in paragraph at lines 1087--1088
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (40.67703pt too wide) in paragraph at lines 1837--1838
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 nodes[]of[]uses$ [] $ g next $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phidefNodes
[60]
Overfull \hbox (15.93558pt too wide) in paragraph at lines 2099--2101
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]uses$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$ [
] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code
) (./Disjoin_Transform.tex [61]
Overfull \hbox (14.60175pt too wide) in paragraph at lines 37--38
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxVnameLen[]aux $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 e1 \T1/cmr/m/n/10 ^^S [] ^^T \T1/cmr/m/it/10 e2$\OT1/cmr/m/n/10 )
$ $=$ \T1/cmr/m/it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux e
1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (20.5284pt too wide) in paragraph at lines 44--45
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxV-name-Len $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 if $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 b$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 c$[][]$ else c$[][]$$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 max $\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen c$[][]$$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/
it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux
[62]
Overfull \hbox (18.42184pt too wide) in paragraph at lines 305--307
[][]\T1/cmr/bx/n/10 corollary \T1/cmr/m/it/10 Defs[]Uses[]transform[]disjoint $
\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 De
fs $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 transform c$\OT1/cmr/m/n/10 )$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10 Uses $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 transform
)) (./root.bbl) [63] (./root.aux) )
(see the transcript file for additional information){/usr/share/texmf/fonts/enc
/dvips/cm-super/cm-super-t1.enc}</usr/share/texlive/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmex10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/ams
fonts/cm/cmmi10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr1
0.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></usr/shar
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texl
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texlive/texmf-dist
/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/share/texmf/fonts/type1/public
/cm-super/sfbx1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1095.p
fb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1200.pfb></usr/share/texmf
/fonts/type1/public/cm-super/sfbx1440.pfb></usr/share/texmf/fonts/type1/public/
cm-super/sfrm1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfrm1095.pf
b></usr/share/texmf/fonts/type1/public/cm-super/sfrm1200.pfb></usr/share/texmf/
fonts/type1/public/cm-super/sfrm1728.pfb></usr/share/texmf/fonts/type1/public/c
m-super/sfti1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfti1095.pfb
>
Output written on root.pdf (63 pages, 426172 bytes).
Transcript written on root.log.

This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex)
 restricted \write18 enabled.
entering extended mode
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 79 languages loaded.

(./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def))
(/usr/share/texlive/texmf-dist/tex/latex/quotmark/quotmark.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
For additional information on amsmath, use the `?' option.
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def
(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg)
(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty)
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty))))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de
f)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code.
tex)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet
ric.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod
e.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerari
thmetics.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct.
code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation
s.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t
ex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code.
tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code.
tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex
) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex
)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65
.sty)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18
.sty)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/math/pgfmath.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarytopaths.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarypositioning.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarycalc.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibraryarrows.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code.
tex)) (./isabelle.sty (./comment.sty Excluding comment 'comment')
Including comment 'isadelimtheory' Including comment 'isatagtheory'
Including comment 'isadelimproof' Including comment 'isatagproof'
Including comment 'isadelimML' Including comment 'isatagML'
Including comment 'isadelimvisible' Including comment 'isatagvisible'
Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible')
(./isabelletags.sty) (./isabellesym.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty))
(./pdfsetup.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty))
(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty)
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg)

Package hyperref Warning: Option `pagecolor' is not available anymore.

(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty))

Package hyperref Message: Driver (autodetected): hpdftex.

(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty))
No file root.aux.
ABD: EveryShipout initializing macros
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg))
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd)

LaTeX Warning: Citation `braun13cc' on page 1 undefined on input line 48.


LaTeX Warning: Citation `barthe14' on page 1 undefined on input line 48.

(./session.tex (./Sublist.tex) (./RBT_Set.tex) (./Mapping.tex)
(./RBT_Mapping.tex) (./Char_ord.tex) (./List_lexord.tex) (./Com.tex)
(./AuxLemmas.tex) (./BasicDefs.tex) (./WCFG.tex) (./CFG.tex) (./CFGExit.tex)
(./Interpretation.tex) (./Labels.tex) (./CFG_wf.tex) (./CFGExit_wf.tex)
(./Observable.tex) (./Distance.tex) (./DynDataDependence.tex)
(./DataDependence.tex) (./SemanticsCFG.tex) (./Slice.tex) (./Postdomination.tex
) (./DynStandardControlDependence.tex) (./StandardControlDependence.tex)
(./DynWeakControlDependence.tex) (./WeakControlDependence.tex) (./PDG.tex)
(./WeakOrderDependence.tex) (./CDepInstantiations.tex) (./WellFormed.tex)
(./AdditionalLemmas.tex) (./Graph.tex) (./GraphSpec.tex) (./FormalSSA_Misc.tex
Overfull \hbox (5.79439pt too wide) in paragraph at lines 31--44
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis One[]nat[]def
 ap-pend$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 append[]butlast[]last[]id diff[]Suc[]
Suc diff[]zero

Overfull \hbox (8.44907pt too wide) in paragraph at lines 73--86
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id append[]is[]Nil[]conv list$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dist
inct$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 ro-
tate1$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 2$\OT1/cmr/m/n/10 )$
[1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}]
Overfull \hbox (10.182pt too wide) in paragraph at lines 148--161
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id append[]is[]Nil[]conv assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\O
T1/cmr/m/n/10 )$ \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1
/cmr/m/n/10 )$ \T1/cmr/m/it/10 last[]appendR

Overfull \hbox (2.92094pt too wide) in paragraph at lines 218--233
[][]\T1/cmr/bx/n/10 using \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 un-fold-ing \T1
/cmr/m/it/10 append[]butlast[]last[]id$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 symmet
ric$\OT1/cmr/m/n/10 ]$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 au
to simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 less[]le

Overfull \hbox (3.62933pt too wide) in paragraph at lines 292--305
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis One[]nat[]def
 diff[]Suc[]Suc last[]in[]set last[]tl length[]tl less[]numeral[]extra$\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 )$
[2]
Overfull \hbox (15.09085pt too wide) in paragraph at lines 378--385
[][]\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis Sup[]empty Sup[
]insert Sup[]set[]fold Un[]insert[]right UnionI ccpo[]Sup[]singleton
[3]
Overfull \hbox (1.54424pt too wide) in paragraph at lines 587--591
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 ob-tain \T1/cmr/m/it/10 i \T1/cmr/bx/n
/10 where \T1/cmr/m/it/10 y $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 ys $\OT1/cmr/m/
n/10 !$ \T1/cmr/m/it/10 i i $\OML/cmm/m/it/10 <$ \T1/cmr/m/it/10 length ys \T1/
cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis in[]set[]conv[]nth$\OT1
/cmr/m/n/10 )$[] 
[4] [5]
Overfull \hbox (35.85776pt too wide) in paragraph at lines 827--840
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id but-last$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 
($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 distinct[]append inf[]bo
t[]right inf[]commute

Overfull \hbox (55.55222pt too wide) in paragraph at lines 899--912
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis but-last$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/c
mr/m/n/10 )$ \T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 str
ict[]iff[]order hd[]Cons[]tl hd[]in[]set length[]greater[]0[]conv
[6]
Overfull \hbox (26.80919pt too wide) in paragraph at lines 1070--1072
[][] \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 Min$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 infinite Min[]in Min[]singleton all[]not[]in[]co
nv finite[]subset

Overfull \hbox (30.42868pt too wide) in paragraph at lines 1092--1094
[][] \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 Max$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 infinite Max[]in Max[]singleton all[]not[]in[]co
nv finite[]subset
) (./Serial_Rel.tex [7]
Overfull \hbox (3.40428pt too wide) in paragraph at lines 41--43
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 iterated[]serial[]on[]linear$\OT1/cmr
/m/n/10 :$ \T1/cmr/m/it/10 iterated[]serial[]on A r x $\OT1/cmr/m/n/10 ($\T1/cm
r/m/it/10 n$\OT1/cmr/m/n/10 +$\T1/cmr/m/it/10 m$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/
m/it/10 iterated[]serial[]on
[8]
Overfull \hbox (4.2211pt too wide) in paragraph at lines 158--163
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 a \T1/cmr/bx/n/10 have \T1/cmr/m/it/
10 range ?f $\OMS/cmsy/m/n/10 ^^R$ \T1/cmr/m/it/10 A \T1/cmr/bx/n/10 us-ing \T1
/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/c
mr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$
 \T1/cmr/m/it/10 iterated[]serial[]on[]in[]A$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (11.0342pt too wide) in paragraph at lines 171--173
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/m
/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 lift-ing
$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 finite[]nat[]set[]iff[]bounded mem[]Collect
[]eq not[]less[]eq$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.78395pt too wide) in paragraph at lines 181--183
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule iterated[]se
rial[]on[]in[]power$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 
($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 r
ule iterated[]serial[]on[]in[]A$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF
) (./Mapping_Exts.tex
Overfull \hbox (30.45937pt too wide) in paragraph at lines 137--153
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]Mapping[]lookup $\OT1/cmr/m/
n/10 [$\T1/cmr/m/it/10 simp$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 code[]unfold$\O
T1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 Mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 lookup
[9]
Overfull \hbox (6.28238pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]lookup[]map$\OT1/cmr/m/n/10 
:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map f g m$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 a $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]o
ption

Overfull \hbox (6.899pt too wide) in paragraph at lines 289--291
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]eq[]iff$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 m1 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m2 $\OMS/cmsy/m/n/10  []!
$ $\OT1/cmr/m/n/10 ($$\OMS/cmsy/m/n/10 8 $\T1/cmr/m/it/10 k$\OML/cmm/m/it/10 :$
 \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup m1 k $\OT1/
cmr/m/n/10 =$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 looku
p

Overfull \hbox (5.08723pt too wide) in paragraph at lines 343--345
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 map[]default[]eq$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map[]default k v f m
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m $\OMS/cmsy/m/n/10  []!$ $\OT1/cmr/m/n/10
 ($$\OMS/cmsy/m/n/10 9 $\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 M
ap-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
[10]) (./RBT_Mapping_Exts.tex [11]
Overfull \hbox (38.83908pt too wide) in paragraph at lines 176--189
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/
m/n/10 :$ \T1/cmr/m/it/10 RBT[]Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Set[]def 
RBT$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys[]def[]alt RBT$\OML/cmm/m/it/10 :$\T
1/cmr/m/it/10 lookup[]in[]tree elim$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 rev[]ima
ge[]eqI$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (45.4871pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mmap[]rbt[]code $\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mmap f $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mapping t$\
OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 Mapping

Overfull \hbox (80.39288pt too wide) in paragraph at lines 211--213
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]add[]code $\OT1/cmr/m/n/10 [
$\T1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mapping[]add $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Ma
pping t1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$
\T1/cmr/m/it/10 Mapping
) (./Graph_path.tex [12] [13] [14] [15]
Overfull \hbox (34.3785pt too wide) in paragraph at lines 525--529
[][]    \T1/cmr/bx/n/10 thus \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/i
t/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 predecessors g m$\OT1/cmr/m/n/10 )$
 \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 predecessors[]def \T1/cmr/bx/n/10 
by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis get[]edge[]simps$\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$
[16] [17]
Overfull \hbox (8.362pt too wide) in paragraph at lines 953--955
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 path[]by[]tail$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ $[]$\T1/cmr/m/it/10 path g $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 n$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m
/n/10 #$\T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 )$$;$ \T1/cmr/m/it/10 path g $\OT1/c
mr/m/n/10 ($\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ns$\OT1/c
mr/m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 path g $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ms$\OT1/cmr/m/n/10 )$
$[]$
[18]
Overfull \hbox (20.01353pt too wide) in paragraph at lines 1061--1063
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 elem[]set[]implies[]elem[]tl[]app[]
cons$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/
10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set xs $\OT1/cmr/m/n/10 =[]\OMS/cmsy/
m/n/10 )$ \T1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 tl $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ys$\OT1/cmr/m/n/
10 @$\T1/cmr/m/it/10 y$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 xs$\OT1/cmr/m/n/10 )$$
)$[] 
[19] [20] [21] [22]
Overfull \hbox (16.18484pt too wide) in paragraph at lines 1772--1779
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id dis-tinct$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 distinct1[]rotate hd[]C
ons[]tl path2[]hd
[23] [24] [25]
Overfull \hbox (11.96931pt too wide) in paragraph at lines 2152--2165
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis hd[]Cons[]t
l last[]appendR last[]snoc length[]greater[]0[]conv length[]tl path2[]def
[26]
Overfull \hbox (17.44365pt too wide) in paragraph at lines 2250--2254
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 Entry[]reaches$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OML/cmm/m/it/10 ;$
\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$ \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 Fa
lse \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto elim$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 simple[]path2[]unsnoc$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (6.43822pt too wide) in paragraph at lines 2282--2286
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 Entry[]unreachable$\OT1/cmr/m/n/10
 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10
 )$$]$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 by $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 predecessor
s[]def$\OT1/cmr/m/n/10 )$[] 
[27] [28]
Overfull \hbox (3.79758pt too wide) in paragraph at lines 2496--2500
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 as \T1/cmr/bx/n/10 where \
T1/cmr/m/it/10 pre-fix$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 pre-fix $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 as$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/
m/n/10 ]$$)$ \T1/cmr/m/it/10 ns \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prefix[]split[]first$\OT1/
cmr/m/n/10 )$[] 

Overfull \hbox (3.79758pt too wide) in paragraph at lines 2552--2556
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 as \T1/cmr/bx/n/10 where \
T1/cmr/m/it/10 pre-fix$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 pre-fix $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 as$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/
m/n/10 ]$$)$ \T1/cmr/m/it/10 ns \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prefix[]split[]first$\OT1/
cmr/m/n/10 )$[] 
[29] [30] [31] [32] [33]
Overfull \hbox (16.75742pt too wide) in paragraph at lines 3230--3232
[][]      \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 this$\OT1/cmr/m/n/10 [$\T1/cmr/m
/it/10 unfolded shortestPath[]def$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 THEN not[
]less[]Least$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 folded shortestPath[]def$\OML/
cmm/m/it/10 ;$
[34] [35] [36]) (./SSA_CFG.tex [37] [38] [39]
Overfull \hbox (12.80359pt too wide) in paragraph at lines 290--292
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]defs $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 phiDefs[]def allDefs[]def phiUses[]def allUses[]def allVars[]
def
[40] [41] [42] [43]
Overfull \hbox (1.3536pt too wide) in paragraph at lines 829--831
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]wf[]defs $\OT1/cmr/m/n/
10 =$ \T1/cmr/m/it/10 CFG[]SSA[]defs defNode[]code phi[]def isTrivialPhi[]def
[44] [45] [46] [47]
Overfull \hbox (2.79701pt too wide) in paragraph at lines 1566--1569
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 base$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 hyps base$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 ob-tain \T1/cmr/m/it/10 ns$ []
 $ m \T1/cmr/bx/n/10 where \T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 :$ \T1/cmr/
m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m/it/10 defN-ode g q$\OMS/cmsy/m/n/10 ^^
@$\T1/cmr/m/it/10 ns$ [] $$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 m
[48]
Overfull \hbox (1.187pt too wide) in paragraph at lines 1571--1574
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 :$ \T1/cmr/m/i
t/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m/it/10 defN-ode g q$\OMS/cmsy/m/n/10 ^^@$\
T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 defNode g p$\OT1/c
mr/m/n/10 ]$$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 defNode g p length $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 defNode
[49] [50] [51] [52] [53] [54]
Overfull \hbox (2.62746pt too wide) in paragraph at lines 2295--2299
[][]    \T1/cmr/bx/n/10 thus \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 us-ing \T1/c
mr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$ \T1/cmr/m/it/10 phiArg[]same
[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$$]$
[55] [56]) (./Minimality.tex

LaTeX Warning: Citation `braun13cc' on page 57 undefined on input line 10.

[57]
Overfull \hbox (7.3134pt too wide) in paragraph at lines 90--95
[][]        \T1/cmr/bx/n/10 ul-ti-mately show \T1/cmr/m/it/10 False \T1/cmr/bx/
n/10 us-ing \T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 THEN bspec$\OT1
/cmr/m/n/10 [$\T1/cmr/bx/n/10 where \T1/cmr/m/it/10 x$\OT1/cmr/m/n/10 =$\T1/cmr
/m/it/10 j$\OT1/cmr/m/n/10 ]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 THEN bspec$\O
T1/cmr/m/n/10 [$\T1/cmr/bx/n/10 where
[58]
Overfull \hbox (40.47578pt too wide) in paragraph at lines 275--280
[][]      \T1/cmr/bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/
m/n/10 ]$$:$ \T1/cmr/m/it/10 var g q $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 var g 
r \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]
$ \T1/cmr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF
[59] [60] [61] [62]
Overfull \hbox (18.59981pt too wide) in paragraph at lines 728--732
[][]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 isTriv-ial-Phi g p q \T1/cmr/
bx/n/10 us-ing \T1/cmr/m/it/10 vs \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr
/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 isTrivialPhi[]def split$\O
T1/cmr/m/n/10 :$\T1/cmr/m/it/10 option$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 split
$\OT1/cmr/m/n/10 )$[] 
[63]
Overfull \hbox (50.9754pt too wide) in paragraph at lines 825--827
[][]        \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 1$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 prefix[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it
/10 :$\T1/cmr/m/it/10 strict[]implies[]order prefix[]order$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trans[] 

Overfull \hbox (8.14215pt too wide) in paragraph at lines 848--850
[][]              \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto si
mp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 pat
h2[]def simp del$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 One[]nat[]def dest$\OT1/cmr/
m/n/10 !$$:$\T1/cmr/m/it/10 singleton[]list[]hd[]last$\OT1/cmr/m/n/10 )$[] 
[64]
Overfull \hbox (7.83286pt too wide) in paragraph at lines 942--946
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms that \T1/cmr/bx/n/10 show \T
1/cmr/m/it/10 ?the-sis \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 au
to simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 unnecessaryPhi[]def necessaryPhi[]de
f
[65] [66]
Overfull \hbox (12.74742pt too wide) in paragraph at lines 1142--1146
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 4 ns$[][]$$\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?the
-sis \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 rule in[]set[]butlastI$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]def$\O
T1/cmr/m/n/10 )$[] 

Overfull \hbox (30.53955pt too wide) in paragraph at lines 1175--1179
[][]              \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 :$ \T
1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 butlast ns$[][]$$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 us-ing \T1/cmr
/m/it/10 ns$[][]$$ [] $$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 3$\OT1/cmr/m/n/10 )$ 
\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto dest$\OT1/cmr/m/n/10
 :$\T1/cmr/m/it/10 set[]mono[]strict[]prefix$\OT1/cmr/m/n/10 )$[] 
[67] (/usr/share/texlive/texmf-dist/tex/latex/base/omscmr.fd) [68]
Overfull \hbox (92.98157pt too wide) in paragraph at lines 1330--1333
[][]          \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 asm$\OT1/cmr/m/n/10 [$\T1/
cmr/m/it/10 THEN con-junct1$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 asm$\OT1/cmr/m/n
/10 [$\T1/cmr/m/it/10 THEN con-junct2$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 rs \T1
/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule ununnecessaryPhis[]disj
oint[]paths$\OML/cmm/m/it/10 ;$
[69]
Overfull \hbox (0.62141pt too wide) in paragraph at lines 1461--1465
[][]        \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 z$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 z $\OMS/cmsy/m/
n/10 2$ \T1/cmr/m/it/10 set ns$ [] $$ [] $ $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10
 set ms$ [] $$ [] $ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto 
simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 
pathsConverge$ [] $[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (6.07417pt too wide) in paragraph at lines 1500--1502
[][]            \T1/cmr/bx/n/10 proof $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule n
ecessaryPhi[]is[]necessary$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF nec-es-sary$\OT
1/cmr/m/n/10 [$\T1/cmr/m/it/10 simplified rs$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 
symmetric$\OT1/cmr/m/n/10 ]$$]$
[70] [71]
Overfull \hbox (12.2103pt too wide) in paragraph at lines 1681--1685
[]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 dom$\OT1/cmr/m/n/10 :$ \T1/cmr/
m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?R ?S \T1/cmr/bx/n/1
0 us-ing \T1/cmr/m/it/10 5 ss$ [] $ \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 d
ominates[]extend$\OT1/cmr/m/n/10 )$ 
[72] [73]
Overfull \hbox (5.25847pt too wide) in paragraph at lines 1900--1902
[][]                  \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 subst old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]last$\O
T1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF xs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 EntryPath[]butlast[]less[]last$\OT1/cmr/m/n/10 )$[] 
[74]
Overfull \hbox (5.25847pt too wide) in paragraph at lines 1932--1934
[][]                  \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 subst old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]last$\O
T1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF xs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 EntryPath[]butlast[]less[]last$\OT1/cmr/m/n/10 )$[] 
[75]
Overfull \hbox (29.05797pt too wide) in paragraph at lines 2109--2111
[][]            \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 rule nec-es-saryPhiI$\OT1/cmr/m/n/10 [$\T1/cmr/bx/n/10 where \T1/
cmr/m/it/10 v$\OT1/cmr/m/n/10 =$\T1/cmr/m/it/10 var g p$\OT1/cmr/m/n/10 ]$$\OML
/cmm/m/it/10 ;$ \T1/cmr/m/it/10 as-sump-tion$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/1
0 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 path2[]def$\OT1/cmr/m/n/10 )$[] 
[76] [77]) (./Construct_SSA.tex
Overfull \hbox (43.21234pt too wide) in paragraph at lines 42--58
[][]  \T1/cmr/bx/n/10 in-stance by \T1/cmr/m/it/10 intro[]classes $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 metis Def$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 distinct$\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 less[]Def[]
def less[]eq[]Def[]def Def$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 exhaust$\OT1/cmr/
m/n/10 )$$+$[] 
[78]
Overfull \hbox (84.53761pt too wide) in paragraph at lines 120--138
[][]  \T1/cmr/bx/n/10 ter-mi-na-tion by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rela
tion mea-sure $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$$\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 g$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 n$\OML/cmm/m/it/10 ;$[]$\OT1/cm
r/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 short-est-Path g n$\OT1/cmr/m/n
/10 )$$)$ $($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 shor
testPath[]predecessor$\OT1/cmr/m/n/10 )$[] 
[79] [80]
Overfull \hbox (23.33815pt too wide) in paragraph at lines 303--307
[][]      \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 i \T1/cmr/bx/n/10 where 
\T1/cmr/m/it/10 n $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 ?ns$ [] $ $\OT1/cmr/m/n/1
0 !$ \T1/cmr/m/it/10 i i $\OML/cmm/m/it/10 <$ \T1/cmr/m/it/10 length ?ns$ [] $ 
\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 in[]set[]conv[]nth$\OT1/cmr/m/n/10 )$[] 
[81]
Overfull \hbox (7.27686pt too wide) in paragraph at lines 445--454
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 proof $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 atomize[]elim$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 
in-duc-tion un ar-bi-trary$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 m rule$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 removeAll[]induct$\OT1/cmr/m/n/10 )$[] 
[82]
Overfull \hbox (33.40263pt too wide) in paragraph at lines 578--582
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 1$\OT1/cmr/m/n/
10 :$ \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 phiDefNodes[]aux g
 v $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n g$\OT1/cmr/m/n/10 )
$ \T1/cmr/m/it/10 m \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$$\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 rule phiDefNodes[]auxI$\OML/cmm/m/it/10 ;$
[83]
Overfull \hbox (19.05038pt too wide) in paragraph at lines 724--726
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule[]tac v$\O
T1/cmr/m/n/10 =$\T1/cmr/m/it/10 v \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 n$\OT1/cm
r/m/n/10 =$\T1/cmr/m/it/10 n \T1/cmr/bx/n/10 in \T1/cmr/m/it/10 lookupDef[]case
s$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$ \T1/cmr/m/i
t/10 assms lookupDef[]cases$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (26.32518pt too wide) in paragraph at lines 789--803
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
induction rule$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 lookupDef$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 induct$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 auto elim$\OT1/cmr/
m/n/10 :$\T1/cmr/m/it/10 lookupDefE$\OT1/cmr/m/n/10 )$[] 
[84] [85] [86] [87]
Overfull \hbox (23.9604pt too wide) in paragraph at lines 1363--1367
[][]        \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 snoc$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 3$\OT1/cmr/m/n/10 )$ \T1/cmr/
bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/c
mr/m/it/10 x $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m$ [] $ \T1/cmr/bx/n/10 by $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 tl[]
append split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 list$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 split[]asm$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (38.59175pt too wide) in paragraph at lines 1382--1386
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 5$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 v$ [] $ $
\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 phiDefs g m$ [] $ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp
 add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 allDefs[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (26.66702pt too wide) in paragraph at lines 1388--1391
[][]            \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 braun[]ssa$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phiDefs[]def \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 phis$ [] $[]def
 split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 split[]asm
[88]
Overfull \hbox (20.4175pt too wide) in paragraph at lines 1447--1450
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it
/10 v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 lookupDef g m $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 var g v$ [] $$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phis$ [] $[
]def split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 split[]asm

Overfull \hbox (10.8281pt too wide) in paragraph at lines 1450--1455
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 var g v $\OT1/c
mr/m/n/10 =$ \T1/cmr/m/it/10 var g v$ [] $ \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/
m/it/10 var[]def \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis lo
okupDef[]fst$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (4.82967pt too wide) in paragraph at lines 1473--1487
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 by $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 !$$:$\T1/cmr/m/it/10 look
upDef[]fst dest$\OT1/cmr/m/n/10 !$$:$\T1/cmr/m/it/10 phiDefNodes[]$\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 n simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phis$ [] $[
]def

Overfull \hbox (34.70166pt too wide) in paragraph at lines 1526--1529
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 m$ [] $$\OT1/cmr/m/n/10 :$ \T1/cm
r/m/it/10 m$ [] $ $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 phiDefN-odes g $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 var g v$ [] $$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/
10 phis$ [] $[]def split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 split[]asm
[89]
Overfull \hbox (1.88747pt too wide) in paragraph at lines 1650--1654
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 lookupDef g m $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \
T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]lookupDef$\OT
1/cmr/m/n/10 )$[] 

Overfull \hbox (1.88747pt too wide) in paragraph at lines 1686--1690
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 lookupDef g m $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \
T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]lookupDef$\OT
1/cmr/m/n/10 )$[] 

Overfull \hbox (21.67505pt too wide) in paragraph at lines 1718--1719
[][]    \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr
/m/it/10 n$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 ns$\OMS/cmsy/m/n/10 !$\T1/cmr/m
/it/10 m n $[]$ set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 tl ns$\OT1/cmr/m/n/10 )$
 \T1/cmr/m/it/10 v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/i
t/10 :$\T1/cmr/m/it/10 allDefs g n v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun
[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses

Overfull \hbox (22.34937pt too wide) in paragraph at lines 1733--1737
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/
10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 lookupDef g m $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \T1/cmr/bx/n/1
0 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]loo
kupDef$\OML/cmm/m/it/10 ;$
[90]
Overfull \hbox (23.36525pt too wide) in paragraph at lines 1789--1796
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 defs$ [] $[]def phis$ [] $[]def allDefs[]var[]disjo
int[]aux split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 splits if[]split[]asm$\OT1/cmr/m/n/10 )$[] 
[91] [92]
Overfull \hbox (34.34283pt too wide) in paragraph at lines 2120--2134
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 by $\OMS/cms
y/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule braun[]ssa$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 defNode[]eq$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule assms
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 ;$ \T1
/cmr/m/it/10 subst braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]def$\
OML/cmm/m/it/10 ;$
[93]
Overfull \hbox (24.90512pt too wide) in paragraph at lines 2237--2239
[][]            \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst bra
un[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiArg[]def$\OML/cmm/m/it/10 ;$ \T1/
cmr/m/it/10 subst braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]def$\OML/c
mm/m/it/10 ;$ \T1/cmr/m/it/10 subst PhiDef[]defNode[]eq$\OML/cmm/m/it/10 ;$
[94]
Overfull \hbox (13.43826pt too wide) in paragraph at lines 2312--2319
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto split$\OT1/cmr
/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 splits if[]sp
lit[]asm simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phiDefNodes[]def elim$\OT1/
cmr/m/n/10 !$$:$\T1/cmr/m/it/10 fold[]union[]elem
) (./Construct_SSA_notriv.tex [95]
Overfull \hbox (0.50066pt too wide) in paragraph at lines 61--62
[][]  $\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base $
\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in-v
ar in-Edges$ [] $ En-try old-Defs oldUses
[96] [97]
Overfull \hbox (19.0183pt too wide) in paragraph at lines 335--337
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 sub-sti-tu-tion$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 re-dun-dant g $\OT1/
cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 isTriv-ial-Phi g $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 chooseNext g$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 subst
itution
[98]
Overfull \hbox (19.05222pt too wide) in paragraph at lines 453--455
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp only$\OT
1/cmr/m/n/10 :$\T1/cmr/m/it/10 n[]defNode v$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2
$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule trivialPhi[]strict
[]dom$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m
/it/10 substNext[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.92926pt too wide) in paragraph at lines 455--460
[][]      \T1/cmr/bx/n/10 more-over from \T1/cmr/m/it/10 v$\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 old$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?n$ [] $ n \T1/cmr/bx/n/10 by $\OMS
/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUses[]dominated$\O
ML/cmm/m/it/10 ;$
[99] [100] [101]
Overfull \hbox (42.34743pt too wide) in paragraph at lines 837--839
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$ \T1/cmr/m/it/10 simpleDefs[]phiDefs[]disjoint$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 unfolded CFG[]SSA[]defs$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$
\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]defs

Overfull \hbox (31.50557pt too wide) in paragraph at lines 901--914
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$\T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]def
 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiDefs[]def phiDefs[]def allDefs[]def
 split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 if[]split[]asm$\OT1/cmr/m/n/10 )$[] 
[102] [103]
Overfull \hbox (36.68791pt too wide) in paragraph at lines 1066--1068
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$\T1/cmr/m/it/10 allUses[]def[]ass$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/1
0 unfolded CFG[]SSA[]defs$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 sim-pli-fied$\OT1
/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA
[]defs$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (13.66513pt too wide) in paragraph at lines 1086--1088
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 chooseNext[]eliminated$\OT1/cmr/m/n
/10 :$ \T1/cmr/m/it/10 chooseNext g $[]$ step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 allDefs g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 defNode g $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 chooseNext
[104]
Overfull \hbox (1.65211pt too wide) in paragraph at lines 1229--1233
[][]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 ?n$[][]$ $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 n hd ns $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 n \T1/cmr/bx/n/10 u
s-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10
 )$ \T1/cmr/m/it/10 ns$[][]$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 ns old$\OML/cmm/m/it/10 :$\T1/c
mr/m/it/10 path2[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (16.59686pt too wide) in paragraph at lines 1279--1283
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 asm ns$[][]$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?n$[][
]$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 last ns$[][]$$\OT1/cmr/m/n/10 )$ \T1/cmr/
bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUs
es[]dominated$\OML/cmm/m/it/10 ;$

Overfull \hbox (18.9609pt too wide) in paragraph at lines 1283--1288
[][]          \T1/cmr/bx/n/10 more-over have \T1/cmr/m/it/10 strict[]def[]dom g
 v v$[][]$ \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 triv \T1/cmr/bx/n/10 by $\OMS
/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule trivialPhi[]strict[]d
om$\OML/cmm/m/it/10 ;$
[105]
Overfull \hbox (22.83139pt too wide) in paragraph at lines 1340--1343
[][]              \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 u
s-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 6$\OT1/cmr/m/n/10
 )$ []\T1/cmr/m/it/10 v$[][]$ $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 chooseNext g[
] simpleDefs[]phiDefs[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of
[106]
Overfull \hbox (31.96979pt too wide) in paragraph at lines 1467--1472
[][]              \T1/cmr/bx/n/10 ul-ti-mately show \T1/cmr/m/it/10 ?the-sis \T
1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 6$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 vs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 rule allDefs[]var[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of
[107]
Overfull \hbox (0.34885pt too wide) in paragraph at lines 1581--1583
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv
$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv $\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n

Overfull \hbox (27.16942pt too wide) in paragraph at lines 1607--1609
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$\T1/cmr/m/it/10 conventional$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 unf
olded CFG[]SSA[]defs$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 sim-pli-fied$\OT1/cmr/
m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]def
s$\OT1/cmr/m/n/10 )$[] 
[108] [109] [110]
Overfull \hbox (20.39001pt too wide) in paragraph at lines 1955--1963
[][]    \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 allVars[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]
def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses[]def uninst$\OML/cmm/m/it
/10 :$\T1/cmr/m/it/10 phiDefs[]def
[111]
Overfull \hbox (1.66362pt too wide) in paragraph at lines 2071--2075
[][]    \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?the-sis \T1/cmr/bx/n/10 us-ing \T
1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 step[]CFG[]SSA[]Transform
ed[]notriv$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simplified$\OT1/cmr/m/n/10 ]$ \T1/
cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp
[112]
Overfull \hbox (9.83093pt too wide) in paragraph at lines 2226--2230
[][]      \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m
/it/10 set $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n g$\OT1/cmr/
m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 defs g n $\OMS/cmsy/m/n/10 \$
 \T1/cmr/m/it/10 uses$ [] $[]all g n $\OT1/cmr/m/n/10 =$ $\OMS/cmsy/m/n/10 f$$g
$ \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 d
efs[]uses[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of
[113]
Overfull \hbox (26.728pt too wide) in paragraph at lines 2303--2305
[][]    \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 :$ $[]$\T1/cmr/m
/it/10 u p$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 redundant $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u g$\OT1/cmr/m/n/10 )$$)$
 $($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$
$=$\T1/cmr/m/it/10 p g$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/1
0  []!$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant

Overfull \hbox (18.20131pt too wide) in paragraph at lines 2309--2311
[][]      \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule sub-stAll$
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$[$\T1/cmr/bx/n/10 where 
\T1/cmr/m/it/10 Q$\OT1/cmr/m/n/10 =$$\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 u p$\
OML/cmm/m/it/10 :$ $\OMS/cmsy/m/n/10 :$\T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 redundant $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u$\OT1/cmr/m/n/10
 )$$)$ $($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n
/10 :$$=$\T1/cmr/m/it/10 p$\OT1/cmr/m/n/10 )$$)$
[114]
Overfull \hbox (10.06143pt too wide) in paragraph at lines 2394--2396
[][]    \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 :$ $[]$\T1/cmr/m
/it/10 u u$ [] $ p p$ [] $ g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 pruned $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u$ [] $$\
OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u g$\OT
1/cmr/m/n/10 )$$)$ $($\T1/cmr/m/it/10 p$ [] $$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 p g$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/
10 g $\OMS/cmsy/m/n/10  []!$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 pruned

Overfull \hbox (11.27089pt too wide) in paragraph at lines 2402--2404
[][]    \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 rule sub-stAll$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$[$\
T1/cmr/bx/n/10 where \T1/cmr/m/it/10 P$\OT1/cmr/m/n/10 =$$\OML/cmm/m/it/10 ^^U$
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 p$\OT1/
cmr/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1
/cmr/m/it/10 pruned $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u$\OT1/cmr/m/n/10 )$$)$ $
($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=
$\T1/cmr/m/it/10 p$\OT1/cmr/m/n/10 )$$)$
) (./SSA_Semantics.tex [115] [116]
Overfull \hbox (7.19157pt too wide) in paragraph at lines 171--175
[][]      \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 empty$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 n \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 n $\OT1/cmr/m/n/10 =$ \T1/cmr/m/i
t/10 En-try g \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 cases ms$\O
ML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto dest$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 
old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]hd$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (7.21399pt too wide) in paragraph at lines 198--202
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 snoc$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 hyps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/
10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 6\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 En-try g \T1/cmr/
bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 Entry[]no[]predecessor$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (3.32082pt too wide) in paragraph at lines 249--252
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 ns$ [] $ \T1/cmr/bx/n/10 hav
e \T1/cmr/m/it/10 bns$ [] $$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 g $\OMS/cmsy/m/n
/10 `$ \T1/cmr/m/it/10 En-try g$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 butlast ns
$ [] $$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 ?n$ [] $$ [] $ ?n$ [] $$ [] $ $\OMS/c
msy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 old$\OML/c
mm/m/it/10 :$\T1/cmr/m/it/10 predecessors
[117] [118]) (./While_Combinator_Exts.tex [119] [120]) (./SSA_CFG_code.tex)
(./Construct_SSA_code.tex) (./Construct_SSA_notriv_code.tex
Overfull \hbox (5.98059pt too wide) in paragraph at lines 34--36
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 substNext[]code g next $\OMS/cmsy/m/n/10 ^^Q
$ $\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 i
f v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 snd next then substitution[]code
[121]
Overfull \hbox (11.98946pt too wide) in paragraph at lines 107--108
[][]    \T1/cmr/m/it/10 fold $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$\T1/cmr/m
/it/10 n$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 update n $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 List$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 map $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 id$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 snd next $\OT1/cmr/m/n/10 :$$=$ \T1/cmr/m/it/10 next$ [] $$\OT1/cmr
/m/n/10 )$$)$ $($\T1/cmr/m/it/10 the $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup

Overfull \hbox (12.97588pt too wide) in paragraph at lines 108--109
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 sorted[]list[]of[]set $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n
/10 )$ $($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nod
es[]of[]phis

Overfull \hbox (4.0448pt too wide) in paragraph at lines 114--115
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 let old[]phis $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ \T1/cmr/m/it/10 id 
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 l
ookup nodes[]of[]phis

Overfull \hbox (13.59372pt too wide) in paragraph at lines 125--127
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 step[]codem g next next$ [] $ nodes[]of[]use
s nodes[]of[]phis $\OT1/cmr/m/n/10 =$ $($\T1/cmr/m/it/10 uses$ [] $[]codem
[122]
Overfull \hbox (6.30238pt too wide) in paragraph at lines 134--136
[][]\T1/cmr/bx/n/10 locale \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linor
der $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base
[123]
Overfull \hbox (11.81181pt too wide) in paragraph at lines 342--343
[][]$\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linorder
 $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in
-var in-Edges$ [] $ En-try old-Defs oldUses
[124]
Overfull \hbox (0.95255pt too wide) in paragraph at lines 367--368
\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 var $\OML/cmm/m/it/10 ^^U$\T1/cmr/
m/it/10 uses phis$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 chooseNext[]all uses $\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mappi
ng
[125]
Overfull \hbox (104.92482pt too wide) in paragraph at lines 453--455
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 redundant[]ign$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]cod
e $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10
 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code

Overfull \hbox (21.5668pt too wide) in paragraph at lines 455--463
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code[]def 
uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 trivial[]code[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/
m/n/10 ]$

Overfull \hbox (24.16965pt too wide) in paragraph at lines 475--477
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 uses$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 const u$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/
10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (90.55998pt too wide) in paragraph at lines 477--485
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 uses$ [] $[]codem[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs
[]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it
/10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution
[]code[]def

Overfull \hbox (5.11174pt too wide) in paragraph at lines 496--498
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/1
0 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code

Overfull \hbox (81.61777pt too wide) in paragraph at lines 498--506
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]code[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[
]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[
]code[]def

Overfull \hbox (29.6548pt too wide) in paragraph at lines 518--520
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $m[]ign$\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it
/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem

Overfull \hbox (89.79355pt too wide) in paragraph at lines 520--528
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]codem[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs
[]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it
/10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution
[]code[]def
[126]
Overfull \hbox (0.9442pt too wide) in paragraph at lines 581--583
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 Mapping[]lookup[]map[]values Mapping[]lookup[]map O
p-tion$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 bind[]def

Overfull \hbox (6.7089pt too wide) in paragraph at lines 589--591
[][]      \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 phis$ [] $[]codem[]def mm
ap[]def ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup[]phiNodes[]of $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 OF ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis[]finite$
\OT1/cmr/m/n/10 ]$

Overfull \hbox (18.40192pt too wide) in paragraph at lines 646--648
[][]  \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 clarsimp simp$\
OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 mmap[]def Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 replace[]def $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/m/n/
10 ]$ \T1/cmr/m/it/10 phi[]equiv[]mapping[]def
[127]
Overfull \hbox (25.52013pt too wide) in paragraph at lines 662--664
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/
m/n/10 :$ \T1/cmr/m/it/10 map[]of[]map[]restrict restrict[]map[]def substNext[]
code[]def fold[]update[]conv

Overfull \hbox (51.08165pt too wide) in paragraph at lines 673--675
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]ign$\OT1/cmr/m/n/10 [$\T1/cmr
/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 step[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const u$\OT
1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 step[]codem

Overfull \hbox (6.25371pt too wide) in paragraph at lines 693--706
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 rel[]fun[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 pcr[]cr[]eq cr[]mapping[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 rep[]inverse$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (15.82213pt too wide) in paragraph at lines 711--724
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 rel[]fun[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 pcr[]cr[]eq cr[]mapping[]def Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 lookup$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 rep[]eq$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (8.04977pt too wide) in paragraph at lines 771--772
[][]  \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m
/it/10 nodes[]of[]phis $\OMS/cmsy/m/n/10 ^^Y$$[][]$ \T1/cmr/m/it/10 ssa$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of g \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 
Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis
[128]
Overfull \hbox (7.95027pt too wide) in paragraph at lines 819--820
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [] $[]codem g next $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ \T
1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$

Overfull \hbox (46.09499pt too wide) in paragraph at lines 838--840
[][]      \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT
1/cmr/m/n/10 !$$:$ \T1/cmr/m/it/10 map[]idI $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 
symmetric$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/
it/10 Mapping[]lookup[]map[]values substNext[]code[]def

Overfull \hbox (40.8658pt too wide) in paragraph at lines 876--877
[][]    \T1/cmr/m/it/10 Some $\OT1/cmr/m/n/10 ($$($\T1/cmr/m/it/10 case[]option
 $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Set$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 substitution[]code

Overfull \hbox (16.56137pt too wide) in paragraph at lines 928--935
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 Mapping[]lookup[]map[]values bind[]eq[]None[]conv m
ap[]conv[]bind[]option
[129]
Overfull \hbox (33.3333pt too wide) in paragraph at lines 1041--1043
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]phis$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [
] $[]codem g next next$ [] $ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of
[130]
Overfull \hbox (15.79576pt too wide) in paragraph at lines 1065--1074
[][]    \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 un-fold-in
g \T1/cmr/m/it/10 phis$ [] $[]codem[]def phi[]equiv[]mapping[]def ssa$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 keys[]phidefNodes

Overfull \hbox (33.62422pt too wide) in paragraph at lines 1074--1081
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 force split$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 op-tion$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 splits i
f[]splits simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 fold[]update[]conv fun[]upd[]
apply keys[]dom[]lookup

Overfull \hbox (31.08868pt too wide) in paragraph at lines 1087--1088
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (59.96251pt too wide) in paragraph at lines 1137--1139
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OMS/cmsy/m/n/10  []!$ $\OML/cmm/m/it/10 '$ $\OMS/cmsy/m/
n/10 2$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis
[131]
Overfull \hbox (16.53975pt too wide) in paragraph at lines 1157--1159
[][]      \T1/cmr/bx/n/10 hence $\OML/cmm/m/it/10 '$ $[]$ \T1/cmr/m/it/10 unins
t[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 phis$ [] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst
itution[]code
[132]
Overfull \hbox (8.66772pt too wide) in paragraph at lines 1263--1266
\T1/cmr/m/it/10 next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g ne
xt$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$$)$ \T1
/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]ph
is
[133]
Overfull \hbox (23.4298pt too wide) in paragraph at lines 1423--1425
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subgoal[]tac 
fi-nite $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 dom $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr
/m/it/10 phis$ [] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substituti
on[]code
[134] [135] [136]
Overfull \hbox (15.5058pt too wide) in paragraph at lines 1671--1673
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subgoal[]tac 
$\OMS/cmsy/m/n/10 f$\T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 phis g$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 snd next $\OMS/c
msy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 the $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
[137]
Overfull \hbox (6.85002pt too wide) in paragraph at lines 1767--1769
[][]      \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\
OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 keys[]dom[]lookup dest$\OT1/cmr/m/n/10 :$ \T1
/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 force dest$\OT1/
cmr/m/n/10 :$ \T1/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 )$$[$\T1/cmr/m/it/
10 1$\OT1/cmr/m/n/10 ]$[] 

Overfull \hbox (4.29509pt too wide) in paragraph at lines 1805--1807
[][]     \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\O
T1/cmr/m/n/10 :$ \T1/cmr/m/it/10 keys[]dom[]lookup dest$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 force dest$\OT1/c
mr/m/n/10 :$ \T1/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 )$$[$\T1/cmr/m/it/1
0 1$\OT1/cmr/m/n/10 ]$[] 
[138]
Overfull \hbox (40.67703pt too wide) in paragraph at lines 1837--1838
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 nodes[]of[]uses$ [] $ g next $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phidefNodes
[139]
Overfull \hbox (7.31837pt too wide) in paragraph at lines 1968--1970
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst uses$ [
] $[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$\O
ML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 un-folded substitution[]code[]def$\OT1/cmr/m/
n/10 ]$$)$[] 
[140] [141]
Overfull \hbox (15.93558pt too wide) in paragraph at lines 2099--2101
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]uses$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$ [
] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code
[142]
Overfull \hbox (10.88066pt too wide) in paragraph at lines 2190--2198
[][]    \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of[]def u
ninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 phis[]addN[]def $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/m/n
/10 ]$

Overfull \hbox (38.43755pt too wide) in paragraph at lines 2248--2249
[][]        $\OMS/cmsy/m/n/10 ^$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const 
p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g nodes[]of[]uses $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 useNodes[]of

Overfull \hbox (36.90468pt too wide) in paragraph at lines 2249--2250
[][]        $\OMS/cmsy/m/n/10 ^$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const 
p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g phis[]of[]nodes $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (0.1367pt too wide) in paragraph at lines 2267--2270
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 s1[]uses s1[]phis s1[]triv
[]phis s1[]nodes[]of[]uses s1[]phi[]nodes[]of \T1/cmr/bx/n/10 where[] 
[143]
Overfull \hbox (2.51563pt too wide) in paragraph at lines 2275--2276
[][]      \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 nou[]equiv$\OT1/cmr/m/n/10 :$ \T1
/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mappin
g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/
m/it/10 g s1[]nodes[]of[]uses

Overfull \hbox (13.4409pt too wide) in paragraph at lines 2279--2283
\T1/cmr/m/it/10 in-var in-Edges$ [] $ En-try old-Defs oldUses defs u[]g g s1[]u
ses p[]g g s1[]phis var chooseNext[]all

Overfull \hbox (9.79211pt too wide) in paragraph at lines 2332--2334
[][]      \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 Max $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 CFG[]SSA[]wf[]base[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phi
s $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 p[]g g s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr
/m/it/10 g$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 chooseNext[]all
[144]
Overfull \hbox (44.5052pt too wide) in paragraph at lines 2351--2353
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 useNodes[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 const s1[]uses$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 useNodes[]of

Overfull \hbox (42.2059pt too wide) in paragraph at lines 2360--2362
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (69.22342pt too wide) in paragraph at lines 2376--2378
[][]      \T1/cmr/bx/n/10 hence $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cm
r/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 
phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/
m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping

Overfull \hbox (41.23457pt too wide) in paragraph at lines 2401--2403
[][]       \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst i$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem[]correct $\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 symmetric$\OML/cmm/m/it/10 ;$ \T1/cmr/bx/n/10 where \T1/cmr/m/i
t/10 nodes[]of[]uses$\OT1/cmr/m/n/10 =$\T1/cmr/m/it/10 s1[]nodes[]of[]uses$\OT1
/cmr/m/n/10 ]$$)$[] 
[145]
Overfull \hbox (50.05571pt too wide) in paragraph at lines 2427--2429
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
ubstitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/
n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (24.47787pt too wide) in paragraph at lines 2439--2441
[][]      \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 step[]s2$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 step g ?s2 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]prod us-esOf Ma
p-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 step[]codem

Overfull \hbox (112.73097pt too wide) in paragraph at lines 2453--2455
[][]       \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 clarsimp s
imp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 substNext[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]def CF
G[]SSA[]wf[]base$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]wf[]defs$\OT1/cmr
/m/n/10 )$[] 
[146]
Overfull \hbox (3.0547pt too wide) in paragraph at lines 2463--2464
[][]          $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 p g $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g 
?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 substitution[]code

Overfull \hbox (34.56685pt too wide) in paragraph at lines 2464--2466
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT
1/cmr/m/n/10 :$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $
[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF phi[]equiv[]mapping[]ref
l$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$
 [] $[]codem[]correct

Overfull \hbox (26.06744pt too wide) in paragraph at lines 2469--2470
[][]        \T1/cmr/m/it/10 us-esOf $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]
code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 u g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$
)$ \T1/cmr/m/it/10 g ?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (41.51004pt too wide) in paragraph at lines 2470--2471
[][]          $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 us-esOf $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem
 $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst 
s1$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g ?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (36.09972pt too wide) in paragraph at lines 2471--2473
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT
1/cmr/m/n/10 :$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $
[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF phi[]equiv[]mapping[]ref
l$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$
 [] $[]codem[]correct

Overfull \hbox (4.87158pt too wide) in paragraph at lines 2474--2476
[][]      \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 step[]s2$\OT1/cmr/m/n/10 [$\T1/c
mr/m/it/10 symmetric$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :
$\T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv []Mapping$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 keys

Overfull \hbox (51.64523pt too wide) in paragraph at lines 2481--2482
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/1
0 )$$)$$)$ \T1/cmr/m/it/10 g ?next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 s1[]nodes
[]of[]uses s1[]phi[]nodes[]of$\OT1/cmr/m/n/10 )$$)$[] 

Overfull \hbox (51.64523pt too wide) in paragraph at lines 2482--2483
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/1
0 )$$)$$)$ \T1/cmr/m/it/10 g ?next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 s1[]nodes
[]of[]uses s1[]phi[]nodes[]of$\OT1/cmr/m/n/10 )$$)$[] 
[147]
Overfull \hbox (31.1545pt too wide) in paragraph at lines 2515--2517
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 p[]g g s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (90.91887pt too wide) in paragraph at lines 2540--2541
[][]      $[]$\T1/cmr/m/it/10 m1 m2$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst[
]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g m1 m2 $\OT
1/cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping
[148]
Overfull \hbox (1.76341pt too wide) in paragraph at lines 2607--2608
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$$)$ \T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 
)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substi
tution[]code

Overfull \hbox (1.76341pt too wide) in paragraph at lines 2608--2609
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$$)$ \T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 
)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substi
tution[]code

Overfull \hbox (4.99088pt too wide) in paragraph at lines 2612--2613
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lo
okup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis g$\OT1/cmr/m/n/10 )$$)$$)$ $($\T1/
cmr/m/it/10 fst $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 snd s1$\OT1/cmr/m/n/10 )$$)$$)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 useNod
es[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const
) (./Disjoin_Transform.tex [149]
Overfull \hbox (14.60175pt too wide) in paragraph at lines 37--38
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxVnameLen[]aux $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 e1 \T1/cmr/m/n/10 ^^S [] ^^T \T1/cmr/m/it/10 e2$\OT1/cmr/m/n/10 )
$ $=$ \T1/cmr/m/it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux e
1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (20.5284pt too wide) in paragraph at lines 44--45
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxV-name-Len $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 if $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 b$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 c$[][]$ else c$[][]$$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 max $\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen c$[][]$$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/
it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (21.12737pt too wide) in paragraph at lines 96--109
[][]\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule maxVnameLen[]new
name$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/
m/it/10 tempName[]def String$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 literal$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 STR[]inverse
[150]
Overfull \hbox (37.53712pt too wide) in paragraph at lines 224--226
[][]  \T1/cmr/bx/n/10 proof $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 cases $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 transform[]aux temp c1$\OT1/cmr/m/n/10 ;$$;$ \T1/cmr/m
/it/10 transform[]aux temp c2$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 V$\OT1/cmr/
m/n/10 :$$=$\T1/cmr/m/it/10 e$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 rule$\OT1/cmr/
m/n/10 :$\T1/cmr/m/it/10 subcmd$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 cases$\OT1/c
mr/m/n/10 )$[] 
[151]
Overfull \hbox (10.09949pt too wide) in paragraph at lines 273--277
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 5$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 prems \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?case \T1/cmr/bx/n/10 by $\OMS/cmsy
/m/n/10 ^^@$$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule 5$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 IH$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto elim$\OT1/cmr/m/n/10 :$\T
1/cmr/m/it/10 subcmd$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 cases new-name$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 cases$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (18.42184pt too wide) in paragraph at lines 305--307
[][]\T1/cmr/bx/n/10 corollary \T1/cmr/m/it/10 Defs[]Uses[]transform[]disjoint $
\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 De
fs $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 transform c$\OT1/cmr/m/n/10 )$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10 Uses $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 transform
))
No file root.bbl.
[152] (./root.aux)

Package rerunfilecheck Warning: File `root.out' has changed.
(rerunfilecheck)                Rerun to get outlines right
(rerunfilecheck)                or use package `bookmark'.


LaTeX Warning: There were undefined references.

 )
(see the transcript file for additional information){/usr/share/texmf/fonts/enc
/dvips/cm-super/cm-super-t1.enc}</usr/share/texlive/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmex10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/ams
fonts/cm/cmmi10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr1
0.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></usr/shar
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texl
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb></usr/share/texlive/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/texmf-dist
/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texmf/fonts/type1/public/
cm-super/sfbx1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1095.pf
b></usr/share/texmf/fonts/type1/public/cm-super/sfbx1200.pfb></usr/share/texmf/
fonts/type1/public/cm-super/sfbx1440.pfb></usr/share/texmf/fonts/type1/public/c
m-super/sfrm1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfrm1095.pfb
></usr/share/texmf/fonts/type1/public/cm-super/sfrm1200.pfb></usr/share/texmf/f
onts/type1/public/cm-super/sfrm1728.pfb></usr/share/texmf/fonts/type1/public/cm
-super/sfti1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfti1095.pfb>

Output written on root.pdf (152 pages, 666713 bytes).
Transcript written on root.log.
This is BibTeX, Version 0.99d (TeX Live 2015/dev/Debian)
The top-level auxiliary file: root.aux
The style file: abbrv.bst
Database file #1: root.bib
This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex)
 restricted \write18 enabled.
entering extended mode
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 79 languages loaded.

(./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def))
(/usr/share/texlive/texmf-dist/tex/latex/quotmark/quotmark.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
For additional information on amsmath, use the `?' option.
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def
(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg)
(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty)
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty))))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de
f)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code.
tex)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet
ric.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod
e.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerari
thmetics.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct.
code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation
s.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t
ex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code.
tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code.
tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex
) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex
)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65
.sty)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18
.sty)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/math/pgfmath.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarytopaths.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarypositioning.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarycalc.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibraryarrows.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code.
tex)) (./isabelle.sty (./comment.sty Excluding comment 'comment')
Including comment 'isadelimtheory' Including comment 'isatagtheory'
Including comment 'isadelimproof' Including comment 'isatagproof'
Including comment 'isadelimML' Including comment 'isatagML'
Including comment 'isadelimvisible' Including comment 'isatagvisible'
Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible')
(./isabelletags.sty) (./isabellesym.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty))
(./pdfsetup.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty))
(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty)
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg)

Package hyperref Warning: Option `pagecolor' is not available anymore.

(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty))

Package hyperref Message: Driver (autodetected): hpdftex.

(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty))
(./root.aux) ABD: EveryShipout initializing macros
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg))
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty))
(./root.out) (./root.out)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd)

LaTeX Warning: Citation `braun13cc' on page 1 undefined on input line 48.


LaTeX Warning: Citation `barthe14' on page 1 undefined on input line 48.

(./root.toc [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}])
(./session.tex (./Sublist.tex) (./RBT_Set.tex) (./Mapping.tex)
(./RBT_Mapping.tex) (./Char_ord.tex) (./List_lexord.tex) (./Com.tex)
(./AuxLemmas.tex) (./BasicDefs.tex) (./WCFG.tex) (./CFG.tex) (./CFGExit.tex)
(./Interpretation.tex) (./Labels.tex) (./CFG_wf.tex) (./CFGExit_wf.tex)
(./Observable.tex) (./Distance.tex) (./DynDataDependence.tex)
(./DataDependence.tex) (./SemanticsCFG.tex) (./Slice.tex) (./Postdomination.tex
) (./DynStandardControlDependence.tex) (./StandardControlDependence.tex)
(./DynWeakControlDependence.tex) (./WeakControlDependence.tex) (./PDG.tex)
(./WeakOrderDependence.tex) (./CDepInstantiations.tex) (./WellFormed.tex)
(./AdditionalLemmas.tex) (./Graph.tex) (./GraphSpec.tex) (./FormalSSA_Misc.tex
Overfull \hbox (5.79439pt too wide) in paragraph at lines 31--44
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis One[]nat[]def
 ap-pend$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 append[]butlast[]last[]id diff[]Suc[]
Suc diff[]zero

Overfull \hbox (8.44907pt too wide) in paragraph at lines 73--86
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id append[]is[]Nil[]conv list$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dist
inct$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 ro-
tate1$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 2$\OT1/cmr/m/n/10 )$

Overfull \hbox (10.182pt too wide) in paragraph at lines 148--161
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id append[]is[]Nil[]conv assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\O
T1/cmr/m/n/10 )$ \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1
/cmr/m/n/10 )$ \T1/cmr/m/it/10 last[]appendR
[2]
Overfull \hbox (2.92094pt too wide) in paragraph at lines 218--233
[][]\T1/cmr/bx/n/10 using \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 un-fold-ing \T1
/cmr/m/it/10 append[]butlast[]last[]id$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 symmet
ric$\OT1/cmr/m/n/10 ]$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 au
to simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 less[]le

Overfull \hbox (3.62933pt too wide) in paragraph at lines 292--305
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis One[]nat[]def
 diff[]Suc[]Suc last[]in[]set last[]tl length[]tl less[]numeral[]extra$\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 )$

Overfull \hbox (15.09085pt too wide) in paragraph at lines 378--385
[][]\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis Sup[]empty Sup[
]insert Sup[]set[]fold Un[]insert[]right UnionI ccpo[]Sup[]singleton
[3] [4]
Overfull \hbox (1.54424pt too wide) in paragraph at lines 587--591
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 ob-tain \T1/cmr/m/it/10 i \T1/cmr/bx/n
/10 where \T1/cmr/m/it/10 y $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 ys $\OT1/cmr/m/
n/10 !$ \T1/cmr/m/it/10 i i $\OML/cmm/m/it/10 <$ \T1/cmr/m/it/10 length ys \T1/
cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis in[]set[]conv[]nth$\OT1
/cmr/m/n/10 )$[] 
[5]
Overfull \hbox (35.85776pt too wide) in paragraph at lines 827--840
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id but-last$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 
($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 distinct[]append inf[]bo
t[]right inf[]commute

Overfull \hbox (55.55222pt too wide) in paragraph at lines 899--912
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis but-last$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/c
mr/m/n/10 )$ \T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 str
ict[]iff[]order hd[]Cons[]tl hd[]in[]set length[]greater[]0[]conv
[6]
Overfull \hbox (26.80919pt too wide) in paragraph at lines 1070--1072
[][] \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 Min$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 infinite Min[]in Min[]singleton all[]not[]in[]co
nv finite[]subset

Overfull \hbox (30.42868pt too wide) in paragraph at lines 1092--1094
[][] \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 Max$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 infinite Max[]in Max[]singleton all[]not[]in[]co
nv finite[]subset
[7]) (./Serial_Rel.tex
Overfull \hbox (3.40428pt too wide) in paragraph at lines 41--43
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 iterated[]serial[]on[]linear$\OT1/cmr
/m/n/10 :$ \T1/cmr/m/it/10 iterated[]serial[]on A r x $\OT1/cmr/m/n/10 ($\T1/cm
r/m/it/10 n$\OT1/cmr/m/n/10 +$\T1/cmr/m/it/10 m$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/
m/it/10 iterated[]serial[]on
[8]
Overfull \hbox (4.2211pt too wide) in paragraph at lines 158--163
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 a \T1/cmr/bx/n/10 have \T1/cmr/m/it/
10 range ?f $\OMS/cmsy/m/n/10 ^^R$ \T1/cmr/m/it/10 A \T1/cmr/bx/n/10 us-ing \T1
/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/c
mr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$
 \T1/cmr/m/it/10 iterated[]serial[]on[]in[]A$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (11.0342pt too wide) in paragraph at lines 171--173
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/m
/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 lift-ing
$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 finite[]nat[]set[]iff[]bounded mem[]Collect
[]eq not[]less[]eq$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.78395pt too wide) in paragraph at lines 181--183
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule iterated[]se
rial[]on[]in[]power$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 
($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 r
ule iterated[]serial[]on[]in[]A$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF
) (./Mapping_Exts.tex [9]
Overfull \hbox (30.45937pt too wide) in paragraph at lines 137--153
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]Mapping[]lookup $\OT1/cmr/m/
n/10 [$\T1/cmr/m/it/10 simp$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 code[]unfold$\O
T1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 Mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 lookup

Overfull \hbox (6.28238pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]lookup[]map$\OT1/cmr/m/n/10 
:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map f g m$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 a $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]o
ption
[10]
Overfull \hbox (6.899pt too wide) in paragraph at lines 289--291
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]eq[]iff$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 m1 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m2 $\OMS/cmsy/m/n/10  []!
$ $\OT1/cmr/m/n/10 ($$\OMS/cmsy/m/n/10 8 $\T1/cmr/m/it/10 k$\OML/cmm/m/it/10 :$
 \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup m1 k $\OT1/
cmr/m/n/10 =$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 looku
p

Overfull \hbox (5.08723pt too wide) in paragraph at lines 343--345
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 map[]default[]eq$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map[]default k v f m
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m $\OMS/cmsy/m/n/10  []!$ $\OT1/cmr/m/n/10
 ($$\OMS/cmsy/m/n/10 9 $\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 M
ap-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
) (./RBT_Mapping_Exts.tex [11] [12]
Overfull \hbox (38.83908pt too wide) in paragraph at lines 176--189
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/
m/n/10 :$ \T1/cmr/m/it/10 RBT[]Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Set[]def 
RBT$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys[]def[]alt RBT$\OML/cmm/m/it/10 :$\T
1/cmr/m/it/10 lookup[]in[]tree elim$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 rev[]ima
ge[]eqI$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (45.4871pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mmap[]rbt[]code $\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mmap f $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mapping t$\
OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 Mapping

Overfull \hbox (80.39288pt too wide) in paragraph at lines 211--213
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]add[]code $\OT1/cmr/m/n/10 [
$\T1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mapping[]add $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Ma
pping t1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$
\T1/cmr/m/it/10 Mapping
) (./Graph_path.tex [13] [14] [15] [16]
Overfull \hbox (34.3785pt too wide) in paragraph at lines 525--529
[][]    \T1/cmr/bx/n/10 thus \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/i
t/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 predecessors g m$\OT1/cmr/m/n/10 )$
 \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 predecessors[]def \T1/cmr/bx/n/10 
by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis get[]edge[]simps$\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$
[17] [18]
Overfull \hbox (8.362pt too wide) in paragraph at lines 953--955
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 path[]by[]tail$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ $[]$\T1/cmr/m/it/10 path g $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 n$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m
/n/10 #$\T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 )$$;$ \T1/cmr/m/it/10 path g $\OT1/c
mr/m/n/10 ($\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ns$\OT1/c
mr/m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 path g $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ms$\OT1/cmr/m/n/10 )$
$[]$

Overfull \hbox (20.01353pt too wide) in paragraph at lines 1061--1063
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 elem[]set[]implies[]elem[]tl[]app[]
cons$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/
10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set xs $\OT1/cmr/m/n/10 =[]\OMS/cmsy/
m/n/10 )$ \T1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 tl $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ys$\OT1/cmr/m/n/
10 @$\T1/cmr/m/it/10 y$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 xs$\OT1/cmr/m/n/10 )$$
)$[] 
[19] [20] [21] [22] [23]
Overfull \hbox (16.18484pt too wide) in paragraph at lines 1772--1779
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id dis-tinct$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 distinct1[]rotate hd[]C
ons[]tl path2[]hd
[24] [25] [26]
Overfull \hbox (11.96931pt too wide) in paragraph at lines 2152--2165
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis hd[]Cons[]t
l last[]appendR last[]snoc length[]greater[]0[]conv length[]tl path2[]def
[27]
Overfull \hbox (17.44365pt too wide) in paragraph at lines 2250--2254
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 Entry[]reaches$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OML/cmm/m/it/10 ;$
\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$ \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 Fa
lse \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto elim$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 simple[]path2[]unsnoc$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (6.43822pt too wide) in paragraph at lines 2282--2286
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 Entry[]unreachable$\OT1/cmr/m/n/10
 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10
 )$$]$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 by $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 predecessor
s[]def$\OT1/cmr/m/n/10 )$[] 
[28]
Overfull \hbox (3.79758pt too wide) in paragraph at lines 2496--2500
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 as \T1/cmr/bx/n/10 where \
T1/cmr/m/it/10 pre-fix$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 pre-fix $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 as$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/
m/n/10 ]$$)$ \T1/cmr/m/it/10 ns \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prefix[]split[]first$\OT1/
cmr/m/n/10 )$[] 
[29]
Overfull \hbox (3.79758pt too wide) in paragraph at lines 2552--2556
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 as \T1/cmr/bx/n/10 where \
T1/cmr/m/it/10 pre-fix$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 pre-fix $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 as$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/
m/n/10 ]$$)$ \T1/cmr/m/it/10 ns \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prefix[]split[]first$\OT1/
cmr/m/n/10 )$[] 
[30] [31] [32] [33]
Overfull \hbox (16.75742pt too wide) in paragraph at lines 3230--3232
[][]      \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 this$\OT1/cmr/m/n/10 [$\T1/cmr/m
/it/10 unfolded shortestPath[]def$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 THEN not[
]less[]Least$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 folded shortestPath[]def$\OML/
cmm/m/it/10 ;$
[34] [35] [36] [37]) (./SSA_CFG.tex [38] [39]
Overfull \hbox (12.80359pt too wide) in paragraph at lines 290--292
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]defs $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 phiDefs[]def allDefs[]def phiUses[]def allUses[]def allVars[]
def
[40] [41] [42] [43]
Overfull \hbox (1.3536pt too wide) in paragraph at lines 829--831
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]wf[]defs $\OT1/cmr/m/n/
10 =$ \T1/cmr/m/it/10 CFG[]SSA[]defs defNode[]code phi[]def isTrivialPhi[]def
[44] [45] [46] [47] [48]
Overfull \hbox (2.79701pt too wide) in paragraph at lines 1566--1569
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 base$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 hyps base$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 ob-tain \T1/cmr/m/it/10 ns$ []
 $ m \T1/cmr/bx/n/10 where \T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 :$ \T1/cmr/
m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m/it/10 defN-ode g q$\OMS/cmsy/m/n/10 ^^
@$\T1/cmr/m/it/10 ns$ [] $$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 m

Overfull \hbox (1.187pt too wide) in paragraph at lines 1571--1574
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 :$ \T1/cmr/m/i
t/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m/it/10 defN-ode g q$\OMS/cmsy/m/n/10 ^^@$\
T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 defNode g p$\OT1/c
mr/m/n/10 ]$$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 defNode g p length $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 defNode
[49] [50] [51] [52] [53] [54]
Overfull \hbox (2.62746pt too wide) in paragraph at lines 2295--2299
[][]    \T1/cmr/bx/n/10 thus \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 us-ing \T1/c
mr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$ \T1/cmr/m/it/10 phiArg[]same
[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$$]$
[55] [56]) (./Minimality.tex

LaTeX Warning: Citation `braun13cc' on page 57 undefined on input line 10.

[57]
Overfull \hbox (7.3134pt too wide) in paragraph at lines 90--95
[][]        \T1/cmr/bx/n/10 ul-ti-mately show \T1/cmr/m/it/10 False \T1/cmr/bx/
n/10 us-ing \T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 THEN bspec$\OT1
/cmr/m/n/10 [$\T1/cmr/bx/n/10 where \T1/cmr/m/it/10 x$\OT1/cmr/m/n/10 =$\T1/cmr
/m/it/10 j$\OT1/cmr/m/n/10 ]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 THEN bspec$\O
T1/cmr/m/n/10 [$\T1/cmr/bx/n/10 where
[58] [59]
Overfull \hbox (40.47578pt too wide) in paragraph at lines 275--280
[][]      \T1/cmr/bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/
m/n/10 ]$$:$ \T1/cmr/m/it/10 var g q $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 var g 
r \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]
$ \T1/cmr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF
[60] [61] [62] [63]
Overfull \hbox (18.59981pt too wide) in paragraph at lines 728--732
[][]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 isTriv-ial-Phi g p q \T1/cmr/
bx/n/10 us-ing \T1/cmr/m/it/10 vs \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr
/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 isTrivialPhi[]def split$\O
T1/cmr/m/n/10 :$\T1/cmr/m/it/10 option$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 split
$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (50.9754pt too wide) in paragraph at lines 825--827
[][]        \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 1$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 prefix[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it
/10 :$\T1/cmr/m/it/10 strict[]implies[]order prefix[]order$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trans[] 
[64]
Overfull \hbox (8.14215pt too wide) in paragraph at lines 848--850
[][]              \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto si
mp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 pat
h2[]def simp del$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 One[]nat[]def dest$\OT1/cmr/
m/n/10 !$$:$\T1/cmr/m/it/10 singleton[]list[]hd[]last$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (7.83286pt too wide) in paragraph at lines 942--946
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms that \T1/cmr/bx/n/10 show \T
1/cmr/m/it/10 ?the-sis \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 au
to simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 unnecessaryPhi[]def necessaryPhi[]de
f
[65] [66] [67]
Overfull \hbox (12.74742pt too wide) in paragraph at lines 1142--1146
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 4 ns$[][]$$\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?the
-sis \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 rule in[]set[]butlastI$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]def$\O
T1/cmr/m/n/10 )$[] 

Overfull \hbox (30.53955pt too wide) in paragraph at lines 1175--1179
[][]              \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 :$ \T
1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 butlast ns$[][]$$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 us-ing \T1/cmr
/m/it/10 ns$[][]$$ [] $$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 3$\OT1/cmr/m/n/10 )$ 
\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto dest$\OT1/cmr/m/n/10
 :$\T1/cmr/m/it/10 set[]mono[]strict[]prefix$\OT1/cmr/m/n/10 )$[] 
[68] (/usr/share/texlive/texmf-dist/tex/latex/base/omscmr.fd)
Overfull \hbox (92.98157pt too wide) in paragraph at lines 1330--1333
[][]          \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 asm$\OT1/cmr/m/n/10 [$\T1/
cmr/m/it/10 THEN con-junct1$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 asm$\OT1/cmr/m/n
/10 [$\T1/cmr/m/it/10 THEN con-junct2$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 rs \T1
/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule ununnecessaryPhis[]disj
oint[]paths$\OML/cmm/m/it/10 ;$
[69] [70]
Overfull \hbox (0.62141pt too wide) in paragraph at lines 1461--1465
[][]        \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 z$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 z $\OMS/cmsy/m/
n/10 2$ \T1/cmr/m/it/10 set ns$ [] $$ [] $ $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10
 set ms$ [] $$ [] $ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto 
simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 
pathsConverge$ [] $[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (6.07417pt too wide) in paragraph at lines 1500--1502
[][]            \T1/cmr/bx/n/10 proof $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule n
ecessaryPhi[]is[]necessary$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF nec-es-sary$\OT
1/cmr/m/n/10 [$\T1/cmr/m/it/10 simplified rs$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 
symmetric$\OT1/cmr/m/n/10 ]$$]$
[71] [72]
Overfull \hbox (12.2103pt too wide) in paragraph at lines 1681--1685
[]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 dom$\OT1/cmr/m/n/10 :$ \T1/cmr/
m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?R ?S \T1/cmr/bx/n/1
0 us-ing \T1/cmr/m/it/10 5 ss$ [] $ \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 d
ominates[]extend$\OT1/cmr/m/n/10 )$ 
[73] [74]
Overfull \hbox (5.25847pt too wide) in paragraph at lines 1900--1902
[][]                  \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 subst old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]last$\O
T1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF xs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 EntryPath[]butlast[]less[]last$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.25847pt too wide) in paragraph at lines 1932--1934
[][]                  \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 subst old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]last$\O
T1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF xs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 EntryPath[]butlast[]less[]last$\OT1/cmr/m/n/10 )$[] 
[75] [76]
Overfull \hbox (29.05797pt too wide) in paragraph at lines 2109--2111
[][]            \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 rule nec-es-saryPhiI$\OT1/cmr/m/n/10 [$\T1/cmr/bx/n/10 where \T1/
cmr/m/it/10 v$\OT1/cmr/m/n/10 =$\T1/cmr/m/it/10 var g p$\OT1/cmr/m/n/10 ]$$\OML
/cmm/m/it/10 ;$ \T1/cmr/m/it/10 as-sump-tion$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/1
0 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 path2[]def$\OT1/cmr/m/n/10 )$[] 
[77]) (./Construct_SSA.tex [78]
Overfull \hbox (43.21234pt too wide) in paragraph at lines 42--58
[][]  \T1/cmr/bx/n/10 in-stance by \T1/cmr/m/it/10 intro[]classes $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 metis Def$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 distinct$\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 less[]Def[]
def less[]eq[]Def[]def Def$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 exhaust$\OT1/cmr/
m/n/10 )$$+$[] 
[79]
Overfull \hbox (84.53761pt too wide) in paragraph at lines 120--138
[][]  \T1/cmr/bx/n/10 ter-mi-na-tion by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rela
tion mea-sure $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$$\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 g$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 n$\OML/cmm/m/it/10 ;$[]$\OT1/cm
r/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 short-est-Path g n$\OT1/cmr/m/n
/10 )$$)$ $($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 shor
testPath[]predecessor$\OT1/cmr/m/n/10 )$[] 
[80]
Overfull \hbox (23.33815pt too wide) in paragraph at lines 303--307
[][]      \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 i \T1/cmr/bx/n/10 where 
\T1/cmr/m/it/10 n $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 ?ns$ [] $ $\OT1/cmr/m/n/1
0 !$ \T1/cmr/m/it/10 i i $\OML/cmm/m/it/10 <$ \T1/cmr/m/it/10 length ?ns$ [] $ 
\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 in[]set[]conv[]nth$\OT1/cmr/m/n/10 )$[] 
[81]
Overfull \hbox (7.27686pt too wide) in paragraph at lines 445--454
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 proof $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 atomize[]elim$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 
in-duc-tion un ar-bi-trary$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 m rule$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 removeAll[]induct$\OT1/cmr/m/n/10 )$[] 
[82]
Overfull \hbox (33.40263pt too wide) in paragraph at lines 578--582
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 1$\OT1/cmr/m/n/
10 :$ \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 phiDefNodes[]aux g
 v $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n g$\OT1/cmr/m/n/10 )
$ \T1/cmr/m/it/10 m \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$$\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 rule phiDefNodes[]auxI$\OML/cmm/m/it/10 ;$
[83]
Overfull \hbox (19.05038pt too wide) in paragraph at lines 724--726
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule[]tac v$\O
T1/cmr/m/n/10 =$\T1/cmr/m/it/10 v \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 n$\OT1/cm
r/m/n/10 =$\T1/cmr/m/it/10 n \T1/cmr/bx/n/10 in \T1/cmr/m/it/10 lookupDef[]case
s$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$ \T1/cmr/m/i
t/10 assms lookupDef[]cases$\OT1/cmr/m/n/10 )$[] 
[84]
Overfull \hbox (26.32518pt too wide) in paragraph at lines 789--803
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
induction rule$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 lookupDef$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 induct$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 auto elim$\OT1/cmr/
m/n/10 :$\T1/cmr/m/it/10 lookupDefE$\OT1/cmr/m/n/10 )$[] 
[85] [86] [87]
Overfull \hbox (23.9604pt too wide) in paragraph at lines 1363--1367
[][]        \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 snoc$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 3$\OT1/cmr/m/n/10 )$ \T1/cmr/
bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/c
mr/m/it/10 x $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m$ [] $ \T1/cmr/bx/n/10 by $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 tl[]
append split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 list$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 split[]asm$\OT1/cmr/m/n/10 )$[] 
[88]
Overfull \hbox (38.59175pt too wide) in paragraph at lines 1382--1386
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 5$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 v$ [] $ $
\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 phiDefs g m$ [] $ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp
 add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 allDefs[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (26.66702pt too wide) in paragraph at lines 1388--1391
[][]            \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 braun[]ssa$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phiDefs[]def \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 phis$ [] $[]def
 split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 split[]asm

Overfull \hbox (20.4175pt too wide) in paragraph at lines 1447--1450
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it
/10 v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 lookupDef g m $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 var g v$ [] $$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phis$ [] $[
]def split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 split[]asm

Overfull \hbox (10.8281pt too wide) in paragraph at lines 1450--1455
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 var g v $\OT1/c
mr/m/n/10 =$ \T1/cmr/m/it/10 var g v$ [] $ \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/
m/it/10 var[]def \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis lo
okupDef[]fst$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (4.82967pt too wide) in paragraph at lines 1473--1487
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 by $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 !$$:$\T1/cmr/m/it/10 look
upDef[]fst dest$\OT1/cmr/m/n/10 !$$:$\T1/cmr/m/it/10 phiDefNodes[]$\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 n simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phis$ [] $[
]def
[89]
Overfull \hbox (34.70166pt too wide) in paragraph at lines 1526--1529
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 m$ [] $$\OT1/cmr/m/n/10 :$ \T1/cm
r/m/it/10 m$ [] $ $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 phiDefN-odes g $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 var g v$ [] $$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/
10 phis$ [] $[]def split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 split[]asm

Overfull \hbox (1.88747pt too wide) in paragraph at lines 1650--1654
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 lookupDef g m $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \
T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]lookupDef$\OT
1/cmr/m/n/10 )$[] 
[90]
Overfull \hbox (1.88747pt too wide) in paragraph at lines 1686--1690
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 lookupDef g m $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \
T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]lookupDef$\OT
1/cmr/m/n/10 )$[] 

Overfull \hbox (21.67505pt too wide) in paragraph at lines 1718--1719
[][]    \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr
/m/it/10 n$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 ns$\OMS/cmsy/m/n/10 !$\T1/cmr/m
/it/10 m n $[]$ set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 tl ns$\OT1/cmr/m/n/10 )$
 \T1/cmr/m/it/10 v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/i
t/10 :$\T1/cmr/m/it/10 allDefs g n v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun
[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses

Overfull \hbox (22.34937pt too wide) in paragraph at lines 1733--1737
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/
10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 lookupDef g m $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \T1/cmr/bx/n/1
0 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]loo
kupDef$\OML/cmm/m/it/10 ;$

Overfull \hbox (23.36525pt too wide) in paragraph at lines 1789--1796
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 defs$ [] $[]def phis$ [] $[]def allDefs[]var[]disjo
int[]aux split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 splits if[]split[]asm$\OT1/cmr/m/n/10 )$[] 
[91] [92] [93]
Overfull \hbox (34.34283pt too wide) in paragraph at lines 2120--2134
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 by $\OMS/cms
y/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule braun[]ssa$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 defNode[]eq$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule assms
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 ;$ \T1
/cmr/m/it/10 subst braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]def$\
OML/cmm/m/it/10 ;$
[94]
Overfull \hbox (24.90512pt too wide) in paragraph at lines 2237--2239
[][]            \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst bra
un[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiArg[]def$\OML/cmm/m/it/10 ;$ \T1/
cmr/m/it/10 subst braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]def$\OML/c
mm/m/it/10 ;$ \T1/cmr/m/it/10 subst PhiDef[]defNode[]eq$\OML/cmm/m/it/10 ;$

Overfull \hbox (13.43826pt too wide) in paragraph at lines 2312--2319
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto split$\OT1/cmr
/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 splits if[]sp
lit[]asm simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phiDefNodes[]def elim$\OT1/
cmr/m/n/10 !$$:$\T1/cmr/m/it/10 fold[]union[]elem
) (./Construct_SSA_notriv.tex [95]
Overfull \hbox (0.50066pt too wide) in paragraph at lines 61--62
[][]  $\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base $
\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in-v
ar in-Edges$ [] $ En-try old-Defs oldUses
[96] [97] [98]
Overfull \hbox (19.0183pt too wide) in paragraph at lines 335--337
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 sub-sti-tu-tion$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 re-dun-dant g $\OT1/
cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 isTriv-ial-Phi g $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 chooseNext g$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 subst
itution
[99]
Overfull \hbox (19.05222pt too wide) in paragraph at lines 453--455
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp only$\OT
1/cmr/m/n/10 :$\T1/cmr/m/it/10 n[]defNode v$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2
$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule trivialPhi[]strict
[]dom$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m
/it/10 substNext[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.92926pt too wide) in paragraph at lines 455--460
[][]      \T1/cmr/bx/n/10 more-over from \T1/cmr/m/it/10 v$\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 old$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?n$ [] $ n \T1/cmr/bx/n/10 by $\OMS
/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUses[]dominated$\O
ML/cmm/m/it/10 ;$
[100] [101] [102]
Overfull \hbox (42.34743pt too wide) in paragraph at lines 837--839
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$ \T1/cmr/m/it/10 simpleDefs[]phiDefs[]disjoint$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 unfolded CFG[]SSA[]defs$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$
\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]defs

Overfull \hbox (31.50557pt too wide) in paragraph at lines 901--914
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$\T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]def
 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiDefs[]def phiDefs[]def allDefs[]def
 split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 if[]split[]asm$\OT1/cmr/m/n/10 )$[] 
[103]
Overfull \hbox (36.68791pt too wide) in paragraph at lines 1066--1068
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$\T1/cmr/m/it/10 allUses[]def[]ass$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/1
0 unfolded CFG[]SSA[]defs$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 sim-pli-fied$\OT1
/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA
[]defs$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (13.66513pt too wide) in paragraph at lines 1086--1088
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 chooseNext[]eliminated$\OT1/cmr/m/n
/10 :$ \T1/cmr/m/it/10 chooseNext g $[]$ step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 allDefs g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 defNode g $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 chooseNext
[104]
Overfull \hbox (1.65211pt too wide) in paragraph at lines 1229--1233
[][]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 ?n$[][]$ $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 n hd ns $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 n \T1/cmr/bx/n/10 u
s-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10
 )$ \T1/cmr/m/it/10 ns$[][]$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 ns old$\OML/cmm/m/it/10 :$\T1/c
mr/m/it/10 path2[]def$\OT1/cmr/m/n/10 )$[] 
[105]
Overfull \hbox (16.59686pt too wide) in paragraph at lines 1279--1283
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 asm ns$[][]$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?n$[][
]$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 last ns$[][]$$\OT1/cmr/m/n/10 )$ \T1/cmr/
bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUs
es[]dominated$\OML/cmm/m/it/10 ;$

Overfull \hbox (18.9609pt too wide) in paragraph at lines 1283--1288
[][]          \T1/cmr/bx/n/10 more-over have \T1/cmr/m/it/10 strict[]def[]dom g
 v v$[][]$ \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 triv \T1/cmr/bx/n/10 by $\OMS
/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule trivialPhi[]strict[]d
om$\OML/cmm/m/it/10 ;$

Overfull \hbox (22.83139pt too wide) in paragraph at lines 1340--1343
[][]              \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 u
s-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 6$\OT1/cmr/m/n/10
 )$ []\T1/cmr/m/it/10 v$[][]$ $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 chooseNext g[
] simpleDefs[]phiDefs[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of
[106] [107]
Overfull \hbox (31.96979pt too wide) in paragraph at lines 1467--1472
[][]              \T1/cmr/bx/n/10 ul-ti-mately show \T1/cmr/m/it/10 ?the-sis \T
1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 6$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 vs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 rule allDefs[]var[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of

Overfull \hbox (0.34885pt too wide) in paragraph at lines 1581--1583
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv
$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv $\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n

Overfull \hbox (27.16942pt too wide) in paragraph at lines 1607--1609
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$\T1/cmr/m/it/10 conventional$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 unf
olded CFG[]SSA[]defs$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 sim-pli-fied$\OT1/cmr/
m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]def
s$\OT1/cmr/m/n/10 )$[] 
[108] [109] [110]
Overfull \hbox (20.39001pt too wide) in paragraph at lines 1955--1963
[][]    \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 allVars[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]
def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses[]def uninst$\OML/cmm/m/it
/10 :$\T1/cmr/m/it/10 phiDefs[]def
[111]
Overfull \hbox (1.66362pt too wide) in paragraph at lines 2071--2075
[][]    \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?the-sis \T1/cmr/bx/n/10 us-ing \T
1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 step[]CFG[]SSA[]Transform
ed[]notriv$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simplified$\OT1/cmr/m/n/10 ]$ \T1/
cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp
[112] [113]
Overfull \hbox (9.83093pt too wide) in paragraph at lines 2226--2230
[][]      \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m
/it/10 set $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n g$\OT1/cmr/
m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 defs g n $\OMS/cmsy/m/n/10 \$
 \T1/cmr/m/it/10 uses$ [] $[]all g n $\OT1/cmr/m/n/10 =$ $\OMS/cmsy/m/n/10 f$$g
$ \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 d
efs[]uses[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of

Overfull \hbox (26.728pt too wide) in paragraph at lines 2303--2305
[][]    \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 :$ $[]$\T1/cmr/m
/it/10 u p$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 redundant $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u g$\OT1/cmr/m/n/10 )$$)$
 $($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$
$=$\T1/cmr/m/it/10 p g$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/1
0  []!$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant
[114]
Overfull \hbox (18.20131pt too wide) in paragraph at lines 2309--2311
[][]      \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule sub-stAll$
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$[$\T1/cmr/bx/n/10 where 
\T1/cmr/m/it/10 Q$\OT1/cmr/m/n/10 =$$\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 u p$\
OML/cmm/m/it/10 :$ $\OMS/cmsy/m/n/10 :$\T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 redundant $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u$\OT1/cmr/m/n/10
 )$$)$ $($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n
/10 :$$=$\T1/cmr/m/it/10 p$\OT1/cmr/m/n/10 )$$)$

Overfull \hbox (10.06143pt too wide) in paragraph at lines 2394--2396
[][]    \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 :$ $[]$\T1/cmr/m
/it/10 u u$ [] $ p p$ [] $ g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 pruned $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u$ [] $$\
OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u g$\OT
1/cmr/m/n/10 )$$)$ $($\T1/cmr/m/it/10 p$ [] $$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 p g$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/
10 g $\OMS/cmsy/m/n/10  []!$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 pruned

Overfull \hbox (11.27089pt too wide) in paragraph at lines 2402--2404
[][]    \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 rule sub-stAll$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$[$\
T1/cmr/bx/n/10 where \T1/cmr/m/it/10 P$\OT1/cmr/m/n/10 =$$\OML/cmm/m/it/10 ^^U$
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 p$\OT1/
cmr/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1
/cmr/m/it/10 pruned $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u$\OT1/cmr/m/n/10 )$$)$ $
($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=
$\T1/cmr/m/it/10 p$\OT1/cmr/m/n/10 )$$)$
[115]) (./SSA_Semantics.tex [116]
Overfull \hbox (7.19157pt too wide) in paragraph at lines 171--175
[][]      \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 empty$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 n \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 n $\OT1/cmr/m/n/10 =$ \T1/cmr/m/i
t/10 En-try g \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 cases ms$\O
ML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto dest$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 
old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]hd$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (7.21399pt too wide) in paragraph at lines 198--202
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 snoc$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 hyps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/
10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 6\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 En-try g \T1/cmr/
bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 Entry[]no[]predecessor$\OT1/cmr/m/n/10 )$[] 
[117]
Overfull \hbox (3.32082pt too wide) in paragraph at lines 249--252
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 ns$ [] $ \T1/cmr/bx/n/10 hav
e \T1/cmr/m/it/10 bns$ [] $$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 g $\OMS/cmsy/m/n
/10 `$ \T1/cmr/m/it/10 En-try g$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 butlast ns
$ [] $$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 ?n$ [] $$ [] $ ?n$ [] $$ [] $ $\OMS/c
msy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 old$\OML/c
mm/m/it/10 :$\T1/cmr/m/it/10 predecessors
[118]) (./While_Combinator_Exts.tex [119] [120]) (./SSA_CFG_code.tex)
(./Construct_SSA_code.tex) (./Construct_SSA_notriv_code.tex
Overfull \hbox (5.98059pt too wide) in paragraph at lines 34--36
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 substNext[]code g next $\OMS/cmsy/m/n/10 ^^Q
$ $\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 i
f v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 snd next then substitution[]code
[121] [122]
Overfull \hbox (11.98946pt too wide) in paragraph at lines 107--108
[][]    \T1/cmr/m/it/10 fold $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$\T1/cmr/m
/it/10 n$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 update n $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 List$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 map $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 id$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 snd next $\OT1/cmr/m/n/10 :$$=$ \T1/cmr/m/it/10 next$ [] $$\OT1/cmr
/m/n/10 )$$)$ $($\T1/cmr/m/it/10 the $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup

Overfull \hbox (12.97588pt too wide) in paragraph at lines 108--109
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 sorted[]list[]of[]set $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n
/10 )$ $($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nod
es[]of[]phis

Overfull \hbox (4.0448pt too wide) in paragraph at lines 114--115
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 let old[]phis $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ \T1/cmr/m/it/10 id 
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 l
ookup nodes[]of[]phis

Overfull \hbox (13.59372pt too wide) in paragraph at lines 125--127
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 step[]codem g next next$ [] $ nodes[]of[]use
s nodes[]of[]phis $\OT1/cmr/m/n/10 =$ $($\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (6.30238pt too wide) in paragraph at lines 134--136
[][]\T1/cmr/bx/n/10 locale \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linor
der $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base
[123] [124]
Overfull \hbox (11.81181pt too wide) in paragraph at lines 342--343
[][]$\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linorder
 $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in
-var in-Edges$ [] $ En-try old-Defs oldUses
[125]
Overfull \hbox (0.95255pt too wide) in paragraph at lines 367--368
\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 var $\OML/cmm/m/it/10 ^^U$\T1/cmr/
m/it/10 uses phis$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 chooseNext[]all uses $\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mappi
ng

Overfull \hbox (104.92482pt too wide) in paragraph at lines 453--455
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 redundant[]ign$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]cod
e $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10
 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code

Overfull \hbox (21.5668pt too wide) in paragraph at lines 455--463
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code[]def 
uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 trivial[]code[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/
m/n/10 ]$
[126]
Overfull \hbox (24.16965pt too wide) in paragraph at lines 475--477
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 uses$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 const u$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/
10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (90.55998pt too wide) in paragraph at lines 477--485
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 uses$ [] $[]codem[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs
[]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it
/10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution
[]code[]def

Overfull \hbox (5.11174pt too wide) in paragraph at lines 496--498
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/1
0 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code

Overfull \hbox (81.61777pt too wide) in paragraph at lines 498--506
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]code[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[
]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[
]code[]def

Overfull \hbox (29.6548pt too wide) in paragraph at lines 518--520
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $m[]ign$\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it
/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem

Overfull \hbox (89.79355pt too wide) in paragraph at lines 520--528
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]codem[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs
[]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it
/10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution
[]code[]def

Overfull \hbox (0.9442pt too wide) in paragraph at lines 581--583
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 Mapping[]lookup[]map[]values Mapping[]lookup[]map O
p-tion$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 bind[]def
[127]
Overfull \hbox (6.7089pt too wide) in paragraph at lines 589--591
[][]      \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 phis$ [] $[]codem[]def mm
ap[]def ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup[]phiNodes[]of $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 OF ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis[]finite$
\OT1/cmr/m/n/10 ]$

Overfull \hbox (18.40192pt too wide) in paragraph at lines 646--648
[][]  \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 clarsimp simp$\
OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 mmap[]def Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 replace[]def $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/m/n/
10 ]$ \T1/cmr/m/it/10 phi[]equiv[]mapping[]def

Overfull \hbox (25.52013pt too wide) in paragraph at lines 662--664
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/
m/n/10 :$ \T1/cmr/m/it/10 map[]of[]map[]restrict restrict[]map[]def substNext[]
code[]def fold[]update[]conv

Overfull \hbox (51.08165pt too wide) in paragraph at lines 673--675
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]ign$\OT1/cmr/m/n/10 [$\T1/cmr
/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 step[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const u$\OT
1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 step[]codem

Overfull \hbox (6.25371pt too wide) in paragraph at lines 693--706
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 rel[]fun[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 pcr[]cr[]eq cr[]mapping[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 rep[]inverse$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (15.82213pt too wide) in paragraph at lines 711--724
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 rel[]fun[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 pcr[]cr[]eq cr[]mapping[]def Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 lookup$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 rep[]eq$\OT1/cmr/m/n/10 )$[] 
[128]
Overfull \hbox (8.04977pt too wide) in paragraph at lines 771--772
[][]  \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m
/it/10 nodes[]of[]phis $\OMS/cmsy/m/n/10 ^^Y$$[][]$ \T1/cmr/m/it/10 ssa$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of g \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 
Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis

Overfull \hbox (7.95027pt too wide) in paragraph at lines 819--820
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [] $[]codem g next $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ \T
1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$

Overfull \hbox (46.09499pt too wide) in paragraph at lines 838--840
[][]      \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT
1/cmr/m/n/10 !$$:$ \T1/cmr/m/it/10 map[]idI $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 
symmetric$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/
it/10 Mapping[]lookup[]map[]values substNext[]code[]def
[129]
Overfull \hbox (40.8658pt too wide) in paragraph at lines 876--877
[][]    \T1/cmr/m/it/10 Some $\OT1/cmr/m/n/10 ($$($\T1/cmr/m/it/10 case[]option
 $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Set$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 substitution[]code

Overfull \hbox (16.56137pt too wide) in paragraph at lines 928--935
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 Mapping[]lookup[]map[]values bind[]eq[]None[]conv m
ap[]conv[]bind[]option
[130]
Overfull \hbox (33.3333pt too wide) in paragraph at lines 1041--1043
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]phis$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [
] $[]codem g next next$ [] $ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (15.79576pt too wide) in paragraph at lines 1065--1074
[][]    \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 un-fold-in
g \T1/cmr/m/it/10 phis$ [] $[]codem[]def phi[]equiv[]mapping[]def ssa$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 keys[]phidefNodes

Overfull \hbox (33.62422pt too wide) in paragraph at lines 1074--1081
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 force split$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 op-tion$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 splits i
f[]splits simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 fold[]update[]conv fun[]upd[]
apply keys[]dom[]lookup

Overfull \hbox (31.08868pt too wide) in paragraph at lines 1087--1088
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis
[131]
Overfull \hbox (59.96251pt too wide) in paragraph at lines 1137--1139
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OMS/cmsy/m/n/10  []!$ $\OML/cmm/m/it/10 '$ $\OMS/cmsy/m/
n/10 2$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (16.53975pt too wide) in paragraph at lines 1157--1159
[][]      \T1/cmr/bx/n/10 hence $\OML/cmm/m/it/10 '$ $[]$ \T1/cmr/m/it/10 unins
t[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 phis$ [] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst
itution[]code
[132]
Overfull \hbox (8.66772pt too wide) in paragraph at lines 1263--1266
\T1/cmr/m/it/10 next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g ne
xt$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$$)$ \T1
/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]ph
is
[133] [134]
Overfull \hbox (23.4298pt too wide) in paragraph at lines 1423--1425
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subgoal[]tac 
fi-nite $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 dom $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr
/m/it/10 phis$ [] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substituti
on[]code
[135] [136] [137]
Overfull \hbox (15.5058pt too wide) in paragraph at lines 1671--1673
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subgoal[]tac 
$\OMS/cmsy/m/n/10 f$\T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 phis g$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 snd next $\OMS/c
msy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 the $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
[138]
Overfull \hbox (6.85002pt too wide) in paragraph at lines 1767--1769
[][]      \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\
OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 keys[]dom[]lookup dest$\OT1/cmr/m/n/10 :$ \T1
/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 force dest$\OT1/
cmr/m/n/10 :$ \T1/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 )$$[$\T1/cmr/m/it/
10 1$\OT1/cmr/m/n/10 ]$[] 

Overfull \hbox (4.29509pt too wide) in paragraph at lines 1805--1807
[][]     \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\O
T1/cmr/m/n/10 :$ \T1/cmr/m/it/10 keys[]dom[]lookup dest$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 force dest$\OT1/c
mr/m/n/10 :$ \T1/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 )$$[$\T1/cmr/m/it/1
0 1$\OT1/cmr/m/n/10 ]$[] 

Overfull \hbox (40.67703pt too wide) in paragraph at lines 1837--1838
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 nodes[]of[]uses$ [] $ g next $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phidefNodes
[139] [140]
Overfull \hbox (7.31837pt too wide) in paragraph at lines 1968--1970
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst uses$ [
] $[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$\O
ML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 un-folded substitution[]code[]def$\OT1/cmr/m/
n/10 ]$$)$[] 
[141] [142]
Overfull \hbox (15.93558pt too wide) in paragraph at lines 2099--2101
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]uses$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$ [
] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (10.88066pt too wide) in paragraph at lines 2190--2198
[][]    \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of[]def u
ninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 phis[]addN[]def $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/m/n
/10 ]$
[143]
Overfull \hbox (38.43755pt too wide) in paragraph at lines 2248--2249
[][]        $\OMS/cmsy/m/n/10 ^$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const 
p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g nodes[]of[]uses $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 useNodes[]of

Overfull \hbox (36.90468pt too wide) in paragraph at lines 2249--2250
[][]        $\OMS/cmsy/m/n/10 ^$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const 
p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g phis[]of[]nodes $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (0.1367pt too wide) in paragraph at lines 2267--2270
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 s1[]uses s1[]phis s1[]triv
[]phis s1[]nodes[]of[]uses s1[]phi[]nodes[]of \T1/cmr/bx/n/10 where[] 

Overfull \hbox (2.51563pt too wide) in paragraph at lines 2275--2276
[][]      \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 nou[]equiv$\OT1/cmr/m/n/10 :$ \T1
/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mappin
g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/
m/it/10 g s1[]nodes[]of[]uses

Overfull \hbox (13.4409pt too wide) in paragraph at lines 2279--2283
\T1/cmr/m/it/10 in-var in-Edges$ [] $ En-try old-Defs oldUses defs u[]g g s1[]u
ses p[]g g s1[]phis var chooseNext[]all
[144]
Overfull \hbox (9.79211pt too wide) in paragraph at lines 2332--2334
[][]      \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 Max $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 CFG[]SSA[]wf[]base[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phi
s $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 p[]g g s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr
/m/it/10 g$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 chooseNext[]all

Overfull \hbox (44.5052pt too wide) in paragraph at lines 2351--2353
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 useNodes[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 const s1[]uses$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 useNodes[]of

Overfull \hbox (42.2059pt too wide) in paragraph at lines 2360--2362
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of
[145]
Overfull \hbox (69.22342pt too wide) in paragraph at lines 2376--2378
[][]      \T1/cmr/bx/n/10 hence $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cm
r/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 
phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/
m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping

Overfull \hbox (41.23457pt too wide) in paragraph at lines 2401--2403
[][]       \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst i$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem[]correct $\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 symmetric$\OML/cmm/m/it/10 ;$ \T1/cmr/bx/n/10 where \T1/cmr/m/i
t/10 nodes[]of[]uses$\OT1/cmr/m/n/10 =$\T1/cmr/m/it/10 s1[]nodes[]of[]uses$\OT1
/cmr/m/n/10 ]$$)$[] 

Overfull \hbox (50.05571pt too wide) in paragraph at lines 2427--2429
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
ubstitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/
n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code
[146]
Overfull \hbox (24.47787pt too wide) in paragraph at lines 2439--2441
[][]      \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 step[]s2$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 step g ?s2 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]prod us-esOf Ma
p-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 step[]codem

Overfull \hbox (112.73097pt too wide) in paragraph at lines 2453--2455
[][]       \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 clarsimp s
imp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 substNext[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]def CF
G[]SSA[]wf[]base$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]wf[]defs$\OT1/cmr
/m/n/10 )$[] 

Overfull \hbox (3.0547pt too wide) in paragraph at lines 2463--2464
[][]          $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 p g $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g 
?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 substitution[]code

Overfull \hbox (34.56685pt too wide) in paragraph at lines 2464--2466
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT
1/cmr/m/n/10 :$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $
[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF phi[]equiv[]mapping[]ref
l$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$
 [] $[]codem[]correct

Overfull \hbox (26.06744pt too wide) in paragraph at lines 2469--2470
[][]        \T1/cmr/m/it/10 us-esOf $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]
code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 u g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$
)$ \T1/cmr/m/it/10 g ?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (41.51004pt too wide) in paragraph at lines 2470--2471
[][]          $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 us-esOf $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem
 $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst 
s1$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g ?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (36.09972pt too wide) in paragraph at lines 2471--2473
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT
1/cmr/m/n/10 :$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $
[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF phi[]equiv[]mapping[]ref
l$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$
 [] $[]codem[]correct

Overfull \hbox (4.87158pt too wide) in paragraph at lines 2474--2476
[][]      \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 step[]s2$\OT1/cmr/m/n/10 [$\T1/c
mr/m/it/10 symmetric$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :
$\T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv []Mapping$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 keys
[147]
Overfull \hbox (51.64523pt too wide) in paragraph at lines 2481--2482
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/1
0 )$$)$$)$ \T1/cmr/m/it/10 g ?next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 s1[]nodes
[]of[]uses s1[]phi[]nodes[]of$\OT1/cmr/m/n/10 )$$)$[] 

Overfull \hbox (51.64523pt too wide) in paragraph at lines 2482--2483
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/1
0 )$$)$$)$ \T1/cmr/m/it/10 g ?next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 s1[]nodes
[]of[]uses s1[]phi[]nodes[]of$\OT1/cmr/m/n/10 )$$)$[] 

Overfull \hbox (31.1545pt too wide) in paragraph at lines 2515--2517
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 p[]g g s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (90.91887pt too wide) in paragraph at lines 2540--2541
[][]      $[]$\T1/cmr/m/it/10 m1 m2$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst[
]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g m1 m2 $\OT
1/cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping
[148]
Overfull \hbox (1.76341pt too wide) in paragraph at lines 2607--2608
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$$)$ \T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 
)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substi
tution[]code

Overfull \hbox (1.76341pt too wide) in paragraph at lines 2608--2609
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$$)$ \T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 
)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substi
tution[]code
[149]
Overfull \hbox (4.99088pt too wide) in paragraph at lines 2612--2613
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lo
okup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis g$\OT1/cmr/m/n/10 )$$)$$)$ $($\T1/
cmr/m/it/10 fst $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 snd s1$\OT1/cmr/m/n/10 )$$)$$)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 useNod
es[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const
) (./Disjoin_Transform.tex
Overfull \hbox (14.60175pt too wide) in paragraph at lines 37--38
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxVnameLen[]aux $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 e1 \T1/cmr/m/n/10 ^^S [] ^^T \T1/cmr/m/it/10 e2$\OT1/cmr/m/n/10 )
$ $=$ \T1/cmr/m/it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux e
1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 maxVnameLen[]aux
[150]
Overfull \hbox (20.5284pt too wide) in paragraph at lines 44--45
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxV-name-Len $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 if $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 b$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 c$[][]$ else c$[][]$$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 max $\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen c$[][]$$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/
it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (21.12737pt too wide) in paragraph at lines 96--109
[][]\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule maxVnameLen[]new
name$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/
m/it/10 tempName[]def String$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 literal$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 STR[]inverse
[151]
Overfull \hbox (37.53712pt too wide) in paragraph at lines 224--226
[][]  \T1/cmr/bx/n/10 proof $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 cases $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 transform[]aux temp c1$\OT1/cmr/m/n/10 ;$$;$ \T1/cmr/m
/it/10 transform[]aux temp c2$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 V$\OT1/cmr/
m/n/10 :$$=$\T1/cmr/m/it/10 e$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 rule$\OT1/cmr/
m/n/10 :$\T1/cmr/m/it/10 subcmd$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 cases$\OT1/c
mr/m/n/10 )$[] 

Overfull \hbox (10.09949pt too wide) in paragraph at lines 273--277
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 5$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 prems \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?case \T1/cmr/bx/n/10 by $\OMS/cmsy
/m/n/10 ^^@$$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule 5$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 IH$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto elim$\OT1/cmr/m/n/10 :$\T
1/cmr/m/it/10 subcmd$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 cases new-name$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 cases$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (18.42184pt too wide) in paragraph at lines 305--307
[][]\T1/cmr/bx/n/10 corollary \T1/cmr/m/it/10 Defs[]Uses[]transform[]disjoint $
\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 De
fs $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 transform c$\OT1/cmr/m/n/10 )$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10 Uses $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 transform
)) (./root.bbl [152]) [153] (./root.aux)

LaTeX Warning: There were undefined references.


LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right.

 )
(see the transcript file for additional information){/usr/share/texmf/fonts/enc
/dvips/cm-super/cm-super-t1.enc}</usr/share/texlive/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmex10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/ams
fonts/cm/cmmi10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr1
0.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></usr/shar
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texl
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb></usr/share/texlive/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/texmf-dist
/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texmf/fonts/type1/public/
cm-super/sfbx1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1095.pf
b></usr/share/texmf/fonts/type1/public/cm-super/sfbx1200.pfb></usr/share/texmf/
fonts/type1/public/cm-super/sfbx1440.pfb></usr/share/texmf/fonts/type1/public/c
m-super/sfrm1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfrm1095.pfb
></usr/share/texmf/fonts/type1/public/cm-super/sfrm1200.pfb></usr/share/texmf/f
onts/type1/public/cm-super/sfrm1728.pfb></usr/share/texmf/fonts/type1/public/cm
-super/sfti1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfti1095.pfb>

Output written on root.pdf (153 pages, 690782 bytes).
Transcript written on root.log.
This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) (preloaded format=pdflatex)
 restricted \write18 enabled.
entering extended mode
LaTeX2e <2014/05/01>
Babel <3.9l> and hyphenation patterns for 79 languages loaded.

(./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2014/09/29 v1.4h Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo))
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def))
(/usr/share/texlive/texmf-dist/tex/latex/quotmark/quotmark.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
For additional information on amsmath, use the `?' option.
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty))
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def
(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty)
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg)
(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty)
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty))))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t
ex)) (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de
f)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code.
tex)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet
ric.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod
e.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.
tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerari
thmetics.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct.
code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code
.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation
s.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t
ex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code.
tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te
x)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c
ode.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code.
tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex
) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex
)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65
.sty)
(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18
.sty)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty
(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex))
(/usr/share/texlive/texmf-dist/tex/latex/pgf/math/pgfmath.sty
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex

(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers
.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex
)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarytopaths.code.tex)))
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarypositioning.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibrarycalc.code.tex)
(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik
zlibraryarrows.code.tex
(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code.
tex)) (./isabelle.sty (./comment.sty Excluding comment 'comment')
Including comment 'isadelimtheory' Including comment 'isatagtheory'
Including comment 'isadelimproof' Including comment 'isatagproof'
Including comment 'isadelimML' Including comment 'isatagML'
Including comment 'isadelimvisible' Including comment 'isatagvisible'
Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible')
(./isabelletags.sty) (./isabellesym.sty)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty))
(./pdfsetup.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty))
(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty)
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty)
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg)

Package hyperref Warning: Option `pagecolor' is not available anymore.

(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty))

Package hyperref Message: Driver (autodetected): hpdftex.

(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty))
(./root.aux) ABD: EveryShipout initializing macros
(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty
(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty)
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg))
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty))
(./root.out) (./root.out)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd)
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) (./root.toc [1{/var/
lib/texmf/fonts/map/pdftex/updmap/pdftex.map}]) (./session.tex (./Sublist.tex)
(./RBT_Set.tex) (./Mapping.tex) (./RBT_Mapping.tex) (./Char_ord.tex)
(./List_lexord.tex) (./Com.tex) (./AuxLemmas.tex) (./BasicDefs.tex) (./WCFG.tex
) (./CFG.tex) (./CFGExit.tex) (./Interpretation.tex) (./Labels.tex)
(./CFG_wf.tex) (./CFGExit_wf.tex) (./Observable.tex) (./Distance.tex)
(./DynDataDependence.tex) (./DataDependence.tex) (./SemanticsCFG.tex)
(./Slice.tex) (./Postdomination.tex) (./DynStandardControlDependence.tex)
(./StandardControlDependence.tex) (./DynWeakControlDependence.tex)
(./WeakControlDependence.tex) (./PDG.tex) (./WeakOrderDependence.tex)
(./CDepInstantiations.tex) (./WellFormed.tex) (./AdditionalLemmas.tex)
(./Graph.tex) (./GraphSpec.tex) (./FormalSSA_Misc.tex
Overfull \hbox (5.79439pt too wide) in paragraph at lines 31--44
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis One[]nat[]def
 ap-pend$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 append[]butlast[]last[]id diff[]Suc[]
Suc diff[]zero

Overfull \hbox (8.44907pt too wide) in paragraph at lines 73--86
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id append[]is[]Nil[]conv list$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dist
inct$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 ro-
tate1$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 2$\OT1/cmr/m/n/10 )$

Overfull \hbox (10.182pt too wide) in paragraph at lines 148--161
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id append[]is[]Nil[]conv assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\O
T1/cmr/m/n/10 )$ \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1
/cmr/m/n/10 )$ \T1/cmr/m/it/10 last[]appendR
[2]
Overfull \hbox (2.92094pt too wide) in paragraph at lines 218--233
[][]\T1/cmr/bx/n/10 using \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 un-fold-ing \T1
/cmr/m/it/10 append[]butlast[]last[]id$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 symmet
ric$\OT1/cmr/m/n/10 ]$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 au
to simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 less[]le

Overfull \hbox (3.62933pt too wide) in paragraph at lines 292--305
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis One[]nat[]def
 diff[]Suc[]Suc last[]in[]set last[]tl length[]tl less[]numeral[]extra$\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 )$

Overfull \hbox (15.09085pt too wide) in paragraph at lines 378--385
[][]\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis Sup[]empty Sup[
]insert Sup[]set[]fold Un[]insert[]right UnionI ccpo[]Sup[]singleton
[3] [4]
Overfull \hbox (1.54424pt too wide) in paragraph at lines 587--591
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 ob-tain \T1/cmr/m/it/10 i \T1/cmr/bx/n
/10 where \T1/cmr/m/it/10 y $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 ys $\OT1/cmr/m/
n/10 !$ \T1/cmr/m/it/10 i i $\OML/cmm/m/it/10 <$ \T1/cmr/m/it/10 length ys \T1/
cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis in[]set[]conv[]nth$\OT1
/cmr/m/n/10 )$[] 
[5]
Overfull \hbox (35.85776pt too wide) in paragraph at lines 827--840
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id but-last$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 
($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 distinct[]append inf[]bo
t[]right inf[]commute

Overfull \hbox (55.55222pt too wide) in paragraph at lines 899--912
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis but-last$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/c
mr/m/n/10 )$ \T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 str
ict[]iff[]order hd[]Cons[]tl hd[]in[]set length[]greater[]0[]conv
[6]
Overfull \hbox (26.80919pt too wide) in paragraph at lines 1070--1072
[][] \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 Min$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 infinite Min[]in Min[]singleton all[]not[]in[]co
nv finite[]subset

Overfull \hbox (30.42868pt too wide) in paragraph at lines 1092--1094
[][] \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 Max$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 infinite Max[]in Max[]singleton all[]not[]in[]co
nv finite[]subset
[7]) (./Serial_Rel.tex
Overfull \hbox (3.40428pt too wide) in paragraph at lines 41--43
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 iterated[]serial[]on[]linear$\OT1/cmr
/m/n/10 :$ \T1/cmr/m/it/10 iterated[]serial[]on A r x $\OT1/cmr/m/n/10 ($\T1/cm
r/m/it/10 n$\OT1/cmr/m/n/10 +$\T1/cmr/m/it/10 m$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/
m/it/10 iterated[]serial[]on
[8]
Overfull \hbox (4.2211pt too wide) in paragraph at lines 158--163
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 a \T1/cmr/bx/n/10 have \T1/cmr/m/it/
10 range ?f $\OMS/cmsy/m/n/10 ^^R$ \T1/cmr/m/it/10 A \T1/cmr/bx/n/10 us-ing \T1
/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/c
mr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$
 \T1/cmr/m/it/10 iterated[]serial[]on[]in[]A$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (11.0342pt too wide) in paragraph at lines 171--173
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis $\OT1/cmr/m
/n/10 ($\T1/cmr/m/it/10 mono[]tags$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 lift-ing
$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 finite[]nat[]set[]iff[]bounded mem[]Collect
[]eq not[]less[]eq$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.78395pt too wide) in paragraph at lines 181--183
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule iterated[]se
rial[]on[]in[]power$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 
($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 r
ule iterated[]serial[]on[]in[]A$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF
) (./Mapping_Exts.tex [9]
Overfull \hbox (30.45937pt too wide) in paragraph at lines 137--153
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]Mapping[]lookup $\OT1/cmr/m/
n/10 [$\T1/cmr/m/it/10 simp$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 code[]unfold$\O
T1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 Mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 lookup

Overfull \hbox (6.28238pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 Mapping[]lookup[]map$\OT1/cmr/m/n/10 
:$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map f g m$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 a $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]o
ption
[10]
Overfull \hbox (6.899pt too wide) in paragraph at lines 289--291
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]eq[]iff$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 m1 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m2 $\OMS/cmsy/m/n/10  []!
$ $\OT1/cmr/m/n/10 ($$\OMS/cmsy/m/n/10 8 $\T1/cmr/m/it/10 k$\OML/cmm/m/it/10 :$
 \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup m1 k $\OT1/
cmr/m/n/10 =$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 looku
p

Overfull \hbox (5.08723pt too wide) in paragraph at lines 343--345
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 map[]default[]eq$\OT1/cmr/m/n/10 :$ \
T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 map[]default k v f m
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m $\OMS/cmsy/m/n/10  []!$ $\OT1/cmr/m/n/10
 ($$\OMS/cmsy/m/n/10 9 $\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 M
ap-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
) (./RBT_Mapping_Exts.tex [11] [12]
Overfull \hbox (38.83908pt too wide) in paragraph at lines 176--189
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/
m/n/10 :$ \T1/cmr/m/it/10 RBT[]Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Set[]def 
RBT$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys[]def[]alt RBT$\OML/cmm/m/it/10 :$\T
1/cmr/m/it/10 lookup[]in[]tree elim$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 rev[]ima
ge[]eqI$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (45.4871pt too wide) in paragraph at lines 192--194
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mmap[]rbt[]code $\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mmap f $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mapping t$\
OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 Mapping

Overfull \hbox (80.39288pt too wide) in paragraph at lines 211--213
[][]\T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 mapping[]add[]code $\OT1/cmr/m/n/10 [
$\T1/cmr/m/it/10 code$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 mapping[]add $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Ma
pping t1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 RBT[]Mapping$\OML/cmm/m/it/10 :$
\T1/cmr/m/it/10 Mapping
) (./Graph_path.tex [13] [14] [15] [16]
Overfull \hbox (34.3785pt too wide) in paragraph at lines 525--529
[][]    \T1/cmr/bx/n/10 thus \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/i
t/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 predecessors g m$\OT1/cmr/m/n/10 )$
 \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 predecessors[]def \T1/cmr/bx/n/10 
by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis get[]edge[]simps$\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$
[17] [18]
Overfull \hbox (8.362pt too wide) in paragraph at lines 953--955
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 path[]by[]tail$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ $[]$\T1/cmr/m/it/10 path g $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 n$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m
/n/10 #$\T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 )$$;$ \T1/cmr/m/it/10 path g $\OT1/c
mr/m/n/10 ($\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ns$\OT1/c
mr/m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 path g $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 ms$\OT1/cmr/m/n/10 )$
$[]$

Overfull \hbox (20.01353pt too wide) in paragraph at lines 1061--1063
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 elem[]set[]implies[]elem[]tl[]app[]
cons$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/
10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set xs $\OT1/cmr/m/n/10 =[]\OMS/cmsy/
m/n/10 )$ \T1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 tl $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ys$\OT1/cmr/m/n/
10 @$\T1/cmr/m/it/10 y$\OT1/cmr/m/n/10 #$\T1/cmr/m/it/10 xs$\OT1/cmr/m/n/10 )$$
)$[] 
[19] [20] [21] [22] [23]
Overfull \hbox (16.18484pt too wide) in paragraph at lines 1772--1779
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis append[]butla
st[]last[]id dis-tinct$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 simps$\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 distinct1[]rotate hd[]C
ons[]tl path2[]hd
[24] [25] [26]
Overfull \hbox (11.96931pt too wide) in paragraph at lines 2152--2165
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis hd[]Cons[]t
l last[]appendR last[]snoc length[]greater[]0[]conv length[]tl path2[]def
[27]
Overfull \hbox (17.44365pt too wide) in paragraph at lines 2250--2254
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 Entry[]reaches$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OML/cmm/m/it/10 ;$
\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$ \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 Fa
lse \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto elim$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 simple[]path2[]unsnoc$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (6.43822pt too wide) in paragraph at lines 2282--2286
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 Entry[]unreachable$\OT1/cmr/m/n/10
 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10
 )$$]$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 by $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 predecessor
s[]def$\OT1/cmr/m/n/10 )$[] 
[28]
Overfull \hbox (3.79758pt too wide) in paragraph at lines 2496--2500
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 as \T1/cmr/bx/n/10 where \
T1/cmr/m/it/10 pre-fix$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 pre-fix $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 as$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/
m/n/10 ]$$)$ \T1/cmr/m/it/10 ns \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prefix[]split[]first$\OT1/
cmr/m/n/10 )$[] 
[29]
Overfull \hbox (3.79758pt too wide) in paragraph at lines 2552--2556
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 as \T1/cmr/bx/n/10 where \
T1/cmr/m/it/10 pre-fix$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 pre-fix $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 as$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 n$ [] $$\OT1/cmr/
m/n/10 ]$$)$ \T1/cmr/m/it/10 ns \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prefix[]split[]first$\OT1/
cmr/m/n/10 )$[] 
[30] [31] [32] [33]
Overfull \hbox (16.75742pt too wide) in paragraph at lines 3230--3232
[][]      \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 this$\OT1/cmr/m/n/10 [$\T1/cmr/m
/it/10 unfolded shortestPath[]def$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 THEN not[
]less[]Least$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 folded shortestPath[]def$\OML/
cmm/m/it/10 ;$
[34] [35] [36] [37]) (./SSA_CFG.tex [38] [39]
Overfull \hbox (12.80359pt too wide) in paragraph at lines 290--292
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]defs $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 phiDefs[]def allDefs[]def phiUses[]def allUses[]def allVars[]
def
[40] [41] [42] [43]
Overfull \hbox (1.3536pt too wide) in paragraph at lines 829--831
[][]  \T1/cmr/bx/n/10 lem-mas \T1/cmr/m/it/10 CFG[]SSA[]wf[]defs $\OT1/cmr/m/n/
10 =$ \T1/cmr/m/it/10 CFG[]SSA[]defs defNode[]code phi[]def isTrivialPhi[]def
[44] [45] [46] [47] [48]
Overfull \hbox (2.79701pt too wide) in paragraph at lines 1566--1569
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 base$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 hyps base$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 ob-tain \T1/cmr/m/it/10 ns$ []
 $ m \T1/cmr/bx/n/10 where \T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 :$ \T1/cmr/
m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m/it/10 defN-ode g q$\OMS/cmsy/m/n/10 ^^
@$\T1/cmr/m/it/10 ns$ [] $$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 m

Overfull \hbox (1.187pt too wide) in paragraph at lines 1571--1574
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 ns$\OT1/cmr/m/n/10 :$ \T1/cmr/m/i
t/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m/it/10 defN-ode g q$\OMS/cmsy/m/n/10 ^^@$\
T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 defNode g p$\OT1/c
mr/m/n/10 ]$$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 defNode g p length $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 ns$ [] $$\OT1/cmr/m/n/10 @$$[$\T1/cmr/m/it/10 defNode
[49] [50] [51] [52] [53] [54]
Overfull \hbox (2.62746pt too wide) in paragraph at lines 2295--2299
[][]    \T1/cmr/bx/n/10 thus \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 us-ing \T1/c
mr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]$ \T1/cmr/m/it/10 phiArg[]same
[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$$]$
[55] [56]) (./Minimality.tex [57]
Overfull \hbox (7.3134pt too wide) in paragraph at lines 90--95
[][]        \T1/cmr/bx/n/10 ul-ti-mately show \T1/cmr/m/it/10 False \T1/cmr/bx/
n/10 us-ing \T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 THEN bspec$\OT1
/cmr/m/n/10 [$\T1/cmr/bx/n/10 where \T1/cmr/m/it/10 x$\OT1/cmr/m/n/10 =$\T1/cmr
/m/it/10 j$\OT1/cmr/m/n/10 ]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 THEN bspec$\O
T1/cmr/m/n/10 [$\T1/cmr/bx/n/10 where
[58] [59]
Overfull \hbox (40.47578pt too wide) in paragraph at lines 275--280
[][]      \T1/cmr/bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/
m/n/10 ]$$:$ \T1/cmr/m/it/10 var g q $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 var g 
r \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$]
$ \T1/cmr/m/it/10 phiArg[]same[]var$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF
[60] [61] [62] [63]
Overfull \hbox (18.59981pt too wide) in paragraph at lines 728--732
[][]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 isTriv-ial-Phi g p q \T1/cmr/
bx/n/10 us-ing \T1/cmr/m/it/10 vs \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr
/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 isTrivialPhi[]def split$\O
T1/cmr/m/n/10 :$\T1/cmr/m/it/10 option$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 split
$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (50.9754pt too wide) in paragraph at lines 825--827
[][]        \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 1$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 prefix[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it
/10 :$\T1/cmr/m/it/10 strict[]implies[]order prefix[]order$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 dual[]order$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trans[] 
[64]
Overfull \hbox (8.14215pt too wide) in paragraph at lines 848--850
[][]              \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto si
mp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 pat
h2[]def simp del$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 One[]nat[]def dest$\OT1/cmr/
m/n/10 !$$:$\T1/cmr/m/it/10 singleton[]list[]hd[]last$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (7.83286pt too wide) in paragraph at lines 942--946
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms that \T1/cmr/bx/n/10 show \T
1/cmr/m/it/10 ?the-sis \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 au
to simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 unnecessaryPhi[]def necessaryPhi[]de
f
[65] [66] [67]
Overfull \hbox (12.74742pt too wide) in paragraph at lines 1142--1146
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 4 ns$[][]$$\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?the
-sis \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 rule in[]set[]butlastI$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]def$\O
T1/cmr/m/n/10 )$[] 

Overfull \hbox (30.53955pt too wide) in paragraph at lines 1175--1179
[][]              \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 :$ \T
1/cmr/m/it/10 x $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 butlast ns$[][]$$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 us-ing \T1/cmr
/m/it/10 ns$[][]$$ [] $$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 3$\OT1/cmr/m/n/10 )$ 
\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto dest$\OT1/cmr/m/n/10
 :$\T1/cmr/m/it/10 set[]mono[]strict[]prefix$\OT1/cmr/m/n/10 )$[] 
[68] (/usr/share/texlive/texmf-dist/tex/latex/base/omscmr.fd)
Overfull \hbox (92.98157pt too wide) in paragraph at lines 1330--1333
[][]          \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 asm$\OT1/cmr/m/n/10 [$\T1/
cmr/m/it/10 THEN con-junct1$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 asm$\OT1/cmr/m/n
/10 [$\T1/cmr/m/it/10 THEN con-junct2$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 rs \T1
/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule ununnecessaryPhis[]disj
oint[]paths$\OML/cmm/m/it/10 ;$
[69] [70]
Overfull \hbox (0.62141pt too wide) in paragraph at lines 1461--1465
[][]        \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 z$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 z $\OMS/cmsy/m/
n/10 2$ \T1/cmr/m/it/10 set ns$ [] $$ [] $ $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10
 set ms$ [] $$ [] $ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto 
simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 
pathsConverge$ [] $[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (6.07417pt too wide) in paragraph at lines 1500--1502
[][]            \T1/cmr/bx/n/10 proof $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule n
ecessaryPhi[]is[]necessary$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF nec-es-sary$\OT
1/cmr/m/n/10 [$\T1/cmr/m/it/10 simplified rs$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 
symmetric$\OT1/cmr/m/n/10 ]$$]$
[71] [72]
Overfull \hbox (12.2103pt too wide) in paragraph at lines 1681--1685
[]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 dom$\OT1/cmr/m/n/10 :$ \T1/cmr/
m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?R ?S \T1/cmr/bx/n/1
0 us-ing \T1/cmr/m/it/10 5 ss$ [] $ \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 d
ominates[]extend$\OT1/cmr/m/n/10 )$ 
[73] [74]
Overfull \hbox (5.25847pt too wide) in paragraph at lines 1900--1902
[][]                  \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 subst old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]last$\O
T1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF xs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 EntryPath[]butlast[]less[]last$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.25847pt too wide) in paragraph at lines 1932--1934
[][]                  \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 subst old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]last$\O
T1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF xs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$$]$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule old$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 EntryPath[]butlast[]less[]last$\OT1/cmr/m/n/10 )$[] 
[75] [76]
Overfull \hbox (29.05797pt too wide) in paragraph at lines 2109--2111
[][]            \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 rule nec-es-saryPhiI$\OT1/cmr/m/n/10 [$\T1/cmr/bx/n/10 where \T1/
cmr/m/it/10 v$\OT1/cmr/m/n/10 =$\T1/cmr/m/it/10 var g p$\OT1/cmr/m/n/10 ]$$\OML
/cmm/m/it/10 ;$ \T1/cmr/m/it/10 as-sump-tion$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/1
0 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 path2[]def$\OT1/cmr/m/n/10 )$[] 
[77]) (./Construct_SSA.tex [78]
Overfull \hbox (43.21234pt too wide) in paragraph at lines 42--58
[][]  \T1/cmr/bx/n/10 in-stance by \T1/cmr/m/it/10 intro[]classes $\OT1/cmr/m/n
/10 ($\T1/cmr/m/it/10 metis Def$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 distinct$\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 less[]Def[]
def less[]eq[]Def[]def Def$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 exhaust$\OT1/cmr/
m/n/10 )$$+$[] 
[79]
Overfull \hbox (84.53761pt too wide) in paragraph at lines 120--138
[][]  \T1/cmr/bx/n/10 ter-mi-na-tion by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rela
tion mea-sure $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$$\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 g$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 n$\OML/cmm/m/it/10 ;$[]$\OT1/cm
r/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 short-est-Path g n$\OT1/cmr/m/n
/10 )$$)$ $($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 shor
testPath[]predecessor$\OT1/cmr/m/n/10 )$[] 
[80]
Overfull \hbox (23.33815pt too wide) in paragraph at lines 303--307
[][]      \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 i \T1/cmr/bx/n/10 where 
\T1/cmr/m/it/10 n $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 ?ns$ [] $ $\OT1/cmr/m/n/1
0 !$ \T1/cmr/m/it/10 i i $\OML/cmm/m/it/10 <$ \T1/cmr/m/it/10 length ?ns$ [] $ 
\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 in[]set[]conv[]nth$\OT1/cmr/m/n/10 )$[] 
[81]
Overfull \hbox (7.27686pt too wide) in paragraph at lines 445--454
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 proof $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 atomize[]elim$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 
in-duc-tion un ar-bi-trary$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 m rule$\OT1/cmr/m/
n/10 :$\T1/cmr/m/it/10 removeAll[]induct$\OT1/cmr/m/n/10 )$[] 
[82]
Overfull \hbox (33.40263pt too wide) in paragraph at lines 578--582
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 1$\OT1/cmr/m/n/
10 :$ \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 phiDefNodes[]aux g
 v $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n g$\OT1/cmr/m/n/10 )
$ \T1/cmr/m/it/10 m \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$$\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 rule phiDefNodes[]auxI$\OML/cmm/m/it/10 ;$
[83]
Overfull \hbox (19.05038pt too wide) in paragraph at lines 724--726
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule[]tac v$\O
T1/cmr/m/n/10 =$\T1/cmr/m/it/10 v \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 n$\OT1/cm
r/m/n/10 =$\T1/cmr/m/it/10 n \T1/cmr/bx/n/10 in \T1/cmr/m/it/10 lookupDef[]case
s$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 :$ \T1/cmr/m/i
t/10 assms lookupDef[]cases$\OT1/cmr/m/n/10 )$[] 
[84]
Overfull \hbox (26.32518pt too wide) in paragraph at lines 789--803
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
induction rule$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 lookupDef$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 induct$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 auto elim$\OT1/cmr/
m/n/10 :$\T1/cmr/m/it/10 lookupDefE$\OT1/cmr/m/n/10 )$[] 
[85] [86] [87]
Overfull \hbox (23.9604pt too wide) in paragraph at lines 1363--1367
[][]        \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 snoc$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 3$\OT1/cmr/m/n/10 )$ \T1/cmr/
bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/c
mr/m/it/10 x $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 m$ [] $ \T1/cmr/bx/n/10 by $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 tl[]
append split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 list$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 split[]asm$\OT1/cmr/m/n/10 )$[] 
[88]
Overfull \hbox (38.59175pt too wide) in paragraph at lines 1382--1386
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 5$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 v$ [] $ $
\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 phiDefs g m$ [] $ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp
 add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 allDefs[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (26.66702pt too wide) in paragraph at lines 1388--1391
[][]            \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 braun[]ssa$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phiDefs[]def \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 phis$ [] $[]def
 split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 split[]asm

Overfull \hbox (20.4175pt too wide) in paragraph at lines 1447--1450
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it
/10 v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 lookupDef g m $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 var g v$ [] $$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/1
0 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phis$ [] $[
]def split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 split[]asm

Overfull \hbox (10.8281pt too wide) in paragraph at lines 1450--1455
[][]    \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 var g v $\OT1/c
mr/m/n/10 =$ \T1/cmr/m/it/10 var g v$ [] $ \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/
m/it/10 var[]def \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 metis lo
okupDef[]fst$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (4.82967pt too wide) in paragraph at lines 1473--1487
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 by $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT1/cmr/m/n/10 !$$:$\T1/cmr/m/it/10 look
upDef[]fst dest$\OT1/cmr/m/n/10 !$$:$\T1/cmr/m/it/10 phiDefNodes[]$\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 n simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phis$ [] $[
]def
[89]
Overfull \hbox (34.70166pt too wide) in paragraph at lines 1526--1529
[][]    \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 m$ [] $$\OT1/cmr/m/n/10 :$ \T1/cm
r/m/it/10 m$ [] $ $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 phiDefN-odes g $\OT1/cmr
/m/n/10 ($\T1/cmr/m/it/10 var g v$ [] $$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/
10 phis$ [] $[]def split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 split[]asm

Overfull \hbox (1.88747pt too wide) in paragraph at lines 1650--1654
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 lookupDef g m $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \
T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]lookupDef$\OT
1/cmr/m/n/10 )$[] 
[90]
Overfull \hbox (1.88747pt too wide) in paragraph at lines 1686--1690
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 l$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 lookupDef g m $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \
T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]lookupDef$\OT
1/cmr/m/n/10 )$[] 

Overfull \hbox (21.67505pt too wide) in paragraph at lines 1718--1719
[][]    \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr
/m/it/10 n$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 ns$\OMS/cmsy/m/n/10 !$\T1/cmr/m
/it/10 m n $[]$ set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 tl ns$\OT1/cmr/m/n/10 )$
 \T1/cmr/m/it/10 v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun[]ssa$\OML/cmm/m/i
t/10 :$\T1/cmr/m/it/10 allDefs g n v $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 braun
[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses

Overfull \hbox (22.34937pt too wide) in paragraph at lines 1733--1737
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/
10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 lookupDef g m $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 var g v$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 v \T1/cmr/bx/n/1
0 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUse[]loo
kupDef$\OML/cmm/m/it/10 ;$

Overfull \hbox (23.36525pt too wide) in paragraph at lines 1789--1796
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 defs$ [] $[]def phis$ [] $[]def allDefs[]var[]disjo
int[]aux split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 splits if[]split[]asm$\OT1/cmr/m/n/10 )$[] 
[91] [92] [93]
Overfull \hbox (34.34283pt too wide) in paragraph at lines 2120--2134
[][]  \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 by $\OMS/cms
y/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule braun[]ssa$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 defNode[]eq$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule assms
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 ;$ \T1
/cmr/m/it/10 subst braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]def$\
OML/cmm/m/it/10 ;$
[94]
Overfull \hbox (24.90512pt too wide) in paragraph at lines 2237--2239
[][]            \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst bra
un[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiArg[]def$\OML/cmm/m/it/10 ;$ \T1/
cmr/m/it/10 subst braun[]ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]def$\OML/c
mm/m/it/10 ;$ \T1/cmr/m/it/10 subst PhiDef[]defNode[]eq$\OML/cmm/m/it/10 ;$

Overfull \hbox (13.43826pt too wide) in paragraph at lines 2312--2319
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto split$\OT1/cmr
/m/n/10 :$\T1/cmr/m/it/10 prod$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 splits if[]sp
lit[]asm simp add$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 phiDefNodes[]def elim$\OT1/
cmr/m/n/10 !$$:$\T1/cmr/m/it/10 fold[]union[]elem
) (./Construct_SSA_notriv.tex [95]
Overfull \hbox (0.50066pt too wide) in paragraph at lines 61--62
[][]  $\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base $
\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in-v
ar in-Edges$ [] $ En-try old-Defs oldUses
[96] [97] [98]
Overfull \hbox (19.0183pt too wide) in paragraph at lines 335--337
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 sub-sti-tu-tion$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 intro$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 re-dun-dant g $\OT1/
cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 isTriv-ial-Phi g $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 chooseNext g$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 subst
itution
[99]
Overfull \hbox (19.05222pt too wide) in paragraph at lines 453--455
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp only$\OT
1/cmr/m/n/10 :$\T1/cmr/m/it/10 n[]defNode v$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2
$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 rule trivialPhi[]strict
[]dom$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m
/it/10 substNext[]def$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (5.92926pt too wide) in paragraph at lines 455--460
[][]      \T1/cmr/bx/n/10 more-over from \T1/cmr/m/it/10 v$\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 1$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 old$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?n$ [] $ n \T1/cmr/bx/n/10 by $\OMS
/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUses[]dominated$\O
ML/cmm/m/it/10 ;$
[100] [101] [102]
Overfull \hbox (42.34743pt too wide) in paragraph at lines 837--839
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$ \T1/cmr/m/it/10 simpleDefs[]phiDefs[]disjoint$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 unfolded CFG[]SSA[]defs$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$
\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]defs

Overfull \hbox (31.50557pt too wide) in paragraph at lines 901--914
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$\T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]def
 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiDefs[]def phiDefs[]def allDefs[]def
 split$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 if[]split[]asm$\OT1/cmr/m/n/10 )$[] 
[103]
Overfull \hbox (36.68791pt too wide) in paragraph at lines 1066--1068
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$\T1/cmr/m/it/10 allUses[]def[]ass$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/1
0 unfolded CFG[]SSA[]defs$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 sim-pli-fied$\OT1
/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA
[]defs$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (13.66513pt too wide) in paragraph at lines 1086--1088
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 chooseNext[]eliminated$\OT1/cmr/m/n
/10 :$ \T1/cmr/m/it/10 chooseNext g $[]$ step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 allDefs g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 defNode g $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 chooseNext
[104]
Overfull \hbox (1.65211pt too wide) in paragraph at lines 1229--1233
[][]        \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 ?n$[][]$ $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 n hd ns $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 n \T1/cmr/bx/n/10 u
s-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/cmr/m/n/10
 )$ \T1/cmr/m/it/10 ns$[][]$ \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it
/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/m/it/10 ns old$\OML/cmm/m/it/10 :$\T1/c
mr/m/it/10 path2[]def$\OT1/cmr/m/n/10 )$[] 
[105]
Overfull \hbox (16.59686pt too wide) in paragraph at lines 1279--1283
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 asm ns$[][]$ \T1/cmr/bx/n/10
 have \T1/cmr/m/it/10 old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 dominates g ?n$[][
]$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 last ns$[][]$$\OT1/cmr/m/n/10 )$ \T1/cmr/
bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule allUs
es[]dominated$\OML/cmm/m/it/10 ;$

Overfull \hbox (18.9609pt too wide) in paragraph at lines 1283--1288
[][]          \T1/cmr/bx/n/10 more-over have \T1/cmr/m/it/10 strict[]def[]dom g
 v v$[][]$ \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 triv \T1/cmr/bx/n/10 by $\OMS
/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule trivialPhi[]strict[]d
om$\OML/cmm/m/it/10 ;$

Overfull \hbox (22.83139pt too wide) in paragraph at lines 1340--1343
[][]              \T1/cmr/bx/n/10 hence \T1/cmr/m/it/10 False \T1/cmr/bx/n/10 u
s-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 6$\OT1/cmr/m/n/10
 )$ []\T1/cmr/m/it/10 v$[][]$ $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 chooseNext g[
] simpleDefs[]phiDefs[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of
[106] [107]
Overfull \hbox (31.96979pt too wide) in paragraph at lines 1467--1472
[][]              \T1/cmr/bx/n/10 ul-ti-mately show \T1/cmr/m/it/10 ?the-sis \T
1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 6$
\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 vs$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 1$\OT1/
cmr/m/n/10 )$ \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 rule allDefs[]var[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of

Overfull \hbox (0.34885pt too wide) in paragraph at lines 1581--1583
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv
$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv $\OML/cmm/m/i
t/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n

Overfull \hbox (27.16942pt too wide) in paragraph at lines 1607--1609
[][]   \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp add$\OT1/
cmr/m/n/10 :$\T1/cmr/m/it/10 conventional$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 unf
olded CFG[]SSA[]defs$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 sim-pli-fied$\OT1/cmr/
m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]def
s$\OT1/cmr/m/n/10 )$[] 
[108] [109] [110]
Overfull \hbox (20.39001pt too wide) in paragraph at lines 1955--1963
[][]    \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 allVars[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allDefs[]
def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 allUses[]def uninst$\OML/cmm/m/it
/10 :$\T1/cmr/m/it/10 phiDefs[]def
[111]
Overfull \hbox (1.66362pt too wide) in paragraph at lines 2071--2075
[][]    \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?the-sis \T1/cmr/bx/n/10 us-ing \T
1/cmr/m/it/10 step$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 step[]CFG[]SSA[]Transform
ed[]notriv$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simplified$\OT1/cmr/m/n/10 ]$ \T1/
cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 simp
[112] [113]
Overfull \hbox (9.83093pt too wide) in paragraph at lines 2226--2230
[][]      \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m
/it/10 set $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n g$\OT1/cmr/
m/n/10 )$ $=[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 defs g n $\OMS/cmsy/m/n/10 \$
 \T1/cmr/m/it/10 uses$ [] $[]all g n $\OT1/cmr/m/n/10 =$ $\OMS/cmsy/m/n/10 f$$g
$ \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 d
efs[]uses[]disjoint$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 of

Overfull \hbox (26.728pt too wide) in paragraph at lines 2303--2305
[][]    \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 1$\OT1/cmr/m/n/10 :$ $[]$\T1/cmr/m
/it/10 u p$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 redundant $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u g$\OT1/cmr/m/n/10 )$$)$
 $($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$
$=$\T1/cmr/m/it/10 p g$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/1
0  []!$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant
[114]
Overfull \hbox (18.20131pt too wide) in paragraph at lines 2309--2311
[][]      \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule sub-stAll$
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$[$\T1/cmr/bx/n/10 where 
\T1/cmr/m/it/10 Q$\OT1/cmr/m/n/10 =$$\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 u p$\
OML/cmm/m/it/10 :$ $\OMS/cmsy/m/n/10 :$\T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 redundant $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u$\OT1/cmr/m/n/10
 )$$)$ $($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n
/10 :$$=$\T1/cmr/m/it/10 p$\OT1/cmr/m/n/10 )$$)$

Overfull \hbox (10.06143pt too wide) in paragraph at lines 2394--2396
[][]    \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 :$ $[]$\T1/cmr/m
/it/10 u u$ [] $ p p$ [] $ g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 pruned $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u$ [] $$\
OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u g$\OT
1/cmr/m/n/10 )$$)$ $($\T1/cmr/m/it/10 p$ [] $$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 p g$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/
10 g $\OMS/cmsy/m/n/10  []!$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 pruned

Overfull \hbox (11.27089pt too wide) in paragraph at lines 2402--2404
[][]    \T1/cmr/bx/n/10 by $\OMS/cmsy/m/n/10 ^^@$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 rule sub-stAll$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$[$\
T1/cmr/bx/n/10 where \T1/cmr/m/it/10 P$\OT1/cmr/m/n/10 =$$\OML/cmm/m/it/10 ^^U$
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 p$\OT1/
cmr/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1
/cmr/m/it/10 pruned $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$\OT1/cmr/m/n/10 ($\
T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=$\T1/cmr/m/it/10 u$\OT1/cmr/m/n/10 )$$)$ $
($\T1/cmr/m/it/10 phis$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 :$$=
$\T1/cmr/m/it/10 p$\OT1/cmr/m/n/10 )$$)$
[115]) (./SSA_Semantics.tex [116]
Overfull \hbox (7.19157pt too wide) in paragraph at lines 171--175
[][]      \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 empty$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 prems$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 n \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 n $\OT1/cmr/m/n/10 =$ \T1/cmr/m/i
t/10 En-try g \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 cases ms$\O
ML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto dest$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 
old$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 path2[]hd$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (7.21399pt too wide) in paragraph at lines 198--202
[][]    \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 snoc$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 hyps$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 4$\OT1/cmr/m/n/10 )$ \T1/cmr/bx/n/
10 have$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 6\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 En-try g \T1/cmr/
bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 Entry[]no[]predecessor$\OT1/cmr/m/n/10 )$[] 
[117]
Overfull \hbox (3.32082pt too wide) in paragraph at lines 249--252
[][]          \T1/cmr/bx/n/10 with \T1/cmr/m/it/10 ns$ [] $ \T1/cmr/bx/n/10 hav
e \T1/cmr/m/it/10 bns$ [] $$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 g $\OMS/cmsy/m/n
/10 `$ \T1/cmr/m/it/10 En-try g$\OMS/cmsy/m/n/10 ^^@$\T1/cmr/m/it/10 butlast ns
$ [] $$\OMS/cmsy/m/n/10 !$\T1/cmr/m/it/10 ?n$ [] $$ [] $ ?n$ [] $$ [] $ $\OMS/c
msy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 old$\OML/c
mm/m/it/10 :$\T1/cmr/m/it/10 predecessors
[118]) (./While_Combinator_Exts.tex [119] [120]) (./SSA_CFG_code.tex)
(./Construct_SSA_code.tex) (./Construct_SSA_notriv_code.tex
Overfull \hbox (5.98059pt too wide) in paragraph at lines 34--36
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 substNext[]code g next $\OMS/cmsy/m/n/10 ^^Q
$ $\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 v$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 i
f v $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 snd next then substitution[]code
[121] [122]
Overfull \hbox (11.98946pt too wide) in paragraph at lines 107--108
[][]    \T1/cmr/m/it/10 fold $\OT1/cmr/m/n/10 ($$\OML/cmm/m/it/10 ^^U$\T1/cmr/m
/it/10 n$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 update n $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 List$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 map $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 id$\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 snd next $\OT1/cmr/m/n/10 :$$=$ \T1/cmr/m/it/10 next$ [] $$\OT1/cmr
/m/n/10 )$$)$ $($\T1/cmr/m/it/10 the $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup

Overfull \hbox (12.97588pt too wide) in paragraph at lines 108--109
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 sorted[]list[]of[]set $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n
/10 )$ $($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nod
es[]of[]phis

Overfull \hbox (4.0448pt too wide) in paragraph at lines 114--115
[][]      $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 let old[]phis $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 Set$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 remove next $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 case[]option $\OMS/cmsy/m/n/10 f$$g$ \T1/cmr/m/it/10 id 
$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 l
ookup nodes[]of[]phis

Overfull \hbox (13.59372pt too wide) in paragraph at lines 125--127
[][]  \T1/cmr/bx/n/10 def-i-ni-tion $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 code$\OT
1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 step[]codem g next next$ [] $ nodes[]of[]use
s nodes[]of[]phis $\OT1/cmr/m/n/10 =$ $($\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (6.30238pt too wide) in paragraph at lines 134--136
[][]\T1/cmr/bx/n/10 locale \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linor
der $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]base
[123] [124]
Overfull \hbox (11.81181pt too wide) in paragraph at lines 342--343
[][]$\OT1/cmr/m/n/10 +$ \T1/cmr/m/it/10 CFG[]SSA[]Transformed[]notriv[]linorder
 $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 e $\OML/cmm/m/it/10 $\T1/cmr/m/it/10 n in
-var in-Edges$ [] $ En-try old-Defs oldUses
[125]
Overfull \hbox (0.95255pt too wide) in paragraph at lines 367--368
\OML/cmm/m/it/10 ^^U$\T1/cmr/m/it/10 g$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 var $\OML/cmm/m/it/10 ^^U$\T1/cmr/
m/it/10 uses phis$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 chooseNext[]all uses $\OT
1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 Mappi
ng

Overfull \hbox (104.92482pt too wide) in paragraph at lines 453--455
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 redundant[]ign$\OT1/cmr/m/n/10 [$\T
1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]cod
e $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10
 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code

Overfull \hbox (21.5668pt too wide) in paragraph at lines 455--463
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 redundant[]code[]def 
uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/
m/it/10 trivial[]code[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/
m/n/10 ]$
[126]
Overfull \hbox (24.16965pt too wide) in paragraph at lines 475--477
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 uses$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 const u$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/
10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem

Overfull \hbox (90.55998pt too wide) in paragraph at lines 477--485
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 uses$ [] $[]codem[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs
[]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it
/10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution
[]code[]def

Overfull \hbox (5.11174pt too wide) in paragraph at lines 496--498
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $[]ign$\OT1/cmr/m/n/10 [$\
T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 
const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/1
0 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]code

Overfull \hbox (81.61777pt too wide) in paragraph at lines 498--506
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]code[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[
]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[
]code[]def

Overfull \hbox (29.6548pt too wide) in paragraph at lines 518--520
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 phis$ [] $m[]ign$\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/1
0 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it
/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $[]codem

Overfull \hbox (89.79355pt too wide) in paragraph at lines 520--528
[][]  \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]codem[]def$\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs
[]def$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it
/10 substNext[]code[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution
[]code[]def

Overfull \hbox (0.9442pt too wide) in paragraph at lines 581--583
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 Mapping[]lookup[]map[]values Mapping[]lookup[]map O
p-tion$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 bind[]def
[127]
Overfull \hbox (6.7089pt too wide) in paragraph at lines 589--591
[][]      \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 phis$ [] $[]codem[]def mm
ap[]def ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup[]phiNodes[]of $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 OF ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis[]finite$
\OT1/cmr/m/n/10 ]$

Overfull \hbox (18.40192pt too wide) in paragraph at lines 646--648
[][]  \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 clarsimp simp$\
OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 mmap[]def Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 replace[]def $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/m/n/
10 ]$ \T1/cmr/m/it/10 phi[]equiv[]mapping[]def

Overfull \hbox (25.52013pt too wide) in paragraph at lines 662--664
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cmr/
m/n/10 :$ \T1/cmr/m/it/10 map[]of[]map[]restrict restrict[]map[]def substNext[]
code[]def fold[]update[]conv

Overfull \hbox (51.08165pt too wide) in paragraph at lines 673--675
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 step[]ign$\OT1/cmr/m/n/10 [$\T1/cmr
/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 step[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const u$\OT
1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 const p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g
 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/
it/10 step[]codem

Overfull \hbox (6.25371pt too wide) in paragraph at lines 693--706
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 rel[]fun[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 pcr[]cr[]eq cr[]mapping[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 rep[]inverse$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (15.82213pt too wide) in paragraph at lines 711--724
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 rel[]fun[]def map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 pcr[]cr[]eq cr[]mapping[]def Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 lookup$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 rep[]eq$\OT1/cmr/m/n/10 )$[] 
[128]
Overfull \hbox (8.04977pt too wide) in paragraph at lines 771--772
[][]  \T1/cmr/bx/n/10 as-sumes \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ \T1/cmr/m
/it/10 nodes[]of[]phis $\OMS/cmsy/m/n/10 ^^Y$$[][]$ \T1/cmr/m/it/10 ssa$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of g \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 
Map-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis

Overfull \hbox (7.95027pt too wide) in paragraph at lines 819--820
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 Map-ping$\OML/cmm/m/it/10 :$\T1/cmr
/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [] $[]codem g next $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ \T
1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$

Overfull \hbox (46.09499pt too wide) in paragraph at lines 838--840
[][]      \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto in-tro$\OT
1/cmr/m/n/10 !$$:$ \T1/cmr/m/it/10 map[]idI $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 
symmetric$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/
it/10 Mapping[]lookup[]map[]values substNext[]code[]def
[129]
Overfull \hbox (40.8658pt too wide) in paragraph at lines 876--877
[][]    \T1/cmr/m/it/10 Some $\OT1/cmr/m/n/10 ($$($\T1/cmr/m/it/10 case[]option
 $\OMS/cmsy/m/n/10 f$$g$ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Set$\OML/cmm/m/it/1
0 :$\T1/cmr/m/it/10 remove next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup nodes[]of[]phis $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 substitution[]code

Overfull \hbox (16.56137pt too wide) in paragraph at lines 928--935
[][]    \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 Mapping[]lookup[]map[]values bind[]eq[]None[]conv m
ap[]conv[]bind[]option
[130]
Overfull \hbox (33.3333pt too wide) in paragraph at lines 1041--1043
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]phis$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis$ [
] $[]codem g next next$ [] $ $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (15.79576pt too wide) in paragraph at lines 1065--1074
[][]    \T1/cmr/bx/n/10 us-ing \T1/cmr/m/it/10 assms \T1/cmr/bx/n/10 un-fold-in
g \T1/cmr/m/it/10 phis$ [] $[]codem[]def phi[]equiv[]mapping[]def ssa$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 keys[]phidefNodes

Overfull \hbox (33.62422pt too wide) in paragraph at lines 1074--1081
[][]  \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 force split$\OT1/cm
r/m/n/10 :$ \T1/cmr/m/it/10 op-tion$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 splits i
f[]splits simp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 fold[]update[]conv fun[]upd[]
apply keys[]dom[]lookup

Overfull \hbox (31.08868pt too wide) in paragraph at lines 1087--1088
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis
[131]
Overfull \hbox (59.96251pt too wide) in paragraph at lines 1137--1139
\T1/cmr/m/it/10 next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cm
r/m/n/10 )$$)$ \T1/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/i
t/10 nodes[]of[]phis $\OMS/cmsy/m/n/10  []!$ $\OML/cmm/m/it/10 '$ $\OMS/cmsy/m/
n/10 2$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (16.53975pt too wide) in paragraph at lines 1157--1159
[][]      \T1/cmr/bx/n/10 hence $\OML/cmm/m/it/10 '$ $[]$ \T1/cmr/m/it/10 unins
t[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 phis$ [] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst
itution[]code
[132]
Overfull \hbox (8.66772pt too wide) in paragraph at lines 1263--1266
\T1/cmr/m/it/10 next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code g ne
xt$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]phis$\OT1/cmr/m/n/10 )$$)$ \T1
/cmr/m/it/10 g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\
T1/cmr/m/it/10 trivial[]phis g$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 nodes[]of[]ph
is
[133] [134]
Overfull \hbox (23.4298pt too wide) in paragraph at lines 1423--1425
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subgoal[]tac 
fi-nite $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 dom $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/
10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr
/m/it/10 phis$ [] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substituti
on[]code
[135] [136] [137]
Overfull \hbox (15.5058pt too wide) in paragraph at lines 1671--1673
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subgoal[]tac 
$\OMS/cmsy/m/n/10 f$\T1/cmr/m/it/10 n $\OMS/cmsy/m/n/10 2$ \T1/cmr/m/it/10 Map-
ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10
 phis g$\OT1/cmr/m/n/10 )$$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 snd next $\OMS/c
msy/m/n/10 2$ \T1/cmr/m/it/10 set $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 the $\OT1/
cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup
[138]
Overfull \hbox (6.85002pt too wide) in paragraph at lines 1767--1769
[][]      \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\
OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 keys[]dom[]lookup dest$\OT1/cmr/m/n/10 :$ \T1
/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 force dest$\OT1/
cmr/m/n/10 :$ \T1/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 )$$[$\T1/cmr/m/it/
10 1$\OT1/cmr/m/n/10 ]$[] 

Overfull \hbox (4.29509pt too wide) in paragraph at lines 1805--1807
[][]     \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\O
T1/cmr/m/n/10 :$ \T1/cmr/m/it/10 keys[]dom[]lookup dest$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 ;$ \T1/cmr/m/it/10 force dest$\OT1/c
mr/m/n/10 :$ \T1/cmr/m/it/10 in[]next[]args$\OT1/cmr/m/n/10 )$$[$\T1/cmr/m/it/1
0 1$\OT1/cmr/m/n/10 ]$[] 

Overfull \hbox (40.67703pt too wide) in paragraph at lines 1837--1838
[][]  \T1/cmr/bx/n/10 shows \T1/cmr/m/it/10 g $\OMS/cmsy/m/n/10 `$ $\OT1/cmr/m/
n/10 ($\T1/cmr/m/it/10 nodes[]of[]uses$ [] $ g next $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 substitution[]code g next$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 Mapping
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 ssa
$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phidefNodes
[139] [140]
Overfull \hbox (7.31837pt too wide) in paragraph at lines 1968--1970
[][]    \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst uses$ [
] $[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF assms$\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 1$\OML/cmm/m/it/10 ;$\T1/cmr/m/it/10 2$\OT1/cmr/m/n/10 )$$\O
ML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 un-folded substitution[]code[]def$\OT1/cmr/m/
n/10 ]$$)$[] 
[141] [142]
Overfull \hbox (15.93558pt too wide) in paragraph at lines 2099--2101
[][]  \T1/cmr/bx/n/10 lemma \T1/cmr/m/it/10 keys[]uses$ [] $[]codem $\OT1/cmr/m
/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 Map-ping$\OM
L/cmm/m/it/10 :$\T1/cmr/m/it/10 keys $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uses$ [
] $[]codem g next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (10.88066pt too wide) in paragraph at lines 2190--2198
[][]    \T1/cmr/bx/n/10 un-fold-ing \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of[]def u
ninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m
/it/10 phis[]addN[]def $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 abs[]def$\OT1/cmr/m/n
/10 ]$
[143]
Overfull \hbox (38.43755pt too wide) in paragraph at lines 2248--2249
[][]        $\OMS/cmsy/m/n/10 ^$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const 
p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g nodes[]of[]uses $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 useNodes[]of

Overfull \hbox (36.90468pt too wide) in paragraph at lines 2249--2250
[][]        $\OMS/cmsy/m/n/10 ^$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 
:$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const 
p$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g phis[]of[]nodes $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phiNodes[]of

Overfull \hbox (0.1367pt too wide) in paragraph at lines 2267--2270
[][]    \T1/cmr/bx/n/10 then ob-tain \T1/cmr/m/it/10 s1[]uses s1[]phis s1[]triv
[]phis s1[]nodes[]of[]uses s1[]phi[]nodes[]of \T1/cmr/bx/n/10 where[] 

Overfull \hbox (2.51563pt too wide) in paragraph at lines 2275--2276
[][]      \T1/cmr/bx/n/10 and \T1/cmr/m/it/10 nou[]equiv$\OT1/cmr/m/n/10 :$ \T1
/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mappin
g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/
m/it/10 g s1[]nodes[]of[]uses

Overfull \hbox (13.4409pt too wide) in paragraph at lines 2279--2283
\T1/cmr/m/it/10 in-var in-Edges$ [] $ En-try old-Defs oldUses defs u[]g g s1[]u
ses p[]g g s1[]phis var chooseNext[]all
[144]
Overfull \hbox (9.79211pt too wide) in paragraph at lines 2332--2334
[][]      \T1/cmr/bx/n/10 have \T1/cmr/m/it/10 Max $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 CFG[]SSA[]wf[]base[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phi
s $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 p[]g g s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr
/m/it/10 g$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 chooseNext[]all

Overfull \hbox (44.5052pt too wide) in paragraph at lines 2351--2353
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 useNodes[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 const s1[]uses$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 useNodes[]of

Overfull \hbox (42.2059pt too wide) in paragraph at lines 2360--2362
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phiNodes[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m
/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ 
\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/
it/10 :$\T1/cmr/m/it/10 phiNodes[]of
[145]
Overfull \hbox (69.22342pt too wide) in paragraph at lines 2376--2378
[][]      \T1/cmr/bx/n/10 hence $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cm
r/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 
phi[]equiv[]mapping $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/
m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping

Overfull \hbox (41.23457pt too wide) in paragraph at lines 2401--2403
[][]       \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 subst i$\O
ML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem[]correct $\OT1/cmr/m/n/10 [$
\T1/cmr/m/it/10 symmetric$\OML/cmm/m/it/10 ;$ \T1/cmr/bx/n/10 where \T1/cmr/m/i
t/10 nodes[]of[]uses$\OT1/cmr/m/n/10 =$\T1/cmr/m/it/10 s1[]nodes[]of[]uses$\OT1
/cmr/m/n/10 ]$$)$[] 

Overfull \hbox (50.05571pt too wide) in paragraph at lines 2427--2429
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
ubstitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/
n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code
[146]
Overfull \hbox (24.47787pt too wide) in paragraph at lines 2439--2441
[][]      \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 step[]s2$\OT1/cmr/m/n/10 :$ \T1/
cmr/m/it/10 step g ?s2 $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 map[]prod us-esOf Ma
p-ping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lookup $\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 step[]codem

Overfull \hbox (112.73097pt too wide) in paragraph at lines 2453--2455
[][]       \T1/cmr/bx/n/10 ap-ply $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 clarsimp s
imp$\OT1/cmr/m/n/10 :$ \T1/cmr/m/it/10 uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/1
0 substNext[]def uninst$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]def CF
G[]SSA[]wf[]base$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 CFG[]SSA[]wf[]defs$\OT1/cmr
/m/n/10 )$[] 

Overfull \hbox (3.0547pt too wide) in paragraph at lines 2463--2464
[][]          $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 phis$ [] $[]codem $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 p g $\O
T1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g 
?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 substitution[]code

Overfull \hbox (34.56685pt too wide) in paragraph at lines 2464--2466
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT
1/cmr/m/n/10 :$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$ [] $
[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF phi[]equiv[]mapping[]ref
l$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phis$
 [] $[]codem[]correct

Overfull \hbox (26.06744pt too wide) in paragraph at lines 2469--2470
[][]        \T1/cmr/m/it/10 us-esOf $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]
code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 u g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$
)$ \T1/cmr/m/it/10 g ?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML
/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (41.51004pt too wide) in paragraph at lines 2470--2471
[][]          $\OT1/cmr/m/n/10 =$ \T1/cmr/m/it/10 us-esOf $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $[]codem
 $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 u g $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst 
s1$\OT1/cmr/m/n/10 )$$)$ \T1/cmr/m/it/10 g ?next $\OT1/cmr/m/n/10 ($\T1/cmr/m/i
t/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substitution[]code

Overfull \hbox (36.09972pt too wide) in paragraph at lines 2471--2473
[][]        \T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 auto simp$\OT
1/cmr/m/n/10 :$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$ [] $
[]codem[]correct $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 OF phi[]equiv[]mapping[]ref
l$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 i$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 uses$
 [] $[]codem[]correct

Overfull \hbox (4.87158pt too wide) in paragraph at lines 2474--2476
[][]      \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 step[]s2$\OT1/cmr/m/n/10 [$\T1/c
mr/m/it/10 symmetric$\OT1/cmr/m/n/10 ]$ \T1/cmr/m/it/10 step$\OML/cmm/m/it/10 :
$\T1/cmr/m/it/10 step[]CFG[]SSA[]Transformed[]notriv []Mapping$\OML/cmm/m/it/10
 :$\T1/cmr/m/it/10 keys
[147]
Overfull \hbox (51.64523pt too wide) in paragraph at lines 2481--2482
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/1
0 )$$)$$)$ \T1/cmr/m/it/10 g ?next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 s1[]nodes
[]of[]uses s1[]phi[]nodes[]of$\OT1/cmr/m/n/10 )$$)$[] 

Overfull \hbox (51.64523pt too wide) in paragraph at lines 2482--2483
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 substitution[]code $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const $\OT1/cmr/m/n/10
 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 fst s1$\OT1/cmr/m/n/1
0 )$$)$$)$ \T1/cmr/m/it/10 g ?next$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 s1[]nodes
[]of[]uses s1[]phi[]nodes[]of$\OT1/cmr/m/n/10 )$$)$[] 

Overfull \hbox (31.1545pt too wide) in paragraph at lines 2515--2517
[][]      \T1/cmr/bx/n/10 have $\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr
/m/n/10 ]$$:$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 s
sa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/cmr/
m/it/10 p[]g g s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g $\OT1/cmr/m/n/10 =
$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/
m/it/10 :$\T1/cmr/m/it/10 trivial[]phis

Overfull \hbox (90.91887pt too wide) in paragraph at lines 2540--2541
[][]      $[]$\T1/cmr/m/it/10 m1 m2$\OML/cmm/m/it/10 :$ \T1/cmr/m/it/10 uninst[
]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping $\OT1/cmr/m/n/10 (
$\T1/cmr/m/it/10 const s1[]phis$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 g m1 m2 $\OT
1/cmr/m/n/10 =[]\OMS/cmsy/m/n/10 )$ \T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/
10 :$\T1/cmr/m/it/10 phi[]equiv[]mapping
[148]
Overfull \hbox (1.76341pt too wide) in paragraph at lines 2607--2608
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$$)$ \T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 
)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substi
tution[]code

Overfull \hbox (1.76341pt too wide) in paragraph at lines 2608--2609
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/
10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 trivial[]phis $\OT1/cmr/m/n/10 ($\T1/
cmr/m/it/10 const $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1
/cmr/m/it/10 fst s1$\OT1/cmr/m/n/10 )$$)$$)$ \T1/cmr/m/it/10 g$\OT1/cmr/m/n/10 
)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 substi
tution[]code
[149]
Overfull \hbox (4.99088pt too wide) in paragraph at lines 2612--2613
\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 Mapping$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 lo
okup $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 phis g$\OT1/cmr/m/n/10 )$$)$$)$ $($\T1/
cmr/m/it/10 fst $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 snd $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 snd s1$\OT1/cmr/m/n/10 )$$)$$)$$)$ $($\T1/cmr/m/it/10 uninst[]code$\
OML/cmm/m/it/10 :$\T1/cmr/m/it/10 ssa$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 useNod
es[]of $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 const
) (./Disjoin_Transform.tex
Overfull \hbox (14.60175pt too wide) in paragraph at lines 37--38
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxVnameLen[]aux $\OT1/cmr/m/n/10 ($\T
1/cmr/m/it/10 e1 \T1/cmr/m/n/10 ^^S [] ^^T \T1/cmr/m/it/10 e2$\OT1/cmr/m/n/10 )
$ $=$ \T1/cmr/m/it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux e
1$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 maxVnameLen[]aux
[150]
Overfull \hbox (20.5284pt too wide) in paragraph at lines 44--45
[][]$\OMS/cmsy/m/n/10 j$ \T1/cmr/m/it/10 maxV-name-Len $\OT1/cmr/m/n/10 ($\T1/c
mr/m/it/10 if $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 b$\OT1/cmr/m/n/10 )$ \T1/cmr/m
/it/10 c$[][]$ else c$[][]$$\OT1/cmr/m/n/10 )$ $=$ \T1/cmr/m/it/10 max $\OT1/cm
r/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen c$[][]$$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/
it/10 max $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 maxVnameLen[]aux

Overfull \hbox (21.12737pt too wide) in paragraph at lines 96--109
[][]\T1/cmr/bx/n/10 by $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule maxVnameLen[]new
name$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 auto simp$\OT1/cmr/m/n/10 :$\T1/cmr/
m/it/10 tempName[]def String$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 literal$\OML/cm
m/m/it/10 :$\T1/cmr/m/it/10 STR[]inverse
[151]
Overfull \hbox (37.53712pt too wide) in paragraph at lines 224--226
[][]  \T1/cmr/bx/n/10 proof $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 cases $\OT1/cmr/
m/n/10 ($\T1/cmr/m/it/10 transform[]aux temp c1$\OT1/cmr/m/n/10 ;$$;$ \T1/cmr/m
/it/10 transform[]aux temp c2$\OT1/cmr/m/n/10 )$ $($\T1/cmr/m/it/10 V$\OT1/cmr/
m/n/10 :$$=$\T1/cmr/m/it/10 e$\OT1/cmr/m/n/10 )$ \T1/cmr/m/it/10 rule$\OT1/cmr/
m/n/10 :$\T1/cmr/m/it/10 subcmd$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 cases$\OT1/c
mr/m/n/10 )$[] 

Overfull \hbox (10.09949pt too wide) in paragraph at lines 273--277
[][]  \T1/cmr/bx/n/10 from \T1/cmr/m/it/10 5$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10
 prems \T1/cmr/bx/n/10 show \T1/cmr/m/it/10 ?case \T1/cmr/bx/n/10 by $\OMS/cmsy
/m/n/10 ^^@$$\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 rule 5$\OML/cmm/m/it/10 :$\T1/cm
r/m/it/10 IH$\OML/cmm/m/it/10 ;$ \T1/cmr/m/it/10 auto elim$\OT1/cmr/m/n/10 :$\T
1/cmr/m/it/10 subcmd$\OML/cmm/m/it/10 :$\T1/cmr/m/it/10 cases new-name$\OML/cmm
/m/it/10 :$\T1/cmr/m/it/10 cases$\OT1/cmr/m/n/10 )$[] 

Overfull \hbox (18.42184pt too wide) in paragraph at lines 305--307
[][]\T1/cmr/bx/n/10 corollary \T1/cmr/m/it/10 Defs[]Uses[]transform[]disjoint $
\OT1/cmr/m/n/10 [$\T1/cmr/m/it/10 simp$\OT1/cmr/m/n/10 ]$$:$ \T1/cmr/m/it/10 De
fs $\OT1/cmr/m/n/10 ($\T1/cmr/m/it/10 transform c$\OT1/cmr/m/n/10 )$ \T1/cmr/m/
it/10 n $\OMS/cmsy/m/n/10 \$ \T1/cmr/m/it/10 Uses $\OT1/cmr/m/n/10 ($\T1/cmr/m/
it/10 transform
)) (./root.bbl [152]) [153] (./root.aux) )
(see the transcript file for additional information){/usr/share/texmf/fonts/enc
/dvips/cm-super/cm-super-t1.enc}</usr/share/texlive/texmf-dist/fonts/type1/publ
ic/amsfonts/cm/cmex10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/ams
fonts/cm/cmmi10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/
cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr1
0.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb></
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></usr/shar
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/share/texl
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy5.pfb></usr/share/texlive/tex
mf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb></usr/share/texlive/texmf-dist
/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texmf/fonts/type1/public/
cm-super/sfbx1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfbx1095.pf
b></usr/share/texmf/fonts/type1/public/cm-super/sfbx1200.pfb></usr/share/texmf/
fonts/type1/public/cm-super/sfbx1440.pfb></usr/share/texmf/fonts/type1/public/c
m-super/sfrm1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfrm1095.pfb
></usr/share/texmf/fonts/type1/public/cm-super/sfrm1200.pfb></usr/share/texmf/f
onts/type1/public/cm-super/sfrm1728.pfb></usr/share/texmf/fonts/type1/public/cm
-super/sfti1000.pfb></usr/share/texmf/fonts/type1/public/cm-super/sfti1095.pfb>

Output written on root.pdf (153 pages, 690723 bytes).
Transcript written on root.log.

*** Failed to load theory "SSA_Transfer_Rules" (unresolved "Construct_SSA_code")
*** Failed to load theory "Generic_Interpretation" (unresolved "Construct_SSA_code", "SSA_Transfer_Rules")
*** Failed to load theory "Generic_Extract" (unresolved "Generic_Interpretation")
*** Failed to load theory "WhileGraphSSA" (unresolved "Generic_Interpretation")
*** Type unification failed: Variable 'a::type not of sort linorder
*** 
*** Type error in application: incompatible operand type
*** 
*** Operator:  RBT.filter ::
***   (??'a \<Rightarrow> ??'b \<Rightarrow> bool)
***   \<Rightarrow> (??'a, ??'b) RBT.rbt \<Rightarrow> (??'a, ??'b) RBT.rbt
*** Operand:   \<lambda>v'. v' \<noteq> v :: 'a \<Rightarrow> bool
*** 
*** Coercion Inference:
*** 
*** Local coercion insertion on the operand failed:
*** Variable 'a::type not of sort linorder
*** 
*** Now trying to infer coercions globally.
*** 
*** Coercion inference failed:
*** weak unification of subtype constraints fails
*** Clash of types "_ \<Rightarrow> _" and "bool"
*** 
*** At command "by" (line 296 of "~~/afp/thys/Formal_SSA/SSA_CFG_code.thy")
*** Type unification failed: Variable 'a::type not of sort linorder
*** 
*** Type error in application: incompatible operand type
*** 
*** Operator:  RBT.filter ::
***   (??'a \<Rightarrow> ??'b \<Rightarrow> bool)
***   \<Rightarrow> (??'a, ??'b) RBT.rbt \<Rightarrow> (??'a, ??'b) RBT.rbt
*** Operand:   \<lambda>v'. v' \<noteq> v :: 'a \<Rightarrow> bool
*** 
*** Coercion Inference:
*** 
*** Local coercion insertion on the operand failed:
*** Variable 'a::type not of sort linorder
*** 
*** Now trying to infer coercions globally.
*** 
*** Coercion inference failed:
*** weak unification of subtype constraints fails
*** Clash of types "_ \<Rightarrow> _" and "bool"
*** 
*** At command "have" (line 273 of "~~/afp/thys/Formal_SSA/SSA_CFG_code.thy")
*** Type unification failed: Clash of types "bool" and "_ \<Rightarrow> _"
*** 
*** Type error in application: incompatible operand type
*** 
*** Operator:  RBT.filter ::
***   (??'a \<Rightarrow> ??'b \<Rightarrow> bool)
***   \<Rightarrow> (??'a, ??'b) RBT.rbt \<Rightarrow> (??'a, ??'b) RBT.rbt
*** Operand:   P :: ??'a \<Rightarrow> bool
*** 
*** Coercion Inference:
*** 
*** Local coercion insertion on the operand failed:
*** Clash of types "bool" and "_ \<Rightarrow> _"
*** 
*** Now trying to infer coercions globally.
*** 
*** Coercion inference failed:
*** weak unification of subtype constraints fails
*** Clash of types "_ list" and "(_, _) RBT.rbt"
*** 
*** At command "lemma" (line 48 of "~~/afp/thys/Formal_SSA/Construct_SSA_code.thy")