Commit 405eec83 authored by Christian Müller's avatar Christian Müller
Browse files

fix a few things

parent 9a99c60c
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = red]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
1 [label = "Node 1:
True"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t2)(xat,pt) ∨
Read(t2)(xa...(1459 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
2 [label = "Node 2:
True"]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))))"]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = red]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
Review(t2)(xbt,pt,rt)) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
(Assign(t1)(xat,pt) ∨
...(1705 characters)"]
1 [label = "Node 1:
True"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t2)(xat,pt) ∨
Read(t2)(xa...(1459 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
2 [label = "Node 2:
True"]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = green]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = red]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
Review(t2)(xbt,pt,rt)) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
(Assign(t1)(xat,pt) ∨
...(1705 characters)"]
1 [label = "Node 1:
True"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t2)(xat,pt) ∨
Read(t2)(xa...(1459 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
2 [label = "Node 2:
True"]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = green]
}
\ No newline at end of file
digraph "Invariant Labelling" {
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = green]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
Review(t2)(xbt,pt,rt)) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
(Assign(t1)(xat,pt) ∨
...(1705 characters)"]
2 [label = "Node 2:
∀ xat:A,xbt:A,pt:P,rt:R. ((¬ Assign(t1)(xat,pt) ∨
¬ Assign(t1)(xbt,pt) ∨
¬ Oracle(t1)(xbt,pt,rt) ∨
(¬ Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt)) ∨
(Conf(t1)(xat,pt) ∧
Oracle(t2)(xbt,pt,rt))) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt) ∨
((Conf(t1)(xat,pt) ∨
¬ Oracle(t1)(xbt,pt,rt)) ∧
(¬ Conf(t1)(xat,pt) ∨
¬ Oracle(t2)(xbt,pt,rt))) ∨
(Assign(t1)(xat,pt) ∧
Assign(t1)(xbt,pt) ∧
((¬ Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt)) ∨
(Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt))))) ∧
(Assign(t1)(xat,pt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
(Assign(t1)(xat,pt) ∧
Assign(t1)(xbt,pt) ∧
((¬ Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt)) ∨
...(1413 characters)"]
1 [label = "Node 1:
True"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t2)(xat,pt) ∨
Read(t2)(xa...(1459 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = green]
}
\ No newline at end of file
digraph "Invariant Labelling" {
1 [label = "Node 1:
∀ xat:A,xbt:A,pt:P,rt:R. ((Conf(t2)(xat,pt) ∨
Conf(t2)(xbt,pt) ∨
¬ Conf(t1)(xbt,pt)) ∧
(Conf(t2)(xat,pt) ∨
Conf(t2)(xbt,pt) ∨
¬ Conf(t1)(xat,pt) ∨
¬ Oracle(t2)(xbt,pt,rt)) ∧
(Conf(t1)(xat,pt) ∨
Conf(t1)(xbt,pt) ∨
Oracle(t1)(xbt,pt,rt) ∨
Oracle(t2)(xbt,pt,rt) ∨
¬ Conf(t2)(xat,pt) ∨
¬ Conf(t2)(xbt,pt)))"]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = green]
0 [label = "Node 0:
True"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = green]
4 [label = "Node 4:
∀ xat:A,xbt:A,pt:P,rt:R. (Read(t1)(xat,xbt,pt,rt) ↔ eq())"]
2 -> 3 [label = "forall x:A,p:P,r:R
Assign(x,p) ∧ Oracle(x,p,r) → Review += (x,p,r);", color = green]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
3 [label = "Node 3:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
(Assign(t2)(xat,pt) ∧
Review(t2)(xbt,pt,rt))) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
((¬ Read(t1)(xat,xbt,pt,rt) ∧
(¬ Assign(t1)(xat,pt) ∨
¬ Review(t1)(xbt,pt,rt))) ∨
Read(t2)(xat,xbt,pt,rt) ∨
Review(t2)(xbt,pt,rt)) ∧
((¬ Read(t2)(xat,xbt,pt,rt) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt))) ∨
Read(t1)(xat,xbt,pt,rt) ∨
(Assign(t1)(xat,pt) ∧
Review(t1)(xbt,pt,rt))) ∧
(Assign(t1)(xat,pt) ∨
...(1705 characters)"]
2 [label = "Node 2:
∀ xat:A,xbt:A,pt:P,rt:R. ((¬ Assign(t1)(xat,pt) ∨
¬ Assign(t1)(xbt,pt) ∨
¬ Oracle(t1)(xbt,pt,rt) ∨
(¬ Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt)) ∨
(Conf(t1)(xat,pt) ∧
Oracle(t2)(xbt,pt,rt))) ∧
(¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt) ∨
((Conf(t1)(xat,pt) ∨
¬ Oracle(t1)(xbt,pt,rt)) ∧
(¬ Conf(t1)(xat,pt) ∨
¬ Oracle(t2)(xbt,pt,rt))) ∨
(Assign(t1)(xat,pt) ∧
Assign(t1)(xbt,pt) ∧
((¬ Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt)) ∨
(Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt))))) ∧
(Assign(t1)(xat,pt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
(Assign(t1)(xat,pt) ∧
Assign(t1)(xbt,pt) ∧
((¬ Conf(t1)(xat,pt) ∧
Oracle(t1)(xbt,pt,rt)) ∨
...(1413 characters)"]
5 [label = "Node 5:
∀ xat:A,xbt:A,pt:P,rt:R. ((Read(t1)(xat,xbt,pt,rt) ↔ eq()) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xat,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Assign(t2)(xbt,pt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Assign(t2)(xat,pt) ∨
¬ Review(t2)(xbt,pt,rt)) ∧
(Assign(t1)(xbt,pt) ∨
Read(t1)(xat,xbt,pt,rt) ∨
Review(t1)(xbt,pt,rt) ∨
¬ Read(t2)(xat,xbt,pt,rt)) ∧
(Assign(t2)(xat,pt) ∨
Read(t2)(xa...(1459 characters)"]
3 -> 4 [label = "forall
", color = green]
4 -> 4 [label = "forall
", color = green]
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = green]
}
\ No newline at end of file
digraph "Invariant Labelling" {
3 -> 5 [label = "forall xa:A,xb:A,p:P,r:R
Assign(xa,p) ∧ Review(xb,p,r) → Read += (xa,xb,p,r);", color = red]
3 -> 4 [label = "forall
", color = red]
5 [label = "Node 5:
5"]
4 [label = "Node 4:
4"]
5 -> 3 [label = "forall x:A,p:P,r:R may (Some(choice2))
Assign(x,p) → Review += (x,p,r);", color = red]
1 -> 2 [label = "forall x:A,p:P may (Some(choice1))
¬ Conf(x,p) → Assign += (x,p);", color = red]
0 -> 1 [label = "forall x:A,p:P may (Some(choice0))
True → Conf += (x,p);", color = red]
2 -> 3 [label = "forall x:A,p:P,r:R may (Some(Oracle))
Assign(x,p) → Review += (x,p,r);", color = red]
4 -> 4 [label = "forall
", color = red]
2 [label = "Node 2:
2"]
1 [label = "Node 1:
1"]
0 [label = "Node 0:
0"]
3 [label = "Node 3:
3"]
}
\ No newline at end of file
Name: nonomitting/fixedarity10
Description: alleq
Invariant:
∀ it:T,jt:T. (B(t1)(it,jt) ↔ B(t2)(it,jt)) ∧
∀ it:T,jt:T. (D(t1)(it,jt) ↔ D(t2)(it,jt)) ∧
∀ it:T,jt:T. (G(t1)(it,jt) ↔ G(t2)(it,jt)) ∧
∀ it:T,jt:T. (A(t1)(it,jt) ↔ A(t2)(it,jt)) ∧
∀ it:T,jt:T. (E(t1)(it,jt) ↔ E(t2)(it,jt)) ∧
∀ it:T,jt:T. (I(t1)(it,jt) ↔ I(t2)(it,jt)) ∧
∀ it:T,jt:T. (H(t1)(it,jt) ↔ H(t2)(it,jt)) ∧
∀ it:T,jt:T. (F(t1)(it,jt) ↔ F(t2)(it,jt)) ∧
∀ it:T,jt:T. (J(t1)(it,jt) ↔ J(t2)(it,jt)) ∧
∀ it:T,jt:T. (C(t1)(it,jt) ↔ C(t2)(it,jt))
∀ it:T,jt:T. (B(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (D(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (G(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (A(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (E(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (I(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (H(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (F(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (J(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (C(t1)(it,jt) ↔ eq())
Model: stubborn
Result: not inductive
WF size: 10
Time: 507 ms
Time: 742 ms
Proof steps: 11
Strengthenings: 0
Largest Inv: 40
......
Name: nonomitting/fixedarity10safe
Description: alleq
Invariant:
∀ it:T,jt:T. (B(t1)(it,jt) ↔ B(t2)(it,jt)) ∧
∀ it:T,jt:T. (D(t1)(it,jt) ↔ D(t2)(it,jt)) ∧
∀ it:T,jt:T. (G(t1)(it,jt) ↔ G(t2)(it,jt)) ∧
∀ it:T,jt:T. (A(t1)(it,jt) ↔ A(t2)(it,jt)) ∧
∀ it:T,jt:T. (E(t1)(it,jt) ↔ E(t2)(it,jt)) ∧
∀ it:T,jt:T. (I(t1)(it,jt) ↔ I(t2)(it,jt)) ∧
∀ it:T,jt:T. (H(t1)(it,jt) ↔ H(t2)(it,jt)) ∧
∀ it:T,jt:T. (F(t1)(it,jt) ↔ F(t2)(it,jt)) ∧
∀ it:T,jt:T. (J(t1)(it,jt) ↔ J(t2)(it,jt)) ∧
∀ it:T,jt:T. (C(t1)(it,jt) ↔ C(t2)(it,jt))
∀ it:T,jt:T. (B(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (D(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (G(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (A(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (E(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (I(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (H(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (F(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (J(t1)(it,jt) ↔ eq()) ∧
∀ it:T,jt:T. (C(t1)(it,jt) ↔ eq())
Model: stubborn
Result: inductive
WF size: 10
Time: 286 ms
Time: 534 ms
Proof steps: 12
Strengthenings: 0
Largest Inv: 40
......
Name: nonomitting/fixedarity15
Description: alleq
Invariant:
∀ it:T,jt:T. (L(t1)(it,jt) ↔ L(t2)(it,jt)) ∧
∀ it:T,jt:T. (B(t1)(it,jt) ↔ B(t2)(it,jt)) ∧
∀ it:T,jt:T. (N(t1)(it,jt) ↔ N(t2)(it,jt)) ∧
∀ it:T,jt:T. (D(t1)(it,jt) ↔ D(t2)(it,jt)) ∧
∀ it:T,jt:T. (G(t1)(it,jt) ↔ G(t2)(it,jt)) ∧
∀ it:T,jt:T. (A(t1)(it,jt) ↔ A(t2)(it,jt)) ∧
∀ it:T,jt:T. (K(t1)(it,jt) ↔ K(t2)(it,jt)) ∧
∀ it:T,jt:T. (M(t1)(it,jt) ↔ M(t2)(it,jt)) ∧
∀ it:T,jt:T. (E(t1)(it,jt) ↔ E(t2)(it,jt)) ∧
∀ it:T,jt:T. (I(t1)(it,jt) ↔