5 schedule: '{ domain: "{ S_2[k] : k <= 261 and k >= 252; S_0[k] : (exists (e0 = floor((k)/256):
6 k <= 261 and k >= 252 and 256e0 >= -255 + k and 256e0 <= -2 + k)) or (exists (e0
7 = floor((k)/256): 256e0 = k and k <= 261 and k >= 252)); S_1[k] : k <= 261 and k
8 >= 252 }", child: { schedule: "L_0[{ S_2[k] -> [(k)]; S_1[k] -> [(k)]; S_0[k] ->
9 [(k)] }]", child: { sequence: [ { filter: "{ S_0[k] }" }, { filter: "{ S_1[k] }"
10 }, { filter: "{ S_2[k] }" } ] } } }'
13 extent: '{ __pet_test_0[k] : k <= 261 and k >= 252 }'
14 value_bounds: '{ [i0] : i0 >= 0 and i0 <= 1 }'
24 domain: '{ [S_0[k] -> [0]] : (exists (e0 = floor((k)/256): k <= 261 and k >= 252
25 and 256e0 >= -255 + k and 256e0 <= -2 + k)) or (exists (e0 = floor((k)/256): 256e0
26 = k and k <= 261 and k >= 252)) }'
27 schedule: '{ S_0[k] -> [0, k, 0] }'
35 index: '{ S_0[k] -> a[] }'
36 reference: __pet_ref_1
43 index: '{ S_0[k] -> __pet_test_0[((-1 + k) : k >= 253)] }'
44 reference: __pet_ref_0
48 domain: '{ [S_1[k] -> [0]] : k <= 261 and k >= 252 }'
49 schedule: '{ S_1[k] -> [0, k, 1, 0] }'
57 index: '{ S_1[k] -> __pet_test_0[(k)] }'
58 reference: __pet_ref_3
65 index: '{ S_1[k] -> __pet_test_0[((-1 + k) : k >= 253)] }'
66 reference: __pet_ref_2
70 domain: '{ [S_2[k] -> [0]] : k <= 261 and k >= 252 }'
71 schedule: '{ S_2[k] -> [0, k, 2] }'
79 index: '{ S_2[k] -> a[] }'
80 reference: __pet_ref_5
84 index: '{ S_2[k] -> [(k - 256*floor((k)/256))] }'
85 reference: __pet_ref_6
90 index: '{ S_2[k] -> __pet_test_0[(k)] }'
91 reference: __pet_ref_4
96 extension: '{ __pet_test_0[k] -> __pet_test_0[k''] : k'' <= k and k'' <= 261 and