1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
|
// Author(s): Jeroen van der Wulp, Wieger Wesselink
// Copyright: see the accompanying file COPYING or copy at
// https://svn.win.tue.nl/trac/MCRL2/browser/trunk/COPYING
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <set>
#include <sstream>
#include <stack>
#include <boost/test/included/unit_test_framework.hpp>
#include "mcrl2/core/print.h"
#include "mcrl2/core/detail/print_utility.h"
#include "mcrl2/data/data_expression.h"
#include "mcrl2/data/parse.h"
#include "mcrl2/data/print.h"
#include "mcrl2/data/replace.h"
#include "mcrl2/data/rewriter.h"
#include "mcrl2/data/expression_traits.h"
#include "mcrl2/data/enumerator.h"
#include "mcrl2/data/detail/concepts.h"
#include "mcrl2/data/detail/print_utility.h"
#include "mcrl2/data/standard_utility.h"
#include "mcrl2/data/substitutions/mutable_indexed_substitution.h"
#include "mcrl2/data/substitutions/mutable_map_substitution.h"
using namespace mcrl2;
using namespace mcrl2::data;
// Example: parse_variable_list("x:Nat; y:Pos");
variable_list parse_variable_list(const std::string& text, const data_specification& dataspec = detail::default_specification())
{
variable_vector result;
parse_variables(text, std::back_inserter(result), dataspec);
return variable_list(result.begin(), result.end());
}
void enumerate(const data_specification& dataspec,
const variable_list& variables,
const data_expression& expression,
std::size_t expected_no_of_solutions,
bool more_solutions_possible)
{
typedef enumerator_list_element_with_substitution<> enumerator_element;
typedef enumerator_algorithm_with_iterator<> enumerator_type;
rewriter rewr(dataspec);
enumerator_type enumerator(rewr, dataspec, rewr);
size_t number_of_solutions = 0;
mutable_indexed_substitution<> sigma;
std::deque<enumerator_element> enumerator_deque(1, enumerator_element(variables, expression));
auto i = enumerator.begin(sigma, enumerator_deque);
for ( ; number_of_solutions < expected_no_of_solutions && i != enumerator.end(); ++i)
{
mutable_map_substitution<> rho;
i->add_assignments(variables, rho, rewr);
std::cout << "solution = " << rho << std::endl;
number_of_solutions++;
}
BOOST_CHECK(number_of_solutions == expected_no_of_solutions && (more_solutions_possible || i == enumerator.end()));
}
void enumerate(const std::string& dataspec_text,
const std::string& variable_text,
const std::string& expression_text,
const std::string& free_variable_text,
std::size_t number_of_solutions,
bool more_solutions_possible)
{
data_specification dataspec = parse_data_specification(dataspec_text);
variable_list variables = parse_variable_list(variable_text, dataspec);
data_expression expression = parse_data_expression(expression_text, free_variable_text, dataspec);
enumerate(dataspec, variables, expression, number_of_solutions, more_solutions_possible);
}
BOOST_AUTO_TEST_CASE(empty_test)
{
typedef enumerator_list_element_with_substitution<> enumerator_element;
typedef enumerator_algorithm_with_iterator<> enumerator_type;
// test manual construction of rewr with rewriter
data_specification dataspec;
rewriter rewr(dataspec);
variable_list variables;
size_t count = 0;
// explicit with condition rewr and condition
enumerator_type enumerator(rewr, dataspec, rewr);
mutable_indexed_substitution<> sigma;
std::deque<enumerator_element> enumerator_deque(1, enumerator_element(variables, sort_bool::true_()));
for (auto i = enumerator.begin(sigma, enumerator_deque); i != enumerator.end(); ++i)
{
count++;
}
BOOST_CHECK(count == 1);
// explicit with condition but without condition rewr
enumerator_deque.clear();
enumerator_deque.emplace_back(enumerator_element(variables, sort_bool::true_()));
for (auto i = enumerator.begin(sigma, enumerator_deque); i != enumerator.end(); ++i)
{
count++;
}
BOOST_CHECK(count == 2);
variables = parse_variable_list("y: Nat;");
enumerator_deque.clear();
enumerator_deque.emplace_back(enumerator_element(variables, sort_bool::false_()));
for (auto i = enumerator.begin(sigma, enumerator_deque); i != enumerator.end(); ++i)
{
BOOST_CHECK(false);
}
}
BOOST_AUTO_TEST_CASE(list_test)
{
std::string dataspec_text =
"sort list_of_booleans; \n"
"cons empty : list_of_booleans; \n"
" lcons : Bool # list_of_booleans -> list_of_booleans; \n"
"map size : list_of_booleans -> Nat; \n"
"var l : list_of_booleans; \n"
" b : Bool; \n"
"eqn size(empty) = 0; \n"
" size(lcons(b,l)) = 1 + size(l); \n"
;
std::string variable_text = "x: list_of_booleans; y: Nat;";
std::string expression_text = "y == size(x) && 0 < y && y < 2";
std::string free_variable_text = "x : list_of_booleans; y : Nat;";
std::size_t number_of_solutions = 0;
bool more_solutions_possible = true; // Changed!
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
BOOST_AUTO_TEST_CASE(structured_sort_test)
{
std::string dataspec_text =
"sort D = struct d1(E) | d2(E); \n"
" E = struct e1 | e2; \n"
;
std::string variable_text = "d: D;";
std::string expression_text = "forall d: D. d == e";
std::string free_variable_text = "e: D;";
std::size_t number_of_solutions = 4;
bool more_solutions_possible = false;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
BOOST_AUTO_TEST_CASE(equality_substitution_test)
{
std::string dataspec_text = "sort L = Nat;";
std::string variable_text = "";
std::string expression_text = "x == 17 && x != 17";
std::string free_variable_text = "x : Pos;";
std::size_t number_of_solutions = 0;
bool more_solutions_possible = true; // Changed!
std::clog << "Test1 equality\n";
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
std::clog << "Test2 equality\n";
expression_text = "x == 17 && x == x";
number_of_solutions = 1;
more_solutions_possible = false;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
std::clog << "Test3 equality\n";
expression_text = "x == 17 && 2*x == 34";
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
std::clog << "Test4 equality\n";
variable_text = "";
number_of_solutions = 1;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
std::clog << "Test4 equality: return two non exact solutions\n";
variable_text = "b: Bool;";
number_of_solutions = 2;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
BOOST_AUTO_TEST_CASE(tree_test)
{
std::string dataspec_text =
"sort tree_with_booleans; \n"
"cons leaf : Bool -> tree_with_booleans; \n"
"cons node : tree_with_booleans # tree_with_booleans -> tree_with_booleans; \n"
;
std::string variable_text = "x : tree_with_booleans;";
std::string expression_text = "true";
std::string free_variable_text = "";
std::size_t number_of_solutions = 32;
bool more_solutions_possible = true;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
BOOST_AUTO_TEST_CASE(mutually_recursive_test)
{
std::string dataspec_text =
"sort this; \n"
" that; \n"
"cons a : this; \n"
" A : that -> this; \n"
" b : that; \n"
" B : this -> that; \n"
"map maximum_a : Nat # this -> Bool; \n"
" maximum_a : Nat # that -> Bool; \n"
" maximum_b : Nat # this -> Bool; \n"
" maximum_b : Nat # that -> Bool; \n"
"var x : Nat; \n"
" ax : this; \n"
" bx : that; \n"
"eqn maximum_a(x,A(bx)) = maximum_a(Int2Nat(x - 1),bx); \n"
" maximum_a(0,a) = true; \n"
" maximum_b(x,B(ax)) = maximum_b(Int2Nat(x - 1),ax); \n"
" maximum_b(0,b) = true; \n"
;
std::string variable_text = "x : this;";
std::string expression_text = "true";
std::string free_variable_text = "";
std::size_t number_of_solutions = 32;
bool more_solutions_possible = true;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
variable_text = "x : that;";
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
BOOST_AUTO_TEST_CASE(set_test)
{
std::string dataspec_text = "sort Dummy;\n";
std::string variable_text = "f: Set(Bool);";
std::string expression_text = "true in f";
std::string free_variable_text = "f: Set(Bool);";
std::size_t number_of_solutions = 4;
bool more_solutions_possible = false;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
inline
data_expression_vector generate_values(const data_specification& dataspec, const sort_expression& s, std::size_t max_size = 1000)
{
typedef enumerator_list_element_with_substitution<> enumerator_element;
typedef enumerator_algorithm_with_iterator<> enumerator_type;
std::size_t max_internal_variables = 10000;
data_expression_vector result;
rewriter rewr(dataspec);
enumerator_type enumerator(rewr, dataspec, rewr, max_internal_variables);
variable v("x", s);
variable_list variables;
variables.push_front(v);
mutable_indexed_substitution<> sigma;
std::deque<enumerator_element> enumerator_deque(1, enumerator_element(variables, sort_bool::true_()));
for (auto i = enumerator.begin(sigma, enumerator_deque); i != enumerator.end() ; ++i)
{
i->add_assignments(variables, sigma, rewr);
result.push_back(sigma(variables.front()));
if (result.size() >= max_size)
{
break;
}
}
return result;
}
bool no_duplicates(const data_expression_vector& v)
{
std::set<data_expression> s;
s.insert(v.begin(), v.end());
return s.size() == v.size();
}
BOOST_AUTO_TEST_CASE(generate_values_test)
{
std::string DATASPEC =
"sort Identifiers = struct t1 | t2 | t3 | t4 | t5 | p1 | p2 | s1 | r1 | r2 | r3 | IL; \n"
" signal_Messages = struct ic_set_proceed_signal | ic_set_stop_signal; \n"
" track_Messages = struct dv_free_track | dv_occupied_track; \n"
" point_Messages = struct ic_move_right_point | ic_move_left_point | dv_at_right_point | dv_at_left_point; \n"
" route_Messages = struct ic_cancel_route_route | ic_set_route_route; \n"
" Interlocking_Messages = struct c_set_stop | c_move_left | c_set_route | c_IL_off | c_cancel_route | tc_set_proceed | c_IL_on | c_move_right; \n"
" environment_Messages = struct i_signal_status_proceed_signal_environment | i_signal_status_stop_signal_environment | i_track_status_occupied_track_environment | \n"
" i_track_status_free_track_environment | i_point_at_right_point_environment | i_point_locked_point_environment | i_point_ok_point_environment | \n"
" i_point_broken_point_environment | i_point_at_left_point_environment | i_route_cancelled_route_environment | i_route_established_route_environment; \n"
" rail_yard_Messages = struct sv_set_proceed_signal_railyard | sv_set_stop_signal_railyard | sv_move_right_point_railyard | sv_move_left_point_railyard; \n"
" Enum3 = struct e2_3 | e1_3 | e0_3; \n"
" track__ready_States = struct track__ready_free_substate | track__ready_occupied_substate | track__ready_startup_substate | track__ready_nop; \n"
" Enum15 = struct e14_15 | e13_15 | e12_15 | e11_15 | e10_15 | e9_15 | e8_15 | e7_15 | e6_15 | e5_15 | e4_15 | e3_15 | e2_15 | e1_15 | e0_15; \n"
" point_States = struct point__broken_substate | point__startup_substate | point__working_substate; \n"
" point__working_States = struct point__working_right_substate | point__working_left_substate | point__working_moving_substate | point__working_nop; \n"
" point__working_moving_States = struct point__working_moving_left_substate | point__working_moving_right_substate | point__working_moving_nop; \n"
" Enum7 = struct e6_7 | e5_7 | e4_7 | e3_7 | e2_7 | e1_7 | e0_7; \n"
" signal_States = struct signal__stop_substate | signal__proceed_substate; \n"
" Enum10 = struct e9_10 | e8_10 | e7_10 | e6_10 | e5_10 | e4_10 | e3_10 | e2_10 | e1_10 | e0_10; \n"
" route_States = struct route__idle_substate | route__established_substate | route__setting_up_substate; \n"
" route__established_States = struct route__established_in_use_substate | route__established_active_substate | route__established_nop; \n"
" Enum11 = struct e10_11 | e9_11 | e8_11 | e7_11 | e6_11 | e5_11 | e4_11 | e3_11 | e2_11 | e1_11 | e0_11; \n"
" Enum13 = struct e12_13 | e11_13 | e10_13 | e9_13 | e8_13 | e7_13 | e6_13 | e5_13 | e4_13 | e3_13 | e2_13 | e1_13 | e0_13; \n"
" HAL_device_States = struct HAL_device__normal_substate; \n"
" track_States = struct track__ready_substate; \n"
;
data_specification dataspec = parse_data_specification(DATASPEC);
auto const& sorts = dataspec.user_defined_sorts();
for (auto i = sorts.begin(); i != sorts.end(); ++i)
{
sort_expression s = normalize_sorts(*i,dataspec);
std::clog << "--- sort " << data::pp(s) << std::endl;
data_expression_vector v = generate_values(dataspec, s, 10);
std::clog << " possible values: " << core::detail::print_set(v) << std::endl;
BOOST_CHECK(v.size() <= 10);
BOOST_CHECK(no_duplicates(v));
}
const alias_vector& aliases = dataspec.user_defined_aliases();
for (auto i = aliases.begin(); i != aliases.end(); ++i)
{
alias a = *i;
sort_expression s = normalize_sorts(i->reference(),dataspec);
std::clog << "--- sort " << data::pp(s) << std::endl;
data_expression_vector v = generate_values(dataspec, s, 10);
std::clog << " possible values: " << core::detail::print_set(v) << std::endl;
BOOST_CHECK(v.size() <= 10);
BOOST_CHECK(no_duplicates(v));
}
}
BOOST_AUTO_TEST_CASE(constructors_that_are_not_a_normal_form_test)
{
std::string dataspec_text =
"sort FloorID = struct F1 | F2;\n"
" \n"
"map fSucc : FloorID -> FloorID;\n"
" equal : FloorID # FloorID -> Bool;\n"
"\n"
"var f,g : FloorID;\n"
"eqn F2 = fSucc(F1); \n"
" equal(fSucc(f),fSucc(g)) = equal(f,g);\n"
" equal(fSucc(f),F1) = false;\n"
" equal(F1,fSucc(g)) = false;\n"
" equal(F1,F1) = true;\n"
" f==g = equal(f,g);\n"
;
std::string variable_text = "f: FloorID;";
std::string expression_text = "equal(f, F2)";
std::string free_variable_text = variable_text;
std::size_t number_of_solutions = 1;
bool more_solutions_possible = false;
enumerate(dataspec_text, variable_text, expression_text, free_variable_text, number_of_solutions, more_solutions_possible);
}
boost::unit_test::test_suite* init_unit_test_suite(int argc, char* argv[])
{
return 0;
}
|
