ltl2tgba.test 7.16 KB
Newer Older
1
#!/bin/sh
2
# -*- coding: utf-8 -*-
3 4
# Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014, 2015 Laboratoire
# de Recherche et Développement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
5
# Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
6
# département Systèmes Répartis Coopératifs (SRC), Université Pierre
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
7 8 9 10 11 12
# et Marie Curie.
#
# This file is part of Spot, a model checking library.
#
# Spot is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by
13
# the Free Software Foundation; either version 3 of the License, or
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
14 15 16 17 18 19 20 21
# (at your option) any later version.
#
# Spot is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
# License for more details.
#
# You should have received a copy of the GNU General Public License
22
# along with this program.  If not, see <http://www.gnu.org/licenses/>.
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
23

24 25 26 27 28

. ./defs

set -e

29 30 31 32 33 34 35 36 37 38 39 40
cat >check.txt <<\EOF
a
a U b
X a
a & b & c
a | b | (c U (d & (g U (h ^ i))))
Xa & (b U !a) & (b U !a)
Fa & Xb & GFc & Gd
Fa & Xa & GFc & Gc
Fc & X(a | Xb) & GF(a | Xb) & Gc
a R (b R c)
(a U b) U (c U d)
41

42
((Xp2)U(X(1)))&(p1 R(p2 R p0))
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
{a*;c}<>->GFb
{((a*;b;c)*)&((b*;a;c)*)}<>->x
{(g;y;r)*}<>->x
G({(g;y;r)*}<>->x)
G({(a;b)*}<>->x)&G({(c;d)*}<>->y)
# try sub-braces
G({{a;b}*}[]->x)&G({{c;d}*}[]->y)
{([*0] + a):c*:([*0] + b)}<>->d
{a;e;f:(g*);h}<>->d
{(a:b)* & (c*:d)}<>->e
{(a:b)*}
G{(a:b)*}
{a;b}
{(a;b)*}
G{(a;b)*}
{a*}[]->{b*}
{a*}[]=>{b*}
{a*&b}
{a*&b*}
{((!c;b*) & d);e}
{(a* & (c;b*) & d);e}
{[*2];a[*2..4]}|->b
{a[*2..5] && b[*..3]}|->c
{{[+];a;[+]} && {[+];b;[+]}}<>->c
{(a[->3]) & {[+];b}}<>->c
69 70
# This formula (built by a random formula generator), exhibited an
# infinite recursion in the translation:
71
{(a|[*0])[*];1}
72 73
# Example from "Beyond Hardware Verification" by Glazberg, Moulin, Orni,
# Ruah, Zarpas (2007).
74
{[*];req;ack}|=>{start;busy[*];done}
75 76
# Examples from "Property-by-Example Guide: a Handbook of PSL Examples"
# by Ben David and Orni (2005)/
77 78 79 80 81 82
# - 2.27.A
{end[=3]}(false)
# - 3.5.A
{[*]; {read[=3]} && {write[=2]}} |=> {(!read && !write)[*]; ready}
# - 2.33  (abridged to fit in 80 cols)
{[*];st&&comp_d_en;!comp_d_en&&good_c;{st_v[->]}&&{stop[=0];true}}|->{!d_out}
83

84 85
# Some tricky cases that require the rational automaton to be pruned
# before it is used in the translation.
86 87
{{b[*];c} | {{a && !a}}[=2]}
{((a&!b);((!a&!b)*))&&(!b*;(!a&b))}
88 89 90
# When translating this formula, we expect the translator to ignore
# `a;(f&!f)[=2];c' on one side because it as already seen it on the
# other side.
91
{c;a;(f&!f)[=2];c}|{b;a;(!f&f)[=2];c}
92 93

# these were mis-translated in Spot 0.9
94 95 96 97 98 99
G!{(b;1)*;a}
(G!{(b;1)*;a} && ({1;1[*3]*}[]->{(b&!a)[*2];!b&!a}))
EOF

run 0 ../checkpsl check.txt

100 101 102
# Make sure False has one acceptance set when generating Büchi automata
test 1 -eq `../../bin/ltl2tgba -B false --stats %a`

103 104 105
# In particular, Spot 0.9 would incorrectly reject the sequence:
# (a̅b;a̅b;a̅b̅);(a̅b;a̅b;a̅b̅);(a̅b;a̅b;a̅b̅);... in 'G!{(b;1)*;a}'
# This means the following automaton was incorrectly empty in Spot 0.9.
106
run 0 ../ikwiad -e -R3 '(G!{(b;1)*;a} && ({1;1[*3]*}[]->{(b&!a)[*2];!b&!a}))'
107

108 109
# Make sure 'a U (b U c)' has 3 states and 6 transitions,
# before and after degeneralization.
110
for opt in '' -DT -DS; do
111
  ../ikwiad -ks -f -R3 $opt 'a U (b U c)' > stdout
112
  grep 'edges: 6$' stdout
113 114
  grep 'states: 3$' stdout
done
115 116 117

# Make sure '!(Ga U b)' has 3 states and 6 transitions,
# before and after degeneralization.
118
for opt in '' -DT -DS; do
119
  ../ikwiad -kt -f -R3 $opt '!(Ga U b)' > stdout
120 121
  grep 'transitions: 11$' stdout
  grep 'edges: 6$' stdout
122 123 124 125 126
  grep 'states: 3$' stdout
done

# Make sure 'Ga U b' has 4 states and 6 transitions,
# before and after degeneralization.
127
for opt in '' -DT -DS; do
128
  ../ikwiad -kt -f -R3 $opt 'Ga U b' > stdout
