z3 0.0.20180624 → 0.0.20211213
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/README.md +2 -4
- data/Rakefile +15 -8
- data/examples/abc_path +187 -0
- data/examples/abc_path-1.txt +7 -0
- data/examples/algebra_problems +12 -12
- data/examples/aquarium +133 -0
- data/examples/aquarium-1.txt +11 -0
- data/examples/bridges +2 -2
- data/examples/cats_organized_neatly +133 -0
- data/examples/cats_organized_neatly-10.txt +15 -0
- data/examples/cats_organized_neatly-3.txt +8 -0
- data/examples/cats_organized_neatly-48.txt +32 -0
- data/examples/circuit_problems +4 -4
- data/examples/clogic_puzzle +2 -2
- data/examples/color_nonogram +150 -0
- data/examples/color_nonogram-1.txt +23 -0
- data/examples/crossflip +2 -4
- data/examples/dominion +153 -0
- data/examples/dominion-1.txt +8 -0
- data/examples/dominosa +133 -0
- data/examples/dominosa-1.txt +8 -0
- data/examples/eulero +99 -0
- data/examples/eulero-1.txt +5 -0
- data/examples/four_hackers_puzzle +2 -2
- data/examples/futoshiki +128 -0
- data/examples/futoshiki-1.txt +17 -0
- data/examples/kakurasu +73 -0
- data/examples/kakurasu-1.txt +2 -0
- data/examples/kakuro +2 -2
- data/examples/killer_sudoku +88 -0
- data/examples/killer_sudoku-1.txt +17 -0
- data/examples/killer_sudoku-2.txt +53 -0
- data/examples/kinematics_problems +20 -20
- data/examples/knights_puzzle +2 -2
- data/examples/kropki +100 -0
- data/examples/kropki-1.txt +13 -0
- data/examples/letter_connections +2 -2
- data/examples/light_up +2 -2
- data/examples/minisudoku +2 -2
- data/examples/miracle_sudoku +135 -0
- data/examples/miracle_sudoku-1.txt +9 -0
- data/examples/mortal_coil_puzzle +2 -2
- data/examples/nanro +245 -0
- data/examples/nanro-1.txt +8 -0
- data/examples/nine_clocks +106 -0
- data/examples/nonogram +2 -2
- data/examples/pyramid_nonogram +2 -2
- data/examples/regexp_crossword_solver +2 -2
- data/examples/regexp_solver +2 -2
- data/examples/renzoku +124 -0
- data/examples/renzoku-1.txt +17 -0
- data/examples/sandwich_sudoku +101 -0
- data/examples/sandwich_sudoku-1.txt +10 -0
- data/examples/selfref +2 -2
- data/examples/simple_regexp_parser.rb +58 -56
- data/examples/skyscrapers +118 -0
- data/examples/skyscrapers-1.txt +6 -0
- data/examples/skyscrapers-2.txt +11 -0
- data/examples/star_battle +134 -0
- data/examples/star_battle-1.txt +10 -0
- data/examples/stitches +180 -0
- data/examples/stitches-1.txt +11 -0
- data/examples/sudoku +2 -2
- data/examples/suguru +199 -0
- data/examples/suguru-1.txt +17 -0
- data/examples/verbal_arithmetic +2 -2
- data/examples/yajilin +268 -0
- data/examples/yajilin-1.txt +10 -0
- data/lib/z3/ast.rb +8 -0
- data/lib/z3/expr/bitvec_expr.rb +10 -0
- data/lib/z3/expr/expr.rb +16 -15
- data/lib/z3/low_level.rb +6 -2
- data/lib/z3/low_level_auto.rb +180 -36
- data/lib/z3/optimize.rb +5 -4
- data/lib/z3/printer.rb +29 -1
- data/lib/z3/sort/bitvec_sort.rb +1 -0
- data/lib/z3/sort/sort.rb +9 -5
- data/lib/z3/very_low_level.rb +8 -5
- data/lib/z3/very_low_level_auto.rb +45 -9
- data/spec/bitvec_expr_spec.rb +35 -21
- data/spec/bitvec_sort_spec.rb +4 -0
- data/spec/expr_spec.rb +62 -0
- data/spec/integration/abc_path_spec.rb +21 -0
- data/spec/integration/aquarium_spec.rb +27 -0
- data/spec/integration/cats_organized_neatly_spec.rb +14 -0
- data/spec/integration/color_nonogram_spec.rb +28 -0
- data/spec/integration/dominion_spec.rb +14 -0
- data/spec/integration/dominosa_spec.rb +21 -0
- data/spec/integration/eulero_spec.rb +11 -0
- data/spec/integration/futoshiki_spec.rb +23 -0
- data/spec/integration/kakurasu_spec.rb +18 -0
- data/spec/integration/killer_sudoku_spec.rb +10 -0
- data/spec/integration/knights_puzzle_spec.rb +11 -11
- data/spec/integration/kropki_spec.rb +19 -0
- data/spec/integration/miracle_sudoku_spec.rb +15 -0
- data/spec/integration/mortal_coil_puzzle_spec.rb +8 -6
- data/spec/integration/nanro_spec.rb +39 -0
- data/spec/integration/nine_clocks_spec.rb +30 -0
- data/spec/integration/oneofus_spec.rb +7 -15
- data/spec/integration/regexp_crossword_solver_spec.rb +1 -1
- data/spec/integration/renzoku_spec.rb +23 -0
- data/spec/integration/sandwich_sudoku_spec.rb +15 -0
- data/spec/integration/skyscraper_spec.rb +10 -0
- data/spec/integration/star_battle_spec.rb +27 -0
- data/spec/integration/stitches_spec.rb +25 -0
- data/spec/integration/suguru_spec.rb +23 -0
- data/spec/integration/yajilin_spec.rb +25 -0
- data/spec/interface_spec.rb +18 -0
- data/spec/optimize_spec.rb +6 -4
- data/spec/printer_spec.rb +30 -0
- data/spec/set_expr_spec.rb +14 -8
- data/spec/solver_spec.rb +4 -5
- data/spec/spec_helper.rb +15 -0
- metadata +104 -24
@@ -1,5 +1,5 @@
|
|
1
1
|
# There are multiple solutions, so this test is nondeterministic
|
2
|
-
#
|
2
|
+
# This is what Z3 4.8.13 returns
|
3
3
|
describe "Knights Swap Puzzle" do
|
4
4
|
it do
|
5
5
|
expect("knights_puzzle").to have_output <<EOF
|
@@ -9,28 +9,28 @@ bbb.
|
|
9
9
|
xbxw
|
10
10
|
..ww
|
11
11
|
x.xw
|
12
|
-
|
12
|
+
w: 2,2 -> 3,0
|
13
13
|
|
14
14
|
State 1:
|
15
|
-
|
15
|
+
bbbw
|
16
16
|
xbxw
|
17
|
-
|
17
|
+
...w
|
18
18
|
x.xw
|
19
|
-
|
19
|
+
b: 1,0 -> 2,2
|
20
20
|
|
21
21
|
State 2:
|
22
|
-
.
|
22
|
+
b.bw
|
23
23
|
xbxw
|
24
|
-
|
24
|
+
..bw
|
25
25
|
x.xw
|
26
|
-
|
26
|
+
w: 3,1 -> 1,0
|
27
27
|
|
28
28
|
State 3:
|
29
|
+
bwbw
|
30
|
+
xbx.
|
29
31
|
..bw
|
30
|
-
xbxw
|
31
|
-
.bbw
|
32
32
|
x.xw
|
33
|
-
|
33
|
+
b: 0,0 -> 1,2
|
34
34
|
|
35
35
|
State 4:
|
36
36
|
.wbw
|
@@ -0,0 +1,19 @@
|
|
1
|
+
describe "Kropki" do
|
2
|
+
it do
|
3
|
+
expect("kropki").to have_output <<EOF
|
4
|
+
+-+-+-+-+-+-+
|
5
|
+
|5|1*2|6*3o4|
|
6
|
+
+-+-+-+*+o+*+
|
7
|
+
|1|6o5|3o4*2|
|
8
|
+
+-+-+o+o+-+-+
|
9
|
+
|3o4|6|2o1|5|
|
10
|
+
+*+o+-+-+o+-+
|
11
|
+
|6*3o4o5|2*1|
|
12
|
+
+-+-+-+o+-+-+
|
13
|
+
|2|5|1|4|6*3|
|
14
|
+
+*+-+-+-+o+*+
|
15
|
+
|4*2o3|1|5o6|
|
16
|
+
+-+-+-+-+-+-+
|
17
|
+
EOF
|
18
|
+
end
|
19
|
+
end
|
@@ -0,0 +1,15 @@
|
|
1
|
+
describe "Miracle Sudoku" do
|
2
|
+
it do
|
3
|
+
expect("miracle_sudoku").to have_output <<EOF
|
4
|
+
4 8 3 7 2 6 1 5 9
|
5
|
+
7 2 6 1 5 9 4 8 3
|
6
|
+
1 5 9 4 8 3 7 2 6
|
7
|
+
8 3 7 2 6 1 5 9 4
|
8
|
+
2 6 1 5 9 4 8 3 7
|
9
|
+
5 9 4 8 3 7 2 6 1
|
10
|
+
3 7 2 6 1 5 9 4 8
|
11
|
+
6 1 5 9 4 8 3 7 2
|
12
|
+
9 4 8 3 7 2 6 1 5
|
13
|
+
EOF
|
14
|
+
end
|
15
|
+
end
|
@@ -1,12 +1,14 @@
|
|
1
|
+
# There are multiple solutions, so this test is nondeterministic
|
2
|
+
# This is what Z3 4.8.13 returns
|
1
3
|
describe "Mortal Coil Puzzle" do
|
2
4
|
it do
|
3
5
|
expect("mortal_coil_puzzle").to have_output <<EOF
|
4
|
-
|
5
|
-
|
6
|
-
|
7
|
-
|
8
|
-
|
9
|
-
|
6
|
+
4 3 2 ### 20 19
|
7
|
+
5 ### 1 ### 21 18
|
8
|
+
6 25 24 23 22 17
|
9
|
+
7 26 27 28 ### 16
|
10
|
+
8 ### 30 29 ### 15
|
11
|
+
9 10 11 12 13 14
|
10
12
|
EOF
|
11
13
|
end
|
12
14
|
end
|
@@ -0,0 +1,39 @@
|
|
1
|
+
describe "Nanro" do
|
2
|
+
it do
|
3
|
+
expect("nanro").to have_output <<~EOF
|
4
|
+
*---*---*---*---*---*---*---*---*
|
5
|
+
| | | |
|
6
|
+
| 6 6 6 6 | 1 | 3 3 |
|
7
|
+
| | | |
|
8
|
+
* *---* *---* * *
|
9
|
+
| | | | | | |
|
10
|
+
| 6 | 1 | 6 | 1 | | 3 |
|
11
|
+
| | | | | | |
|
12
|
+
*---* *---*---*---* *---* *
|
13
|
+
| | | | | | | |
|
14
|
+
| 1 | | 1 | 2 | | 3 | |
|
15
|
+
| | | | | | | |
|
16
|
+
*---*---*---*---* *---* * *
|
17
|
+
| | | | | | | | |
|
18
|
+
| | 2 | 1 | | 2 | 1 | 3 | |
|
19
|
+
| | | | | | | | |
|
20
|
+
* * *---* * *---* *---*
|
21
|
+
| | | | | | |
|
22
|
+
| 1 | 2 | 1 | | 3 | 4 |
|
23
|
+
| | | | | | |
|
24
|
+
* *---* *---*---*---*---* *
|
25
|
+
| | | | | | | |
|
26
|
+
| | 1 | | 2 | 1 | 3 | 4 |
|
27
|
+
| | | | | | | |
|
28
|
+
* *---*---* *---* * *
|
29
|
+
| | | | | | |
|
30
|
+
| | 2 | 1 | 2 | 3 3 | 4 |
|
31
|
+
| | | | | | |
|
32
|
+
*---* * *---*---*---*---* *
|
33
|
+
| | | | | | |
|
34
|
+
| 1 | 2 | | 1 | 2 2 | 4 |
|
35
|
+
| | | | | | |
|
36
|
+
*---*---*---*---*---*---*---*---*
|
37
|
+
EOF
|
38
|
+
end
|
39
|
+
end
|
@@ -0,0 +1,30 @@
|
|
1
|
+
describe "Nine Clocks" do
|
2
|
+
it do
|
3
|
+
expect("nine_clocks").to have_output <<EOF
|
4
|
+
IN:
|
5
|
+
1 0 1
|
6
|
+
0 2 3
|
7
|
+
1 3 2
|
8
|
+
OUT:
|
9
|
+
1 0 0
|
10
|
+
0 0 0
|
11
|
+
0 0 0
|
12
|
+
IN:
|
13
|
+
0 2 0
|
14
|
+
2 3 2
|
15
|
+
3 3 3
|
16
|
+
OUT:
|
17
|
+
0 1 0
|
18
|
+
0 0 0
|
19
|
+
0 0 0
|
20
|
+
IN:
|
21
|
+
2 3 2
|
22
|
+
3 1 3
|
23
|
+
2 3 2
|
24
|
+
OUT:
|
25
|
+
0 0 0
|
26
|
+
0 1 0
|
27
|
+
0 0 0
|
28
|
+
EOF
|
29
|
+
end
|
30
|
+
end
|
@@ -1,19 +1,11 @@
|
|
1
|
+
# This puzzle is ambiguous and different z3 versions return different result,
|
2
|
+
# so just checking that it doesn't crash
|
3
|
+
|
1
4
|
describe "OneOfUs" do
|
2
|
-
|
3
|
-
expect("oneofus").to have_output <<EOF
|
4
|
-
grey Triangle grey Circle grey Triangle
|
5
|
-
purple Square grey Triangle purple Triangle
|
6
|
-
grey Triangle grey Square grey Triangle
|
5
|
+
let(:binary) { Pathname(__dir__) + "../../examples/oneofus" }
|
7
6
|
|
8
|
-
|
9
|
-
|
10
|
-
|
11
|
-
Click 3: 1,2 - grey Square
|
12
|
-
Click 4: 1,1 - grey Triangle
|
13
|
-
Click 5: 1,0 - grey Circle
|
14
|
-
Click 6: 2,0 - grey Triangle
|
15
|
-
Click 7: 0,0 - grey Triangle
|
16
|
-
Click 8: 0,2 - grey Triangle
|
17
|
-
EOF
|
7
|
+
it do
|
8
|
+
output = `#{binary}`.chomp
|
9
|
+
expect(output.lines.size).to eq(13)
|
18
10
|
end
|
19
11
|
end
|
@@ -15,7 +15,7 @@ describe "Regexp Crossword Solver" do
|
|
15
15
|
let(:rows) { example.last(row_number) }
|
16
16
|
|
17
17
|
it "matches output" do
|
18
|
-
output_rows = `#{binary} #{example_path}`.split("\n").map(&:chomp)
|
18
|
+
output_rows = `#{binary} #{example_path}`.split("\n").map(&:chomp).map{|x| x.gsub("\\r", "\r")}
|
19
19
|
output_cols = output_rows.map(&:chars).transpose.map(&:join)
|
20
20
|
expect(output_rows.size).to eq(rows.size)
|
21
21
|
expect(output_cols.size).to eq(cols.size)
|
@@ -0,0 +1,23 @@
|
|
1
|
+
describe "Renzoku" do
|
2
|
+
it do
|
3
|
+
expect("renzoku").to have_output <<EOF
|
4
|
+
2 4 7 1 3 9.8 5.6
|
5
|
+
. . . .
|
6
|
+
6.5 8.9 4 1.2.3 7
|
7
|
+
. .
|
8
|
+
7 9 2 5.6 3.4 1 8
|
9
|
+
|
10
|
+
4 7.6 3.2 8 1 9 5
|
11
|
+
. . .
|
12
|
+
5 8 1 4 9 2 7.6 3
|
13
|
+
.
|
14
|
+
8 3.4 7 1 5.6 2 9
|
15
|
+
. .
|
16
|
+
1.2 9 6.5 7 3 8 4
|
17
|
+
. .
|
18
|
+
9 1 3 8.7.6.5.4 2
|
19
|
+
. .
|
20
|
+
3 6.5 2 8 4 9 7 1
|
21
|
+
EOF
|
22
|
+
end
|
23
|
+
end
|
@@ -0,0 +1,15 @@
|
|
1
|
+
describe "Sandwich Sudoku" do
|
2
|
+
it do
|
3
|
+
expect("sandwich_sudoku").to have_output <<EOF
|
4
|
+
4 8 5 6 7 9 3 2 1
|
5
|
+
3 2 9 5 8 1 6 4 7
|
6
|
+
7 1 6 2 3 4 5 9 8
|
7
|
+
1 7 2 9 5 3 8 6 4
|
8
|
+
6 9 4 8 1 2 7 3 5
|
9
|
+
8 5 3 7 4 6 9 1 2
|
10
|
+
5 3 1 4 9 7 2 8 6
|
11
|
+
9 6 8 1 2 5 4 7 3
|
12
|
+
2 4 7 3 6 8 1 5 9
|
13
|
+
EOF
|
14
|
+
end
|
15
|
+
end
|
@@ -0,0 +1,27 @@
|
|
1
|
+
describe "Star Battle" do
|
2
|
+
it do
|
3
|
+
expect("star_battle").to have_output <<EOF
|
4
|
+
+-+-+-+-+-+-+-+-+-+-+
|
5
|
+
| * |*|
|
6
|
+
+ +-+ +-+ + +
|
7
|
+
|*| | |*| | |
|
8
|
+
+ + + + +-+-+-+-+-+ +
|
9
|
+
| | | | * |* |
|
10
|
+
+-+ +-+ +-+-+ +-+ +
|
11
|
+
| *| |* | | |
|
12
|
+
+ +-+-+ +-+ + +-+-+-+
|
13
|
+
|*| | | | |*| |
|
14
|
+
+-+ +-+-+ + + + +
|
15
|
+
| * | | | *|
|
16
|
+
+ +-+-+-+-+ +-+ +
|
17
|
+
| | * |* | |
|
18
|
+
+ +-+-+-+ + +-+ +
|
19
|
+
| |* *| | | |
|
20
|
+
+-+ +-+-+-+ + + +
|
21
|
+
| | | | |*| |* |
|
22
|
+
+ +-+-+ + +-+ +-+-+
|
23
|
+
| * *| |
|
24
|
+
+-+-+-+-+-+-+-+-+-+-+
|
25
|
+
EOF
|
26
|
+
end
|
27
|
+
end
|
@@ -0,0 +1,25 @@
|
|
1
|
+
describe "Stitches" do
|
2
|
+
it do
|
3
|
+
expect("stitches").to have_output_no_color <<EOF
|
4
|
+
* *-*
|
5
|
+
|
|
6
|
+
* * *-* *-*
|
7
|
+
|
|
8
|
+
* * * *
|
9
|
+
| | |
|
10
|
+
* * * * * *
|
11
|
+
| | |
|
12
|
+
* * * *-* * *-*
|
13
|
+
|
|
14
|
+
* * * *
|
15
|
+
| | |
|
16
|
+
* * * * * *
|
17
|
+
| | |
|
18
|
+
* * * * * *-* *
|
19
|
+
| | |
|
20
|
+
* * * * *
|
21
|
+
| |
|
22
|
+
* *
|
23
|
+
EOF
|
24
|
+
end
|
25
|
+
end
|
@@ -0,0 +1,23 @@
|
|
1
|
+
describe "Suguru" do
|
2
|
+
it do
|
3
|
+
expect("suguru").to have_output <<EOF
|
4
|
+
+---+-----+
|
5
|
+
|1 3|1 4 3|
|
6
|
+
| | +---+
|
7
|
+
|2 6|5|6 2|
|
8
|
+
| | | |
|
9
|
+
|5 4|2|4 3|
|
10
|
+
+---+-+ |
|
11
|
+
|1 3 6|5 1|
|
12
|
+
| +-+---+
|
13
|
+
|2 4|1 2 7|
|
14
|
+
+-+ +-+ |
|
15
|
+
|1|5 7|6 4|
|
16
|
+
+-+---+ |
|
17
|
+
|2|3 4|5 3|
|
18
|
+
| | +---+
|
19
|
+
|1|5 1 2 6|
|
20
|
+
+-+-------+
|
21
|
+
EOF
|
22
|
+
end
|
23
|
+
end
|
@@ -0,0 +1,25 @@
|
|
1
|
+
describe "Yajilin" do
|
2
|
+
it do
|
3
|
+
expect("yajilin").to have_output <<EOF
|
4
|
+
* -* # * -* -* -* # * -*
|
5
|
+
| | | | | |
|
6
|
+
* * -* -* 2↓ # * -* -* *
|
7
|
+
| |
|
8
|
+
* -* # * -* -* -* # * -*
|
9
|
+
| | | |
|
10
|
+
* -* 2↑ * -* -* * 2↑ * #
|
11
|
+
| | | |
|
12
|
+
* * -* 1↓ # * * -* * -*
|
13
|
+
| | | | | |
|
14
|
+
* * * -* -* -* 1→ * # *
|
15
|
+
| | | |
|
16
|
+
* -* * -* -* -* -* * 0→ *
|
17
|
+
| | | |
|
18
|
+
0↑ # * 1← # 1↓ * -* # *
|
19
|
+
| |
|
20
|
+
* -* -* # * -* -* # 2← *
|
21
|
+
| | | |
|
22
|
+
* -* -* -* -* # * -* -* -*
|
23
|
+
EOF
|
24
|
+
end
|
25
|
+
end
|
@@ -0,0 +1,18 @@
|
|
1
|
+
module Z3
|
2
|
+
describe "interface" do
|
3
|
+
it "single variables" do
|
4
|
+
expect(Z3.Bool("a")).to be_same_as(Z3::BoolSort.new.var("a"))
|
5
|
+
expect(Z3.Int("b")).to be_same_as(Z3::IntSort.new.var("b"))
|
6
|
+
expect(Z3.Real("c")).to be_same_as(Z3::RealSort.new.var("c"))
|
7
|
+
expect(Z3.Bitvec("d", 32)).to be_same_as(Z3::BitvecSort.new(32).var("d"))
|
8
|
+
end
|
9
|
+
|
10
|
+
it "multiple variables" do
|
11
|
+
expect(Z3.Int(%W[x y z])).to be_same_as([
|
12
|
+
Z3::IntSort.new.var("x"),
|
13
|
+
Z3::IntSort.new.var("y"),
|
14
|
+
Z3::IntSort.new.var("z"),
|
15
|
+
])
|
16
|
+
end
|
17
|
+
end
|
18
|
+
end
|
data/spec/optimize_spec.rb
CHANGED
@@ -1,6 +1,8 @@
|
|
1
1
|
# Optimize and Model specs are codependent, so half of functionality of each is tested in other class's tests
|
2
|
+
|
3
|
+
# Disabled as it crashes on Z3 4.8.13
|
2
4
|
module Z3
|
3
|
-
|
5
|
+
xdescribe Optimize do
|
4
6
|
let(:optimize) { Optimize.new }
|
5
7
|
let(:a) { Z3.Int("a") }
|
6
8
|
let(:b) { Z3.Int("b") }
|
@@ -43,14 +45,14 @@ module Z3
|
|
43
45
|
# This is a very simple example of unknown satisfiablity
|
44
46
|
# so we might need more complex one in the future
|
45
47
|
# Unlike Z3::Solver, this is unknown even 4.6.0
|
46
|
-
it "
|
48
|
+
it "unknown satisfiability" do
|
47
49
|
optimize.assert a**3 == a
|
48
50
|
expect(optimize.check).to eq(:unknown)
|
49
51
|
expect{optimize.satisfiable?}.to raise_error("Satisfiability unknown")
|
50
52
|
expect{optimize.unsatisfiable?}.to raise_error("Satisfiability unknown")
|
51
53
|
end
|
52
54
|
|
53
|
-
it "
|
55
|
+
it "unknown satisfiability" do
|
54
56
|
optimize.assert a**a == a
|
55
57
|
expect(optimize.check).to eq(:unknown)
|
56
58
|
expect{optimize.satisfiable?}.to raise_error("Satisfiability unknown")
|
@@ -65,7 +67,7 @@ module Z3
|
|
65
67
|
expect(optimize.model[a].to_i).to eq 9
|
66
68
|
end
|
67
69
|
|
68
|
-
it "
|
70
|
+
it "minimize" do
|
69
71
|
optimize.assert a > 0
|
70
72
|
optimize.assert a < 10
|
71
73
|
optimize.minimize a
|
data/spec/printer_spec.rb
CHANGED
@@ -49,5 +49,35 @@ module Z3
|
|
49
49
|
expect((-a) + (-b)).to stringify("(-a) + (-b)")
|
50
50
|
end
|
51
51
|
end
|
52
|
+
|
53
|
+
describe "bitvector operations" do
|
54
|
+
let(:a) { Z3.Bitvec("a", 32) }
|
55
|
+
let(:b) { Z3.Bitvec("b", 32) }
|
56
|
+
|
57
|
+
it "unary operators" do
|
58
|
+
expect(~a).to stringify("~a")
|
59
|
+
expect(-a).to stringify("-a")
|
60
|
+
end
|
61
|
+
|
62
|
+
it "binary operators" do
|
63
|
+
expect(a + b).to stringify("a + b")
|
64
|
+
expect(a - b).to stringify("a - b")
|
65
|
+
expect(a & b).to stringify("a & b")
|
66
|
+
expect(a ^ b).to stringify("a ^ b")
|
67
|
+
expect(a | b).to stringify("a | b")
|
68
|
+
end
|
69
|
+
|
70
|
+
it "special operators" do
|
71
|
+
expect(a.rotate_left(3)).to stringify("rotate_left(a, 3)")
|
72
|
+
expect(a.rotate_right(4)).to stringify("rotate_right(a, 4)")
|
73
|
+
expect(a.unsigned_lshift(5)).to stringify("bvshl(a, 5)")
|
74
|
+
expect(a.signed_rshift(6)).to stringify("bvashr(a, 6)")
|
75
|
+
expect(a.unsigned_lshift(7)).to stringify("bvshl(a, 7)")
|
76
|
+
expect(a.extract(20, 5)).to stringify("extract(a, 20, 5)")
|
77
|
+
expect(a.zero_ext(4)).to stringify("zero_extend(a, 4)")
|
78
|
+
expect(a.sign_ext(4)).to stringify("sign_extend(a, 4)")
|
79
|
+
expect(a.concat(b)).to stringify("concat(a, b)")
|
80
|
+
end
|
81
|
+
end
|
52
82
|
end
|
53
83
|
end
|
data/spec/set_expr_spec.rb
CHANGED
@@ -1,3 +1,5 @@
|
|
1
|
+
# This test is really bad, all of these have multiple solutions.
|
2
|
+
# And it changes between Z3 versions
|
1
3
|
module Z3
|
2
4
|
describe SetExpr do
|
3
5
|
let(:sort) { SetSort.new(IntSort.new) }
|
@@ -21,13 +23,15 @@ module Z3
|
|
21
23
|
expect([
|
22
24
|
a.include?(1),
|
23
25
|
a.include?(2),
|
26
|
+
!a.include?(3),
|
27
|
+
!b.include?(1),
|
24
28
|
b.include?(2),
|
25
29
|
b.include?(3),
|
26
30
|
c == a.union(b),
|
27
31
|
]).to have_solution(
|
28
|
-
a => "store(
|
29
|
-
b => "store(
|
30
|
-
c => "
|
32
|
+
a => "store(const(true), 3, false)",
|
33
|
+
b => "store(const(true), 1, false)",
|
34
|
+
c => "map(store(const(true), 3, false), store(const(true), 1, false))",
|
31
35
|
)
|
32
36
|
end
|
33
37
|
|
@@ -41,9 +45,9 @@ module Z3
|
|
41
45
|
b.include?(3),
|
42
46
|
c == a.difference(b),
|
43
47
|
]).to have_solution(
|
44
|
-
a => "store(
|
48
|
+
a => "store(const(true), 3, false)",
|
45
49
|
b => "store(const(true), 1, false)",
|
46
|
-
c => "store(const(false), 1, true)",
|
50
|
+
c => "map(store(const(true), 3, false), store(const(false), 1, true))",
|
47
51
|
)
|
48
52
|
end
|
49
53
|
|
@@ -51,13 +55,15 @@ module Z3
|
|
51
55
|
expect([
|
52
56
|
a.include?(1),
|
53
57
|
a.include?(2),
|
58
|
+
!a.include?(3),
|
59
|
+
!b.include?(1),
|
54
60
|
b.include?(2),
|
55
61
|
b.include?(3),
|
56
62
|
c == a.intersection(b),
|
57
63
|
]).to have_solution(
|
58
|
-
a => "store(
|
59
|
-
b => "store(
|
60
|
-
c => "
|
64
|
+
a => "store(const(true), 3, false)",
|
65
|
+
b => "store(const(true), 1, false)",
|
66
|
+
c => "map(store(const(true), 3, false), store(const(true), 1, false))",
|
61
67
|
)
|
62
68
|
end
|
63
69
|
end
|
data/spec/solver_spec.rb
CHANGED
@@ -37,22 +37,21 @@ module Z3
|
|
37
37
|
solver.assert b >= 2
|
38
38
|
solver.assert Z3.Or(a == 2, a == -2)
|
39
39
|
stats = solver.statistics
|
40
|
-
|
41
|
-
expect(stats.keys).to match_array(["rlimit count", "max memory", "memory", "num allocs", "mk bool var"])
|
40
|
+
expect(stats.keys).to match_array(["rlimit count", "max memory", "memory", "num allocs"])
|
42
41
|
end
|
43
42
|
|
44
43
|
# This is a very simple example of unknown satisfiablity
|
45
44
|
# so we might need more complex one in the future
|
46
45
|
# This is now satisfiable in 4.6.0
|
47
46
|
if Z3.version >= "4.6"
|
48
|
-
it "
|
47
|
+
it "unknown satisfiability (until 4.6 fix)" do
|
49
48
|
solver.assert a**3 == a
|
50
49
|
expect(solver.check).to eq(:sat)
|
51
50
|
expect(solver).to be_satisfiable
|
52
51
|
expect(solver).to_not be_unsatisfiable
|
53
52
|
end
|
54
53
|
else
|
55
|
-
it "
|
54
|
+
it "unknown satisfiability (until 4.6 fix)" do
|
56
55
|
solver.assert a**3 == a
|
57
56
|
expect(solver.check).to eq(:unknown)
|
58
57
|
expect{solver.satisfiable?}.to raise_error("Satisfiability unknown")
|
@@ -60,7 +59,7 @@ module Z3
|
|
60
59
|
end
|
61
60
|
end
|
62
61
|
|
63
|
-
it "
|
62
|
+
it "unknown satisfiability" do
|
64
63
|
solver.assert a**a == a
|
65
64
|
expect(solver.check).to eq(:unknown)
|
66
65
|
expect{solver.satisfiable?}.to raise_error("Satisfiability unknown")
|
data/spec/spec_helper.rb
CHANGED
@@ -28,6 +28,21 @@ RSpec::Matchers.define :have_output do |expected|
|
|
28
28
|
match do |file_name|
|
29
29
|
executable_path = "#{__dir__}/../examples/#{file_name}"
|
30
30
|
actual = IO.popen("ruby -r./spec/coverage_helper #{executable_path}").read
|
31
|
+
@expected = expected.gsub(/ *$/, "")
|
32
|
+
@actual = actual.gsub(/ *$/, "")
|
33
|
+
@actual == @expected
|
34
|
+
end
|
35
|
+
|
36
|
+
failure_message do |actual|
|
37
|
+
"Expected:\n#{@expected.chomp}\nBut got:\n#{@actual}"
|
38
|
+
end
|
39
|
+
end
|
40
|
+
|
41
|
+
RSpec::Matchers.define :have_output_no_color do |expected|
|
42
|
+
match do |file_name|
|
43
|
+
executable_path = "#{__dir__}/../examples/#{file_name}"
|
44
|
+
actual = IO.popen("ruby -r./spec/coverage_helper #{executable_path}").read
|
45
|
+
actual = actual.gsub(/\e\[.*?m/, "")
|
31
46
|
actual.gsub(/ *$/, "") == expected.gsub(/ *$/, "")
|
32
47
|
end
|
33
48
|
end
|