4 context: '[n] -> { : n <= 2147483647 and n >= -2147483648 }'
5 schedule: '{ domain: "[n] -> { S2[x1, x2] : exists (e0 = floor((-1 + x2)/2): 2e0 =
6 -1 + x2 and x1 >= 0 and x1 <= -1 + n and x2 >= 9); S1[x1] : x1 >= 0 and x1 <= -1
7 + n; S_1[x1, x2] : exists (e0 = floor((-1 + x2)/2): 2e0 = -1 + x2 and x1 >= 0 and
8 x1 <= -1 + n and x2 >= 9); R[x1] : x1 >= 0 and x1 <= -1 + n }", child: { schedule:
9 "[n] -> L_0[{ S1[x1] -> [(x1)]; R[x1] -> [(x1)]; S_1[x1, x2] -> [(x1)]; S2[x1, x2]
10 -> [(x1)] }]", child: { sequence: [ { filter: "[n] -> { S1[x1] }" }, { filter: "[n]
11 -> { S2[x1, x2]; S_1[x1, x2] }", child: { schedule: "[n] -> L_1[{ S_1[x1, x2] ->
12 [(x2)]; S2[x1, x2] -> [(x2)] }]", child: { sequence: [ { filter: "[n] -> { S_1[x1,
13 x2] }" }, { filter: "[n] -> { S2[x1, x2] }" } ] } } }, { filter: "[n] -> { R[x1]
17 extent: '[n] -> { __pet_test_0[x1, x2] : exists (e0 = floor((-1 + x2)/2): 2e0 =
18 -1 + x2 and x1 <= -1 + n and x2 >= 9 and x1 >= 0) }'
19 value_bounds: '{ [i0] : i0 >= 0 and i0 <= 1 }'
24 extent: '[n] -> { s[] }'
29 domain: '[n] -> { S1[x1] : x1 >= 0 and x1 <= -1 + n }'
37 index: '[n] -> { S1[x1] -> s[] }'
38 reference: __pet_ref_0
44 domain: '[n] -> { [S_1[x1, x2] -> [1]] : exists (e0 = floor((-1 + x2)/2): 2e0 =
45 -1 + x2 and x1 <= -1 + n and x2 >= 9 and x1 >= 0) }'
53 index: '[n] -> { S_1[x1, x2] -> __pet_test_0[(x1), (x2)] }'
54 reference: __pet_ref_2
61 index: '[n] -> { S_1[x1, x2] -> [(x1)] }'
62 reference: __pet_ref_3
66 index: '[n] -> { S_1[x1, x2] -> [(x2)] }'
67 reference: __pet_ref_4
72 index: '[n] -> { S_1[x1, x2] -> __pet_test_0[(x1), ((-2 + x2) : x2 >= 11)] }'
73 reference: __pet_ref_1
77 domain: '[n] -> { [S2[x1, x2] -> [1]] : exists (e0 = floor((-1 + x2)/2): 2e0 = -1
78 + x2 and x1 <= -1 + n and x2 >= 9 and x1 >= 0) }'
86 index: '[n] -> { S2[x1, x2] -> s[] }'
87 reference: __pet_ref_6
94 index: '[n] -> { S2[x1, x2] -> s[] }'
95 reference: __pet_ref_7
100 index: '[n] -> { S2[x1, x2] -> __pet_test_0[(x1), (x2)] }'
101 reference: __pet_ref_5
105 domain: '[n] -> { R[x1] : x1 >= 0 and x1 <= -1 + n }'
113 index: '[n] -> { R[x1] -> s[] }'
114 reference: __pet_ref_8
119 extension: '[n] -> { __pet_test_0[x1, x2] -> __pet_test_0[x1, x2''] : exists (e0
120 = floor((-1 + x2'')/2): 2e0 = -1 + x2'' and x2'' <= x2 and x1 >= 0 and x1 <= -1
121 + n and x2'' >= 9) }'