129 130
  grep 'transitions: 12$' stdout
  grep 'edges: 6$' stdout
131 132
  grep 'states: 4$' stdout
done
133 134 135 136

# Make sure '(G (p -> F q)) && ((X (p) U q) || ! X (p U (p && q)))'
# has 6 states and 15 transitions, before and after degeneralization.
f='(G (p -> F q)) && ((X (p) U q) || ! X (p U (p && q)))'
137
for opt in '' -DT -DS; do
138
  ../ikwiad -ks -f -R3 $opt "$f" > stdout
139
  grep 'edges: 15$' stdout
140
  grep 'states: 6$' stdout
141
  ../ikwiad -ks -f -R3f $opt "$f" > stdout
142
  grep 'edges: 15$' stdout
143
  grep 'states: 6$' stdout
144
done
145 146 147 148

# Make sure 'GFa & GFb & GFc & GFd & GFe & GFf'
# has 7 states and 34 transitions after degeneralization.
f='GFa & GFb & GFc & GFd & GFe & GFg'
149
../ikwiad -ks -DS -x -f "$f" > stdout
150
grep 'edges: 34$' stdout
151
grep 'states: 7$' stdout
152 153 154

# Make sure 'Ga & XXXX!a' is minimized to one state.
f='Ga & XXXX!a'
155
../ikwiad -ks -f "$f" > stdout
156
grep 'edges: 4$' stdout
157
grep 'states: 5$' stdout
158
../ikwiad -ks -Rm -f "$f" > stdout
159
grep 'edges: 0$' stdout
160
grep 'states: 1$' stdout
161 162

# Make sure a monitor for F(a & F(b)) accepts everything.
163
run 0 ../ikwiad -M -f "F(a & F(b))" | grep ' ->' > stdout
164
cat >expected <<EOF
165 166
  I -> 0
  0 -> 0 [label="1"]
167 168
EOF
cmp stdout expected
169 170

# This formula caused a segfault with Spot 0.7.
171
run 0 ../ikwiad -Rm -ks -f "Gq|Gr|(G(q|FGp)&G(r|FG!p))" >stdout
172
grep 'edges: 5$' stdout
173 174 175
grep 'states: 3$' stdout

# Adding -R3 used to make it work...
176
run 0 ../ikwiad -R3 -Rm -ks -f "Gq|Gr|(G(q|FGp)&G(r|FG!p))" >stdout
177
grep 'edges: 5$' stdout
178
grep 'states: 3$' stdout
179 180

# Make sure FGa|GFb has the same number of states/transitions when
181 182
# output as a never claim or are a degeneralized BA in HOAF.
# The option -R1q -R1t used to cause two degeneralizations to
183
# occur.
184 185 186 187
run 0 ../ikwiad -R1q -R1t -N 'FGa|FGb' > out.never
run 0 ../ikwiad -XN -kt out.never > count.never
run 0 ../ikwiad -R1q -R1t -DS -H 'FGa|FGb' > out.hoa
run 0 ../ikwiad -XH -kt out.hoa > count.hoa
188
cmp count.never count.hoa
189 190

# The following automaton should have only 4 states.
191
run 0 ../ikwiad -R3 -ks -f '(p&XF!p)|(!p&XFp)|X(Fp&F!p)' >stdout
192
grep 'edges: 7$' stdout
193
grep 'states: 4$' stdout
194 195 196 197 198

# A bug in the translation of !{xxx} when xxx reduces to false caused
# the following formula to be considered equivalent to anything...
../../bin/ltlfilt -f '!{[*2] && [*0..1]}' --equivalent-to 'false' && exit 1
../../bin/ltlfilt -f '!{[*2] && [*0..1]}' --equivalent-to 'true'
199 200 201 202 203 204 205 206

# Test some equivalences fixed in Spot 1.1.4
../../bin/ltlfilt    -f '{{a;b}[*]}'  --equivalent-to 'a & Xb'
../../bin/ltlfilt -r -f '{{a;b}[*]}'  --equivalent-to 'a & Xb'
../../bin/ltlfilt    -f '!{{a;b}[*]}' --equivalent-to '!a | X!b'
../../bin/ltlfilt -r -f '!{{a;b}[*]}' --equivalent-to '!a | X!b'
../../bin/ltlfilt    -f '{a[*];b[*]}' --equivalent-to 'a | b'
../../bin/ltlfilt -r -f '{a[*];b[*]}' --equivalent-to 'a | b'
207

208 209 210 211 212 213 214 215 216 217 218

# A couple of tests for the [:*i..j] operator
../../bin/ltlfilt -q    -f '{{a;b}[:*1..2];c}' \
		  --equivalent-to '(a&X(b&Xc)) | a&(X(b&a&X(b&Xc)))'
../../bin/ltlfilt -q -r -f '{{a;b}[:*1..2];c}' \
		  --equivalent-to '(a&X(b&Xc)) | a&(X(b&a&X(b&Xc)))'
../../bin/ltlfilt -q    -f '{{a*}[:+];c}' --equivalent-to 'Xc R a'
../../bin/ltlfilt -q -r -f '{{a*}[:+];c}' --equivalent-to 'Xc R a'
../../bin/ltlfilt -q    -f '{c && {b | [*0]}[:+]}' --equivalent-to 'c & b'
../../bin/ltlfilt -q -r -f '{c && {b | [*0]}[:+]}' --equivalent-to 'c & b'

219 220 221
# test unknown dot options
../../bin/ltl2tgba --dot=@ a 2>stderr && exit 1
grep 'ltl2tgba: unknown option.*@' stderr