Benchmark
incremental/UFLRA/asasp/hierarchy_implicit/bench_1_1_13_random10.smt2
Generated with ASASP.
ASASP (http://st.fbk.eu/technologies/asasp) implements a symbolic reachability procedure
for the analysis of administrative access control policies. A more detailed description
of the benchmarks can be found in the following paper: Efficient Symbolic Automated Analysis
of Administrative Attribute-based RBAC-Policies, by F. Alberti, A. Armando, and S. Ranise, in
ASIACCS 2011. For info contact Francesco Alberti <francesco.alberti@usi.ch>
| Status | sat |
| Inferred Status | None |
| Size | 3831 |
| Compressed Size | 1052 |
| Max. Term Depth | 5 |
| Asserts | 43 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3832 |
| Compressed Size | 1052 |
| Max. Term Depth | 5 |
| Asserts | 43 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3957 |
| Compressed Size | 1089 |
| Max. Term Depth | 5 |
| Asserts | 43 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 6 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4036 |
| Compressed Size | 1111 |
| Max. Term Depth | 5 |
| Asserts | 44 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 7 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 4014 |
| Compressed Size | 1104 |
| Max. Term Depth | 5 |
| Asserts | 44 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 7 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3960 |
| Compressed Size | 1093 |
| Max. Term Depth | 5 |
| Asserts | 43 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 6 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4072 |
| Compressed Size | 1114 |
| Max. Term Depth | 5 |
| Asserts | 44 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 7 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4024 |
| Compressed Size | 1111 |
| Max. Term Depth | 5 |
| Asserts | 43 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 9 |
or | 4 |
and | 4 |
= | 39 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4227 |
| Compressed Size | 1143 |
| Max. Term Depth | 5 |
| Asserts | 44 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 13 |
or | 4 |
and | 5 |
= | 39 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4104 |
| Compressed Size | 1135 |
| Max. Term Depth | 5 |
| Asserts | 44 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 10 |
or | 4 |
and | 5 |
= | 40 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4079 |
| Compressed Size | 1125 |
| Max. Term Depth | 5 |
| Asserts | 44 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 10 |
or | 4 |
and | 4 |
= | 39 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |