About the Execution of 2023-gold for PermAdmissibility-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.544 | 3600000.00 | 5805511.00 | 40106.20 | TF?TTFFTTTFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422000118.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PermAdmissibility-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000118
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 15K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 12 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716870258945
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 04:24:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 04:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:24:22] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-28 04:24:22] [INFO ] Transformed 168 places.
[2024-05-28 04:24:22] [INFO ] Transformed 592 transitions.
[2024-05-28 04:24:22] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-PT-20-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 103 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 77 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2024-05-28 04:24:22] [INFO ] Computed 16 invariants in 37 ms
[2024-05-28 04:24:22] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-28 04:24:22] [INFO ] Invariant cache hit.
[2024-05-28 04:24:23] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-28 04:24:23] [INFO ] Invariant cache hit.
[2024-05-28 04:24:23] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1228 ms. Remains : 104/168 places, 592/592 transitions.
Support contains 103 out of 104 places after structural reductions.
[2024-05-28 04:24:24] [INFO ] Flatten gal took : 128 ms
[2024-05-28 04:24:24] [INFO ] Flatten gal took : 85 ms
[2024-05-28 04:24:24] [INFO ] Input system was already deterministic with 592 transitions.
Finished random walk after 6907 steps, including 20 resets, run visited all 24 properties in 110 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-PT-20-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.7 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Applied a total of 1 rules in 49 ms. Remains 86 /104 variables (removed 18) and now considering 464/592 (removed 128) transitions.
// Phase 1: matrix 464 rows 86 cols
[2024-05-28 04:24:25] [INFO ] Computed 14 invariants in 12 ms
[2024-05-28 04:24:25] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-28 04:24:25] [INFO ] Invariant cache hit.
[2024-05-28 04:24:25] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-28 04:24:25] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-28 04:24:25] [INFO ] Invariant cache hit.
[2024-05-28 04:24:26] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/104 places, 464/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 908 ms. Remains : 86/104 places, 464/592 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 193 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s11 1) (LT s17 1)) (OR (LT s6 1) (LT s13 1) (LT s17 1)) (OR (LT s5 1) (LT s16 1) (LT s17 1)) (OR (LT s8 1) (LT s10 1) (LT s17 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 355 reset in 1702 ms.
Product exploration explored 100000 steps with 355 reset in 1602 ms.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-00 finished in 4662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 35 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Applied a total of 1 rules in 33 ms. Remains 86 /104 variables (removed 18) and now considering 464/592 (removed 128) transitions.
[2024-05-28 04:24:29] [INFO ] Invariant cache hit.
[2024-05-28 04:24:29] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 04:24:29] [INFO ] Invariant cache hit.
[2024-05-28 04:24:30] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-28 04:24:30] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 04:24:30] [INFO ] Invariant cache hit.
[2024-05-28 04:24:30] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/104 places, 464/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 780 ms. Remains : 86/104 places, 464/592 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s20 1) (LT s23 1) (LT s24 1)) (OR (LT s20 1) (LT s21 1) (LT s26 1)) (OR (LT s20 1) (LT s21 1) (LT s25 1)) (OR (LT s20 1) (LT s21 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 6 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-01 finished in 945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 18 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 68 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 68 transition count 234
Applied a total of 72 rules in 29 ms. Remains 68 /104 variables (removed 36) and now considering 234/592 (removed 358) transitions.
// Phase 1: matrix 234 rows 68 cols
[2024-05-28 04:24:30] [INFO ] Computed 16 invariants in 4 ms
[2024-05-28 04:24:30] [INFO ] Implicit Places using invariants in 117 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/104 places, 234/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 66/104 places, 234/592 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s51 1) (GEQ s55 1)) (AND (GEQ s28 1) (GEQ s31 1) (GEQ s55 1)) (AND (GEQ s20 1) (GEQ s52 1) (GEQ s55 1)) (AND (GEQ s20 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2540 reset in 1114 ms.
Product exploration explored 100000 steps with 2549 reset in 1129 ms.
Computed a total of 66 stabilizing places and 234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 211 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 234 rows 66 cols
[2024-05-28 04:24:33] [INFO ] Computed 14 invariants in 5 ms
[2024-05-28 04:24:34] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 32 ms returned sat
[2024-05-28 04:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:24:34] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-28 04:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:24:35] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 14 ms returned sat
[2024-05-28 04:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:24:35] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-28 04:24:35] [INFO ] Computed and/alt/rep : 31/197/31 causal constraints (skipped 199 transitions) in 42 ms.
[2024-05-28 04:24:35] [INFO ] Added : 20 causal constraints over 4 iterations in 177 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 234/234 transitions.
Graph (complete) has 349 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 54 transition count 210
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 54 transition count 210
Applied a total of 9 rules in 12 ms. Remains 54 /66 variables (removed 12) and now considering 210/234 (removed 24) transitions.
// Phase 1: matrix 210 rows 54 cols
[2024-05-28 04:24:35] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 04:24:35] [INFO ] Implicit Places using invariants in 77 ms returned [17, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/66 places, 210/234 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 209
Applied a total of 2 rules in 13 ms. Remains 51 /52 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 51 cols
[2024-05-28 04:24:35] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 04:24:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 04:24:35] [INFO ] Invariant cache hit.
[2024-05-28 04:24:35] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/66 places, 209/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 302 ms. Remains : 51/66 places, 209/234 transitions.
Computed a total of 51 stabilizing places and 209 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 209
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 190 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=95 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-28 04:24:36] [INFO ] Invariant cache hit.
[2024-05-28 04:24:36] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-28 04:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:24:36] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-28 04:24:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:24:37] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-28 04:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:24:37] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-28 04:24:37] [INFO ] Computed and/alt/rep : 92/752/92 causal constraints (skipped 113 transitions) in 29 ms.
[2024-05-28 04:24:37] [INFO ] Added : 31 causal constraints over 9 iterations in 227 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2167 reset in 1056 ms.
Product exploration explored 100000 steps with 2169 reset in 1082 ms.
Built C files in :
/tmp/ltsmin14539699494863903268
[2024-05-28 04:24:39] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2024-05-28 04:24:39] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:39] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2024-05-28 04:24:39] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:39] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2024-05-28 04:24:39] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:39] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14539699494863903268
Running compilation step : cd /tmp/ltsmin14539699494863903268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 922 ms.
Running link step : cd /tmp/ltsmin14539699494863903268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14539699494863903268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5286926058672996311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 17 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 209/209 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 51 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 208
Applied a total of 2 rules in 10 ms. Remains 50 /51 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 50 cols
[2024-05-28 04:24:54] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 04:24:54] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-28 04:24:54] [INFO ] Invariant cache hit.
[2024-05-28 04:24:55] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-28 04:24:55] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-28 04:24:55] [INFO ] Invariant cache hit.
[2024-05-28 04:24:55] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/51 places, 208/209 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 728 ms. Remains : 50/51 places, 208/209 transitions.
Built C files in :
/tmp/ltsmin11566472807923160014
[2024-05-28 04:24:55] [INFO ] Computing symmetric may disable matrix : 208 transitions.
[2024-05-28 04:24:55] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:55] [INFO ] Computing symmetric may enable matrix : 208 transitions.
[2024-05-28 04:24:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:55] [INFO ] Computing Do-Not-Accords matrix : 208 transitions.
[2024-05-28 04:24:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:24:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11566472807923160014
Running compilation step : cd /tmp/ltsmin11566472807923160014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 687 ms.
Running link step : cd /tmp/ltsmin11566472807923160014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11566472807923160014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13677166730098634916.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 04:25:10] [INFO ] Flatten gal took : 18 ms
[2024-05-28 04:25:10] [INFO ] Flatten gal took : 33 ms
[2024-05-28 04:25:10] [INFO ] Time to serialize gal into /tmp/LTL9513248226525753160.gal : 4 ms
[2024-05-28 04:25:10] [INFO ] Time to serialize properties into /tmp/LTL18137590331934326621.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9513248226525753160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10868108374315414800.hoa' '-atoms' '/tmp/LTL18137590331934326621.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18137590331934326621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10868108374315414800.hoa
Detected timeout of ITS tools.
[2024-05-28 04:25:26] [INFO ] Flatten gal took : 30 ms
[2024-05-28 04:25:26] [INFO ] Flatten gal took : 54 ms
[2024-05-28 04:25:26] [INFO ] Time to serialize gal into /tmp/LTL2299331601653428923.gal : 5 ms
[2024-05-28 04:25:26] [INFO ] Time to serialize properties into /tmp/LTL17982625936227218581.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2299331601653428923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17982625936227218581.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c...5669
Formula 0 simplified : XG!"(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c16>...5659
Detected timeout of ITS tools.
[2024-05-28 04:25:41] [INFO ] Flatten gal took : 45 ms
[2024-05-28 04:25:41] [INFO ] Applying decomposition
[2024-05-28 04:25:41] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10776358174034309738.txt' '-o' '/tmp/graph10776358174034309738.bin' '-w' '/tmp/graph10776358174034309738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10776358174034309738.bin' '-l' '-1' '-v' '-w' '/tmp/graph10776358174034309738.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:25:41] [INFO ] Decomposing Gal with order
[2024-05-28 04:25:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:25:41] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-28 04:25:41] [INFO ] Flatten gal took : 161 ms
[2024-05-28 04:25:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 34 ms.
[2024-05-28 04:25:41] [INFO ] Time to serialize gal into /tmp/LTL5244569991984659649.gal : 30 ms
[2024-05-28 04:25:41] [INFO ] Time to serialize properties into /tmp/LTL17638010557935016342.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5244569991984659649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17638010557935016342.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((u2.aux12_6>=1)&&(u2.aux10_6>=1))&&(u2.c16>=1))||(((u2.aux12_7>=1)&&(u2.aux10_0>=1))&&(u2.c16>=1)))||((((u2.aux12_3>=...6821
Formula 0 simplified : XG!"(((((((((u2.aux12_6>=1)&&(u2.aux10_6>=1))&&(u2.c16>=1))||(((u2.aux12_7>=1)&&(u2.aux10_0>=1))&&(u2.c16>=1)))||((((u2.aux12_3>=1)&...6811
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14612944577633252900
[2024-05-28 04:25:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14612944577633252900
Running compilation step : cd /tmp/ltsmin14612944577633252900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin14612944577633252900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14612944577633252900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-LTLFireability-02 finished in 101225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||F(p2)))'
Support contains 31 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 64 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 64 transition count 218
Applied a total of 80 rules in 18 ms. Remains 64 /104 variables (removed 40) and now considering 218/592 (removed 374) transitions.
// Phase 1: matrix 218 rows 64 cols
[2024-05-28 04:26:11] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 04:26:11] [INFO ] Implicit Places using invariants in 88 ms returned [0, 5, 19, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 218/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 60/104 places, 218/592 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s20 1) (GEQ s36 1)) (AND (GEQ s17 1) (GEQ s29 1) (GEQ s39 1)) (AND (GEQ s17 1) (GEQ s21 1) (GEQ s47 1)) (AND (GEQ s17 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15020 reset in 505 ms.
Product exploration explored 100000 steps with 15135 reset in 514 ms.
Computed a total of 60 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 685 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 15 factoid took 930 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
// Phase 1: matrix 218 rows 60 cols
[2024-05-28 04:26:15] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 04:26:15] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-28 04:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:15] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-28 04:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:26:15] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 10 ms returned sat
[2024-05-28 04:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:15] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-28 04:26:15] [INFO ] Computed and/alt/rep : 29/177/29 causal constraints (skipped 185 transitions) in 32 ms.
[2024-05-28 04:26:15] [INFO ] Added : 20 causal constraints over 5 iterations in 195 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 218/218 transitions.
Graph (complete) has 329 edges and 60 vertex of which 50 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 8 ms. Remains 50 /60 variables (removed 10) and now considering 208/218 (removed 10) transitions.
// Phase 1: matrix 208 rows 50 cols
[2024-05-28 04:26:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 04:26:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 04:26:15] [INFO ] Invariant cache hit.
[2024-05-28 04:26:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-28 04:26:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:26:15] [INFO ] Invariant cache hit.
[2024-05-28 04:26:16] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/60 places, 208/218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 50/60 places, 208/218 transitions.
Computed a total of 50 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 208
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p2)]
[2024-05-28 04:26:16] [INFO ] Invariant cache hit.
[2024-05-28 04:26:16] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 10 ms returned sat
[2024-05-28 04:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:16] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 04:26:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:26:16] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-28 04:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:17] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 04:26:17] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 176 transitions) in 20 ms.
[2024-05-28 04:26:17] [INFO ] Added : 15 causal constraints over 4 iterations in 91 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 60 ms :[(NOT p2)]
Product exploration explored 100000 steps with 15085 reset in 271 ms.
Product exploration explored 100000 steps with 15088 reset in 292 ms.
Built C files in :
/tmp/ltsmin8186415257089206814
[2024-05-28 04:26:17] [INFO ] Computing symmetric may disable matrix : 208 transitions.
[2024-05-28 04:26:17] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:17] [INFO ] Computing symmetric may enable matrix : 208 transitions.
[2024-05-28 04:26:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:17] [INFO ] Computing Do-Not-Accords matrix : 208 transitions.
[2024-05-28 04:26:17] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:17] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8186415257089206814
Running compilation step : cd /tmp/ltsmin8186415257089206814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 631 ms.
Running link step : cd /tmp/ltsmin8186415257089206814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8186415257089206814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10492892951013673430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 208/208 transitions.
Graph (complete) has 233 edges and 50 vertex of which 12 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 192 output transitions
Drop transitions removed 192 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 10 transition count 10
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 9 transition count 10
Applied a total of 6 rules in 5 ms. Remains 9 /50 variables (removed 41) and now considering 10/208 (removed 198) transitions.
// Phase 1: matrix 10 rows 9 cols
[2024-05-28 04:26:32] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 04:26:32] [INFO ] Implicit Places using invariants in 32 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/50 places, 10/208 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 8
Applied a total of 2 rules in 3 ms. Remains 6 /8 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-28 04:26:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 04:26:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 04:26:32] [INFO ] Invariant cache hit.
[2024-05-28 04:26:32] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/50 places, 8/208 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 6/50 places, 8/208 transitions.
Built C files in :
/tmp/ltsmin9533569745467754578
[2024-05-28 04:26:33] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-28 04:26:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:33] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-28 04:26:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:33] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-28 04:26:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9533569745467754578
Running compilation step : cd /tmp/ltsmin9533569745467754578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin9533569745467754578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9533569745467754578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13732493360555440745.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-20-LTLFireability-04 finished in 21343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 6 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.2 ms
Discarding 98 places :
Also discarding 584 output transitions
Drop transitions removed 584 transitions
Applied a total of 1 rules in 4 ms. Remains 6 /104 variables (removed 98) and now considering 8/592 (removed 584) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-28 04:26:33] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 04:26:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 04:26:33] [INFO ] Invariant cache hit.
[2024-05-28 04:26:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-28 04:26:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:26:33] [INFO ] Invariant cache hit.
[2024-05-28 04:26:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/104 places, 8/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 6/104 places, 8/592 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s3 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 170 steps with 25 reset in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-05 finished in 168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U X(!p1))||X(X(p2))))))'
Support contains 12 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 154
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 146
Applied a total of 86 rules in 14 ms. Remains 61 /104 variables (removed 43) and now considering 146/592 (removed 446) transitions.
// Phase 1: matrix 146 rows 61 cols
[2024-05-28 04:26:33] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 04:26:33] [INFO ] Implicit Places using invariants in 77 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 60/104 places, 146/592 transitions.
Stuttering acceptance computed with spot in 433 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p1 p2), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=8 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=9 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s25 1) (GEQ s39 1)), p1:(AND (GEQ s11 1) (GEQ s14 1) (GEQ s27 1)), p2:(AND (OR (LT s43 1) (LT s44 1) (LT s54 1)) (OR (LT s1 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33376 reset in 182 ms.
Product exploration explored 100000 steps with 33199 reset in 200 ms.
Computed a total of 60 stabilizing places and 146 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 146
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 10 states, 34 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-08 finished in 1024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(p0)))||(X(X(X(X(!p0)))) U p1)))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 59 transition count 128
Applied a total of 90 rules in 7 ms. Remains 59 /104 variables (removed 45) and now considering 128/592 (removed 464) transitions.
// Phase 1: matrix 128 rows 59 cols
[2024-05-28 04:26:34] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 04:26:34] [INFO ] Implicit Places using invariants in 86 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/104 places, 128/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 58/104 places, 128/592 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s8 1)), p0:(OR (LT s15 1) (LT s18 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2466 reset in 511 ms.
Product exploration explored 100000 steps with 2473 reset in 522 ms.
Computed a total of 58 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 128
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-09 finished in 1519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 22 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.3 ms
Discarding 82 places :
Also discarding 544 output transitions
Drop transitions removed 544 transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 19 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 19 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 17 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 17 transition count 20
Applied a total of 11 rules in 8 ms. Remains 17 /104 variables (removed 87) and now considering 20/592 (removed 572) transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-05-28 04:26:35] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 04:26:35] [INFO ] Implicit Places using invariants in 39 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/104 places, 20/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49 ms. Remains : 15/104 places, 20/592 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-12 finished in 99 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 59 transition count 128
Applied a total of 90 rules in 16 ms. Remains 59 /104 variables (removed 45) and now considering 128/592 (removed 464) transitions.
// Phase 1: matrix 128 rows 59 cols
[2024-05-28 04:26:36] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 04:26:36] [INFO ] Implicit Places using invariants in 103 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/104 places, 128/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 58/104 places, 128/592 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-13 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X(!p0)))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 54 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 54 transition count 98
Applied a total of 100 rules in 7 ms. Remains 54 /104 variables (removed 50) and now considering 98/592 (removed 494) transitions.
// Phase 1: matrix 98 rows 54 cols
[2024-05-28 04:26:36] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 04:26:36] [INFO ] Implicit Places using invariants in 82 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/104 places, 98/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 52/104 places, 98/592 transitions.
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s18 1) (GEQ s27 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Computed a total of 52 stabilizing places and 98 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 98
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-14 finished in 724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G((p2&&X((p2 U (!p3||G(p2)))))))))'
Support contains 12 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions removed 256 transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 44 transition count 96
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 44 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 53 place count 40 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 57 place count 40 transition count 68
Applied a total of 57 rules in 13 ms. Remains 40 /104 variables (removed 64) and now considering 68/592 (removed 524) transitions.
// Phase 1: matrix 68 rows 40 cols
[2024-05-28 04:26:37] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 04:26:37] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 04:26:37] [INFO ] Invariant cache hit.
[2024-05-28 04:26:37] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-28 04:26:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:26:37] [INFO ] Invariant cache hit.
[2024-05-28 04:26:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/104 places, 68/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 40/104 places, 68/592 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s12 1) (GEQ s28 1)) (AND (GEQ s22 1) (GEQ s25 1) (GEQ s34 1))), p1:(AND (GEQ s32 1) (GEQ s37 1) (GEQ s38 1)), p2:(OR (LT s9 1...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 414 reset in 693 ms.
Product exploration explored 100000 steps with 414 reset in 726 ms.
Computed a total of 40 stabilizing places and 68 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 68
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 31 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-15 finished in 1882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : PermAdmissibility-PT-20-LTLFireability-02
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 18 out of 104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions removed 256 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 210
Applied a total of 29 rules in 9 ms. Remains 54 /104 variables (removed 50) and now considering 210/592 (removed 382) transitions.
// Phase 1: matrix 210 rows 54 cols
[2024-05-28 04:26:39] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 04:26:39] [INFO ] Implicit Places using invariants in 78 ms returned [17, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 52/104 places, 210/592 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 209
Applied a total of 2 rules in 5 ms. Remains 51 /52 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 51 cols
[2024-05-28 04:26:39] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 04:26:39] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 04:26:39] [INFO ] Invariant cache hit.
[2024-05-28 04:26:39] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 51/104 places, 209/592 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 440 ms. Remains : 51/104 places, 209/592 transitions.
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s38 1) (GEQ s41 1)) (AND (GEQ s18 1) (GEQ s21 1) (GEQ s41 1)) (AND (GEQ s12 1) (GEQ s39 1) (GEQ s41 1)) (AND (GEQ s12 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2144 reset in 1029 ms.
Product exploration explored 100000 steps with 2139 reset in 1067 ms.
Computed a total of 51 stabilizing places and 209 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 209
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 190 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=190 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
[2024-05-28 04:26:42] [INFO ] Invariant cache hit.
[2024-05-28 04:26:43] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 6 ms returned sat
[2024-05-28 04:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:43] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-28 04:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:26:43] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-28 04:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:43] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 04:26:43] [INFO ] Computed and/alt/rep : 92/752/92 causal constraints (skipped 113 transitions) in 45 ms.
[2024-05-28 04:26:44] [INFO ] Added : 31 causal constraints over 9 iterations in 404 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2024-05-28 04:26:44] [INFO ] Invariant cache hit.
[2024-05-28 04:26:44] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 04:26:44] [INFO ] Invariant cache hit.
[2024-05-28 04:26:44] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-28 04:26:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:26:44] [INFO ] Invariant cache hit.
[2024-05-28 04:26:44] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 51/51 places, 209/209 transitions.
Computed a total of 51 stabilizing places and 209 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 209
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 190 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=190 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-28 04:26:45] [INFO ] Invariant cache hit.
[2024-05-28 04:26:45] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 7 ms returned sat
[2024-05-28 04:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:45] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-28 04:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:26:46] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 8 ms returned sat
[2024-05-28 04:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 04:26:46] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-28 04:26:46] [INFO ] Computed and/alt/rep : 92/752/92 causal constraints (skipped 113 transitions) in 35 ms.
[2024-05-28 04:26:46] [INFO ] Added : 31 causal constraints over 9 iterations in 248 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2150 reset in 1087 ms.
Product exploration explored 100000 steps with 2191 reset in 1085 ms.
Built C files in :
/tmp/ltsmin9428485341557169512
[2024-05-28 04:26:48] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2024-05-28 04:26:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:48] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2024-05-28 04:26:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:48] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2024-05-28 04:26:49] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:26:49] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9428485341557169512
Running compilation step : cd /tmp/ltsmin9428485341557169512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 738 ms.
Running link step : cd /tmp/ltsmin9428485341557169512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9428485341557169512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10050891976481754080.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 17 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 209/209 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 51 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 208
Applied a total of 2 rules in 8 ms. Remains 50 /51 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 50 cols
[2024-05-28 04:27:04] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 04:27:04] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 04:27:04] [INFO ] Invariant cache hit.
[2024-05-28 04:27:04] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-28 04:27:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 04:27:04] [INFO ] Invariant cache hit.
[2024-05-28 04:27:04] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/51 places, 208/209 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 50/51 places, 208/209 transitions.
Built C files in :
/tmp/ltsmin13451514750513812952
[2024-05-28 04:27:04] [INFO ] Computing symmetric may disable matrix : 208 transitions.
[2024-05-28 04:27:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:27:04] [INFO ] Computing symmetric may enable matrix : 208 transitions.
[2024-05-28 04:27:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:27:04] [INFO ] Computing Do-Not-Accords matrix : 208 transitions.
[2024-05-28 04:27:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:27:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13451514750513812952
Running compilation step : cd /tmp/ltsmin13451514750513812952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 718 ms.
Running link step : cd /tmp/ltsmin13451514750513812952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13451514750513812952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1959389893656730036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 04:27:19] [INFO ] Flatten gal took : 14 ms
[2024-05-28 04:27:19] [INFO ] Flatten gal took : 13 ms
[2024-05-28 04:27:19] [INFO ] Time to serialize gal into /tmp/LTL17330479460458856587.gal : 4 ms
[2024-05-28 04:27:19] [INFO ] Time to serialize properties into /tmp/LTL2615484592167403393.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17330479460458856587.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9737832756039217106.hoa' '-atoms' '/tmp/LTL2615484592167403393.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2615484592167403393.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9737832756039217106.hoa
Detected timeout of ITS tools.
[2024-05-28 04:27:34] [INFO ] Flatten gal took : 15 ms
[2024-05-28 04:27:34] [INFO ] Flatten gal took : 12 ms
[2024-05-28 04:27:34] [INFO ] Time to serialize gal into /tmp/LTL8230641212503480965.gal : 5 ms
[2024-05-28 04:27:34] [INFO ] Time to serialize properties into /tmp/LTL12627627211030137017.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8230641212503480965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12627627211030137017.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c...5669
Formula 0 simplified : XG!"(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c16>...5659
Detected timeout of ITS tools.
[2024-05-28 04:27:49] [INFO ] Flatten gal took : 13 ms
[2024-05-28 04:27:49] [INFO ] Applying decomposition
[2024-05-28 04:27:49] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13060472703594774319.txt' '-o' '/tmp/graph13060472703594774319.bin' '-w' '/tmp/graph13060472703594774319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13060472703594774319.bin' '-l' '-1' '-v' '-w' '/tmp/graph13060472703594774319.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:27:49] [INFO ] Decomposing Gal with order
[2024-05-28 04:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:27:49] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-28 04:27:49] [INFO ] Flatten gal took : 25 ms
[2024-05-28 04:27:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-28 04:27:49] [INFO ] Time to serialize gal into /tmp/LTL8270346514345408730.gal : 4 ms
[2024-05-28 04:27:49] [INFO ] Time to serialize properties into /tmp/LTL17513149580609374203.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8270346514345408730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17513149580609374203.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((u2.aux12_6>=1)&&(u2.aux10_6>=1))&&(u2.c16>=1))||(((u2.aux12_7>=1)&&(u2.aux10_0>=1))&&(u2.c16>=1)))||((((u2.aux12_3>=...6821
Formula 0 simplified : XG!"(((((((((u2.aux12_6>=1)&&(u2.aux10_6>=1))&&(u2.c16>=1))||(((u2.aux12_7>=1)&&(u2.aux10_0>=1))&&(u2.c16>=1)))||((((u2.aux12_3>=1)&...6811
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3850814407994158770
[2024-05-28 04:28:04] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3850814407994158770
Running compilation step : cd /tmp/ltsmin3850814407994158770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 600 ms.
Running link step : cd /tmp/ltsmin3850814407994158770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3850814407994158770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-LTLFireability-02 finished in 100976 ms.
[2024-05-28 04:28:19] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
[2024-05-28 04:28:19] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin16887928050922584076
[2024-05-28 04:28:20] [INFO ] Flatten gal took : 31 ms
[2024-05-28 04:28:20] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2024-05-28 04:28:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:28:20] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2024-05-28 04:28:20] [INFO ] Computation of Complete enable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3207599119724314863.txt' '-o' '/tmp/graph3207599119724314863.bin' '-w' '/tmp/graph3207599119724314863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3207599119724314863.bin' '-l' '-1' '-v' '-w' '/tmp/graph3207599119724314863.weights' '-q' '0' '-e' '0.001'
[2024-05-28 04:28:20] [INFO ] Decomposing Gal with order
[2024-05-28 04:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 04:28:20] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2024-05-28 04:28:20] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 04:28:20] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16887928050922584076
Running compilation step : cd /tmp/ltsmin16887928050922584076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 04:28:20] [INFO ] Removed a total of 598 redundant transitions.
[2024-05-28 04:28:20] [INFO ] Flatten gal took : 140 ms
[2024-05-28 04:28:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 22 ms.
[2024-05-28 04:28:20] [INFO ] Time to serialize gal into /tmp/LTLFireability3353058259064229720.gal : 6 ms
[2024-05-28 04:28:20] [INFO ] Time to serialize properties into /tmp/LTLFireability1927170666699168782.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3353058259064229720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1927170666699168782.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((u0.aux12_6>=1)&&(u0.aux10_6>=1))&&(u0.c16>=1))||(((u0.aux12_7>=1)&&(u0.aux10_0>=1))&&(u0.c16>=1)))||((((u0.aux12_3>=...6821
Formula 0 simplified : XG!"(((((((((u0.aux12_6>=1)&&(u0.aux10_6>=1))&&(u0.c16>=1))||(((u0.aux12_7>=1)&&(u0.aux10_0>=1))&&(u0.c16>=1)))||((((u0.aux12_3>=1)&...6811
Compilation finished in 2670 ms.
Running link step : cd /tmp/ltsmin16887928050922584076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin16887928050922584076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.141: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.141: LTL layer: formula: (X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))
pins2lts-mc-linux64( 4/ 8), 0.141: "(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.142: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.204: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.208: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.264: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.349: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.351: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.353: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.445: DFS-FIFO for weak LTL, using special progress label 595
pins2lts-mc-linux64( 0/ 8), 0.445: There are 596 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.445: State length is 105, there are 597 groups
pins2lts-mc-linux64( 0/ 8), 0.446: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.446: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.446: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.446: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.435: ~63 levels ~960 states ~19216 transitions
pins2lts-mc-linux64( 4/ 8), 1.828: ~93 levels ~1920 states ~37928 transitions
pins2lts-mc-linux64( 4/ 8), 2.387: ~148 levels ~3840 states ~75344 transitions
pins2lts-mc-linux64( 5/ 8), 3.369: ~202 levels ~7680 states ~96296 transitions
pins2lts-mc-linux64( 4/ 8), 3.605: ~202 levels ~15360 states ~115552 transitions
pins2lts-mc-linux64( 4/ 8), 4.579: ~202 levels ~30720 states ~130288 transitions
pins2lts-mc-linux64( 4/ 8), 6.530: ~202 levels ~61440 states ~161416 transitions
pins2lts-mc-linux64( 2/ 8), 10.923: ~202 levels ~122880 states ~223384 transitions
pins2lts-mc-linux64( 1/ 8), 18.409: ~202 levels ~245760 states ~352480 transitions
pins2lts-mc-linux64( 4/ 8), 31.816: ~202 levels ~491520 states ~599104 transitions
pins2lts-mc-linux64( 1/ 8), 53.117: ~202 levels ~983040 states ~1107288 transitions
pins2lts-mc-linux64( 5/ 8), 74.392: ~202 levels ~1966080 states ~2114832 transitions
pins2lts-mc-linux64( 2/ 8), 102.618: ~202 levels ~3932160 states ~4158896 transitions
pins2lts-mc-linux64( 0/ 8), 162.183: ~202 levels ~7864320 states ~8118696 transitions
pins2lts-mc-linux64( 0/ 8), 280.283: ~202 levels ~15728640 states ~16317216 transitions
pins2lts-mc-linux64( 7/ 8), 518.632: ~202 levels ~31457280 states ~33068944 transitions
pins2lts-mc-linux64( 1/ 8), 637.476: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 640.729:
pins2lts-mc-linux64( 0/ 8), 640.729: mean standard work distribution: 0.6% (states) 0.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 640.729:
pins2lts-mc-linux64( 0/ 8), 640.729: Explored 38468459 states 40345148 transitions, fanout: 1.049
pins2lts-mc-linux64( 0/ 8), 640.729: Total exploration time 640.270 sec (637.160 sec minimum, 638.740 sec on average)
pins2lts-mc-linux64( 0/ 8), 640.729: States per second: 60082, Transitions per second: 63013
pins2lts-mc-linux64( 0/ 8), 640.729:
pins2lts-mc-linux64( 0/ 8), 640.729: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 640.729: Redundant explorations: -0.2471
pins2lts-mc-linux64( 0/ 8), 640.729:
pins2lts-mc-linux64( 0/ 8), 640.729: Queue width: 8B, total height: 1624, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 640.729: Tree memory: 550.2MB, 15.0 B/state, compr.: 3.5%
pins2lts-mc-linux64( 0/ 8), 640.729: Tree fill ratio (roots/leafs): 28.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 640.730: Stored 637 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 640.730: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 640.730: Est. total memory use: 550.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16887928050922584076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16887928050922584076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 04:49:42] [INFO ] Flatten gal took : 697 ms
[2024-05-28 04:49:42] [INFO ] Time to serialize gal into /tmp/LTLFireability17009353493720609084.gal : 100 ms
[2024-05-28 04:49:42] [INFO ] Time to serialize properties into /tmp/LTLFireability4879957371948653905.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17009353493720609084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4879957371948653905.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c...5669
Formula 0 simplified : XG!"(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c16>...5659
Detected timeout of ITS tools.
[2024-05-28 05:11:04] [INFO ] Flatten gal took : 821 ms
[2024-05-28 05:11:07] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-28 05:11:08] [INFO ] Transformed 104 places.
[2024-05-28 05:11:08] [INFO ] Transformed 592 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 05:11:08] [INFO ] Time to serialize gal into /tmp/LTLFireability4846959603853531428.gal : 18 ms
[2024-05-28 05:11:08] [INFO ] Time to serialize properties into /tmp/LTLFireability8513060652693376643.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4846959603853531428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8513060652693376643.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(F("(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c...5669
Formula 0 simplified : XG!"(((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c16>...5659
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5486380 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15779112 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PermAdmissibility-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422000118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;