Benchmark
incremental/UFLRA/asasp/hierarchy_implicit/bench_3_3_19_random1.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 | 3641 |
| Compressed Size | 1006 |
| Max. Term Depth | 5 |
| Asserts | 36 |
| 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 | 3642 |
| Compressed Size | 1008 |
| Max. Term Depth | 5 |
| Asserts | 36 |
| 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 | 3643 |
| Compressed Size | 1011 |
| Max. Term Depth | 5 |
| Asserts | 36 |
| 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 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3722 |
| Compressed Size | 1030 |
| Max. Term Depth | 5 |
| Asserts | 37 |
| 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 | 4 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 3700 |
| Compressed Size | 1032 |
| Max. Term Depth | 5 |
| Asserts | 37 |
| 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 | 4 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3646 |
| Compressed Size | 1015 |
| Max. Term Depth | 5 |
| Asserts | 36 |
| 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 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3758 |
| Compressed Size | 1038 |
| Max. Term Depth | 5 |
| Asserts | 37 |
| 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 | 4 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3669 |
| Compressed Size | 1022 |
| Max. Term Depth | 5 |
| Asserts | 36 |
| 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 |
= | 37 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3748 |
| Compressed Size | 1039 |
| Max. Term Depth | 5 |
| Asserts | 37 |
| 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 | 4 |
or | 4 |
and | 5 |
= | 37 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3749 |
| Compressed Size | 1042 |
| Max. Term Depth | 5 |
| Asserts | 37 |
| 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 | 4 |
or | 4 |
and | 5 |
= | 38 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 3724 |
| Compressed Size | 1038 |
| Max. Term Depth | 5 |
| Asserts | 37 |
| 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 | 4 |
or | 4 |
and | 4 |
= | 37 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |