About the Execution of ITS-Tools for HirschbergSinclair-PT-45
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12287.359 | 3600000.00 | 11633573.00 | 3430.50 | FTFFTTTF?FTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477500332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HirschbergSinclair-PT-45, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 9.8K Apr 29 16:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 16:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 16:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 16:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 616K May 10 09:34 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 HirschbergSinclair-PT-45-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652771450963
Running Version 202205111006
[2022-05-17 07:10:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 07:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:10:53] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2022-05-17 07:10:53] [INFO ] Transformed 1138 places.
[2022-05-17 07:10:53] [INFO ] Transformed 1042 transitions.
[2022-05-17 07:10:53] [INFO ] Parsed PT model containing 1138 places and 1042 transitions in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-45-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1093 transition count 1042
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 89 place count 1049 transition count 998
Iterating global reduction 1 with 44 rules applied. Total rules applied 133 place count 1049 transition count 998
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 176 place count 1006 transition count 955
Iterating global reduction 1 with 43 rules applied. Total rules applied 219 place count 1006 transition count 955
Applied a total of 219 rules in 817 ms. Remains 1006 /1138 variables (removed 132) and now considering 955/1042 (removed 87) transitions.
// Phase 1: matrix 955 rows 1006 cols
[2022-05-17 07:10:54] [INFO ] Computed 51 place invariants in 48 ms
[2022-05-17 07:10:55] [INFO ] Implicit Places using invariants in 1171 ms returned []
// Phase 1: matrix 955 rows 1006 cols
[2022-05-17 07:10:55] [INFO ] Computed 51 place invariants in 9 ms
[2022-05-17 07:10:59] [INFO ] Implicit Places using invariants and state equation in 3746 ms returned []
Implicit Place search using SMT with State Equation took 5048 ms to find 0 implicit places.
// Phase 1: matrix 955 rows 1006 cols
[2022-05-17 07:10:59] [INFO ] Computed 51 place invariants in 13 ms
[2022-05-17 07:11:00] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1138 places, 955/1042 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1138 places, 955/1042 transitions.
Support contains 37 out of 1006 places after structural reductions.
[2022-05-17 07:11:00] [INFO ] Flatten gal took : 163 ms
[2022-05-17 07:11:01] [INFO ] Flatten gal took : 94 ms
[2022-05-17 07:11:01] [INFO ] Input system was already deterministic with 955 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 955 rows 1006 cols
[2022-05-17 07:11:02] [INFO ] Computed 51 place invariants in 8 ms
[2022-05-17 07:11:02] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 250 ms returned sat
[2022-05-17 07:11:03] [INFO ] After 1720ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-17 07:11:04] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 244 ms returned sat
[2022-05-17 07:11:04] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-17 07:11:05] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-17 07:11:05] [INFO ] After 1488ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Graph (complete) has 1919 edges and 1006 vertex of which 980 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.9 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 980 transition count 510
Reduce places removed 419 places and 0 transitions.
Graph (complete) has 986 edges and 561 vertex of which 478 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.2 ms
Discarding 83 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 420 rules applied. Total rules applied 866 place count 478 transition count 510
Drop transitions removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 2 with 83 rules applied. Total rules applied 949 place count 478 transition count 427
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 951 place count 476 transition count 425
Iterating global reduction 3 with 2 rules applied. Total rules applied 953 place count 476 transition count 425
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 954 place count 476 transition count 424
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 816 edges and 475 vertex of which 473 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 956 place count 473 transition count 424
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 958 place count 473 transition count 422
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 976 place count 473 transition count 404
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 994 place count 455 transition count 404
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 7 with 43 rules applied. Total rules applied 1037 place count 412 transition count 361
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 7 with 204 rules applied. Total rules applied 1241 place count 386 transition count 183
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 8 with 178 rules applied. Total rules applied 1419 place count 208 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1419 place count 208 transition count 167
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1451 place count 192 transition count 167
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1452 place count 191 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1452 place count 191 transition count 166
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1454 place count 190 transition count 166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1460 place count 187 transition count 163
Applied a total of 1460 rules in 310 ms. Remains 187 /1006 variables (removed 819) and now considering 163/955 (removed 792) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/1006 places, 163/955 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Finished Best-First random walk after 179 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
FORMULA HirschbergSinclair-PT-45-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 1006 stabilizing places and 955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1006 transition count 955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-45-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&X(F(p0)))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1005 transition count 954
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1005 transition count 954
Applied a total of 2 rules in 237 ms. Remains 1005 /1006 variables (removed 1) and now considering 954/955 (removed 1) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2022-05-17 07:11:06] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:11:07] [INFO ] Implicit Places using invariants in 912 ms returned []
// Phase 1: matrix 954 rows 1005 cols
[2022-05-17 07:11:07] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:11:11] [INFO ] Implicit Places using invariants and state equation in 4223 ms returned []
Implicit Place search using SMT with State Equation took 5139 ms to find 0 implicit places.
// Phase 1: matrix 954 rows 1005 cols
[2022-05-17 07:11:11] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:11:12] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1005/1006 places, 954/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1005/1006 places, 954/955 transitions.
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s343 1), p0:(GEQ s97 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 761 reset in 1061 ms.
Product exploration explored 100000 steps with 763 reset in 1081 ms.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
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) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 318 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 412 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 954 rows 1005 cols
[2022-05-17 07:11:16] [INFO ] Computed 51 place invariants in 6 ms
[2022-05-17 07:11:18] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 275 ms returned unsat
Proved EG (NOT p0)
// Phase 1: matrix 954 rows 1005 cols
[2022-05-17 07:11:18] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:11:19] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 255 ms returned sat
[2022-05-17 07:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:20] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2022-05-17 07:11:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:11:21] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 286 ms returned sat
[2022-05-17 07:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:21] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2022-05-17 07:11:22] [INFO ] Computed and/alt/rep : 435/441/435 causal constraints (skipped 474 transitions) in 71 ms.
[2022-05-17 07:11:24] [INFO ] Added : 142 causal constraints over 29 iterations in 2231 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA HirschbergSinclair-PT-45-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-00 finished in 18430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 532 transition count 481
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 532 transition count 481
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 531 transition count 480
Applied a total of 860 rules in 111 ms. Remains 531 /1006 variables (removed 475) and now considering 480/955 (removed 475) transitions.
// Phase 1: matrix 480 rows 531 cols
[2022-05-17 07:11:24] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:11:25] [INFO ] Implicit Places using invariants in 703 ms returned []
// Phase 1: matrix 480 rows 531 cols
[2022-05-17 07:11:25] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:11:28] [INFO ] Implicit Places using invariants and state equation in 2813 ms returned []
Implicit Place search using SMT with State Equation took 3521 ms to find 0 implicit places.
[2022-05-17 07:11:28] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 480 rows 531 cols
[2022-05-17 07:11:28] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:11:28] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1006 places, 480/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/1006 places, 480/955 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-01 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:(LT s474 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 207 reset in 410 ms.
Product exploration explored 100000 steps with 207 reset in 624 ms.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
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 :(F (G p0))
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-45-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-01 finished in 5950 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 961 transition count 483
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 534 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 532 transition count 481
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 532 transition count 481
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 531 transition count 480
Applied a total of 860 rules in 76 ms. Remains 531 /1006 variables (removed 475) and now considering 480/955 (removed 475) transitions.
// Phase 1: matrix 480 rows 531 cols
[2022-05-17 07:11:30] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:11:31] [INFO ] Implicit Places using invariants in 831 ms returned []
// Phase 1: matrix 480 rows 531 cols
[2022-05-17 07:11:31] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:11:34] [INFO ] Implicit Places using invariants and state equation in 2777 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
[2022-05-17 07:11:34] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 480 rows 531 cols
[2022-05-17 07:11:34] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:11:34] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1006 places, 480/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/1006 places, 480/955 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s468 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 515 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-02 finished in 4503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))&&F(p1)))'
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 181 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:11:35] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:11:36] [INFO ] Implicit Places using invariants in 888 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:11:36] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:11:40] [INFO ] Implicit Places using invariants and state equation in 4234 ms returned []
Implicit Place search using SMT with State Equation took 5142 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:11:40] [INFO ] Computed 51 place invariants in 6 ms
[2022-05-17 07:11:41] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s31 1) (GEQ s590 1)), p0:(OR (LT s51 1) (LT s194 1) (LT s421 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 114 reset in 497 ms.
Product exploration explored 100000 steps with 116 reset in 562 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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 (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:11:43] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:11:43] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 256 ms returned sat
[2022-05-17 07:11:44] [INFO ] After 1052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 07:11:45] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 233 ms returned sat
[2022-05-17 07:11:45] [INFO ] After 701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 07:11:45] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-05-17 07:11:45] [INFO ] After 1340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Graph (complete) has 1915 edges and 1003 vertex of which 977 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 977 transition count 507
Reduce places removed 419 places and 0 transitions.
Graph (complete) has 982 edges and 558 vertex of which 474 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 420 rules applied. Total rules applied 866 place count 474 transition count 507
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 950 place count 474 transition count 423
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 951 place count 473 transition count 422
Iterating global reduction 3 with 1 rules applied. Total rules applied 952 place count 473 transition count 422
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 970 place count 473 transition count 404
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 988 place count 455 transition count 404
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 4 with 43 rules applied. Total rules applied 1031 place count 412 transition count 361
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 4 with 204 rules applied. Total rules applied 1235 place count 386 transition count 183
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 5 with 178 rules applied. Total rules applied 1413 place count 208 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1413 place count 208 transition count 167
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1445 place count 192 transition count 167
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1446 place count 191 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1446 place count 191 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1448 place count 190 transition count 166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1454 place count 187 transition count 163
Applied a total of 1454 rules in 127 ms. Remains 187 /1003 variables (removed 816) and now considering 163/952 (removed 789) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/1003 places, 163/952 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:11:46] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:11:48] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 306 ms returned sat
[2022-05-17 07:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:12:01] [INFO ] [Real]Absence check using state equation in 13716 ms returned unknown
Could not prove EG (NOT p1)
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Applied a total of 0 rules in 59 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:01] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:12:02] [INFO ] Implicit Places using invariants in 758 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:02] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:12:06] [INFO ] Implicit Places using invariants and state equation in 4370 ms returned []
Implicit Place search using SMT with State Equation took 5143 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:07] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:12:08] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 952/952 transitions.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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 p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:09] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:12:09] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 270 ms returned sat
[2022-05-17 07:12:10] [INFO ] After 1089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 07:12:10] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 244 ms returned sat
[2022-05-17 07:12:11] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 07:12:11] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-17 07:12:11] [INFO ] After 1305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Graph (complete) has 1915 edges and 1003 vertex of which 977 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 445 rules applied. Total rules applied 446 place count 977 transition count 507
Reduce places removed 419 places and 0 transitions.
Graph (complete) has 982 edges and 558 vertex of which 474 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 420 rules applied. Total rules applied 866 place count 474 transition count 507
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 950 place count 474 transition count 423
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 951 place count 473 transition count 422
Iterating global reduction 3 with 1 rules applied. Total rules applied 952 place count 473 transition count 422
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 970 place count 473 transition count 404
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 988 place count 455 transition count 404
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 4 with 43 rules applied. Total rules applied 1031 place count 412 transition count 361
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 4 with 204 rules applied. Total rules applied 1235 place count 386 transition count 183
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 5 with 178 rules applied. Total rules applied 1413 place count 208 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1413 place count 208 transition count 167
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1445 place count 192 transition count 167
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1446 place count 191 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1446 place count 191 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1448 place count 190 transition count 166
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1454 place count 187 transition count 163
Applied a total of 1454 rules in 97 ms. Remains 187 /1003 variables (removed 816) and now considering 163/952 (removed 789) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/1003 places, 163/952 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 179 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=179 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:12] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:12:13] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 304 ms returned sat
[2022-05-17 07:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:12:27] [INFO ] [Real]Absence check using state equation in 13782 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 96 reset in 469 ms.
Product exploration explored 100000 steps with 96 reset in 518 ms.
Applying partial POR strategy [true, true, false, true, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Performed 409 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 409 rules applied. Total rules applied 409 place count 1003 transition count 952
Deduced a syphon composed of 409 places in 8 ms
Applied a total of 409 rules in 253 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2022-05-17 07:12:29] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:29] [INFO ] Computed 51 place invariants in 16 ms
[2022-05-17 07:12:30] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 952/952 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 952/952 transitions.
Product exploration explored 100000 steps with 169 reset in 483 ms.
Product exploration explored 100000 steps with 169 reset in 561 ms.
Built C files in :
/tmp/ltsmin17545867658096606318
[2022-05-17 07:12:31] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17545867658096606318
Running compilation step : cd /tmp/ltsmin17545867658096606318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2807 ms.
Running link step : cd /tmp/ltsmin17545867658096606318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin17545867658096606318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15323568529405772939.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Applied a total of 0 rules in 48 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:46] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:12:47] [INFO ] Implicit Places using invariants in 925 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:47] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:12:51] [INFO ] Implicit Places using invariants and state equation in 4218 ms returned []
Implicit Place search using SMT with State Equation took 5156 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:12:51] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:12:53] [INFO ] Dead Transitions using invariants and state equation in 1358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin11581990216742683097
[2022-05-17 07:12:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11581990216742683097
Running compilation step : cd /tmp/ltsmin11581990216742683097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2820 ms.
Running link step : cd /tmp/ltsmin11581990216742683097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11581990216742683097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9272880207597132969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 07:13:08] [INFO ] Flatten gal took : 69 ms
[2022-05-17 07:13:08] [INFO ] Flatten gal took : 72 ms
[2022-05-17 07:13:08] [INFO ] Time to serialize gal into /tmp/LTL8186596418687379743.gal : 15 ms
[2022-05-17 07:13:08] [INFO ] Time to serialize properties into /tmp/LTL16888507070309605541.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8186596418687379743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16888507070309605541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8186596...267
Read 1 LTL properties
Checking formula 0 : !(((X(G(X("(((newmsg26<1)||(election_27_0_1_to_left_27<1))||(rcv_right_election_45_4_15_30<1))"))))&&(F("((newmsg16>=1)&&(reply_45_5_t...175
Formula 0 simplified : !(XGX"(((newmsg26<1)||(election_27_0_1_to_left_27<1))||(rcv_right_election_45_4_15_30<1))" & F"((newmsg16>=1)&&(reply_45_5_to_right_...164
Detected timeout of ITS tools.
[2022-05-17 07:13:23] [INFO ] Flatten gal took : 57 ms
[2022-05-17 07:13:23] [INFO ] Applying decomposition
[2022-05-17 07:13:23] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7460530544742066387.txt' '-o' '/tmp/graph7460530544742066387.bin' '-w' '/tmp/graph7460530544742066387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7460530544742066387.bin' '-l' '-1' '-v' '-w' '/tmp/graph7460530544742066387.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:13:23] [INFO ] Decomposing Gal with order
[2022-05-17 07:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:13:24] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-17 07:13:24] [INFO ] Flatten gal took : 334 ms
[2022-05-17 07:13:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-17 07:13:24] [INFO ] Time to serialize gal into /tmp/LTL1976877089591965392.gal : 19 ms
[2022-05-17 07:13:24] [INFO ] Time to serialize properties into /tmp/LTL3202763352845933192.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1976877089591965392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3202763352845933192.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1976877...245
Read 1 LTL properties
Checking formula 0 : !(((X(G(X("(((i6.i0.u22.newmsg26<1)||(i6.i0.u22.election_27_0_1_to_left_27<1))||(i7.u26.rcv_right_election_45_4_15_30<1))"))))&&(F("((...222
Formula 0 simplified : !(XGX"(((i6.i0.u22.newmsg26<1)||(i6.i0.u22.election_27_0_1_to_left_27<1))||(i7.u26.rcv_right_election_45_4_15_30<1))" & F"((i4.i1.u4...211
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11550693201317069990
[2022-05-17 07:13:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11550693201317069990
Running compilation step : cd /tmp/ltsmin11550693201317069990;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2623 ms.
Running link step : cd /tmp/ltsmin11550693201317069990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11550693201317069990;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](X((LTLAPp0==true))))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-03 finished in 139774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(G(p0)))||G(F(p1))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1005 transition count 954
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1005 transition count 954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1004 transition count 953
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1004 transition count 953
Applied a total of 4 rules in 157 ms. Remains 1004 /1006 variables (removed 2) and now considering 953/955 (removed 2) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2022-05-17 07:13:54] [INFO ] Computed 51 place invariants in 6 ms
[2022-05-17 07:13:55] [INFO ] Implicit Places using invariants in 790 ms returned []
// Phase 1: matrix 953 rows 1004 cols
[2022-05-17 07:13:55] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:13:59] [INFO ] Implicit Places using invariants and state equation in 4239 ms returned []
Implicit Place search using SMT with State Equation took 5032 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 1004 cols
[2022-05-17 07:13:59] [INFO ] Computed 51 place invariants in 6 ms
[2022-05-17 07:14:01] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1004/1006 places, 953/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1006 places, 953/955 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s332 1), p1:(AND (LT s332 1) (OR (LT s25 1) (LT s140 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][false, false, false, false]]
Product exploration explored 100000 steps with 453 reset in 778 ms.
Product exploration explored 100000 steps with 470 reset in 850 ms.
Computed a total of 1004 stabilizing places and 953 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1004 transition count 953
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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 9 factoid took 248 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-45-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-05 finished in 8802 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 962 transition count 484
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 535 transition count 484
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 856 place count 533 transition count 482
Iterating global reduction 2 with 2 rules applied. Total rules applied 858 place count 533 transition count 482
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 533 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 532 transition count 481
Applied a total of 860 rules in 103 ms. Remains 532 /1006 variables (removed 474) and now considering 481/955 (removed 474) transitions.
// Phase 1: matrix 481 rows 532 cols
[2022-05-17 07:14:03] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:14:04] [INFO ] Implicit Places using invariants in 700 ms returned []
// Phase 1: matrix 481 rows 532 cols
[2022-05-17 07:14:04] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:14:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:14:07] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 3921 ms to find 0 implicit places.
[2022-05-17 07:14:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 481 rows 532 cols
[2022-05-17 07:14:07] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:14:08] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1006 places, 481/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/1006 places, 481/955 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, 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:(LT s25 1), p1:(LT s208 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 358 reset in 408 ms.
Product exploration explored 100000 steps with 374 reset in 455 ms.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
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) p1), (X p1), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-45-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-06 finished in 6052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 125 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:14:09] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:14:10] [INFO ] Implicit Places using invariants in 886 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:14:10] [INFO ] Computed 51 place invariants in 6 ms
[2022-05-17 07:14:14] [INFO ] Implicit Places using invariants and state equation in 4137 ms returned []
Implicit Place search using SMT with State Equation took 5038 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:14:14] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:14:16] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s608 1))], 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][false, false]]
Product exploration explored 100000 steps with 136 reset in 469 ms.
Product exploration explored 100000 steps with 136 reset in 522 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 757 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=151 )
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 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:14:17] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:14:19] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 306 ms returned sat
[2022-05-17 07:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:14:32] [INFO ] [Real]Absence check using state equation in 13683 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 959 transition count 489
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 540 transition count 489
Applied a total of 838 rules in 27 ms. Remains 540 /1003 variables (removed 463) and now considering 489/952 (removed 463) transitions.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:14:32] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:14:33] [INFO ] Implicit Places using invariants in 863 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:14:33] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:14:36] [INFO ] Implicit Places using invariants and state equation in 2754 ms returned []
Implicit Place search using SMT with State Equation took 3619 ms to find 0 implicit places.
[2022-05-17 07:14:36] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:14:36] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-17 07:14:37] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/1003 places, 489/952 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/1003 places, 489/952 transitions.
Computed a total of 540 stabilizing places and 489 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 540 transition count 489
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 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 379 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=126 )
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 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:14:37] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:14:38] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 306 ms returned sat
[2022-05-17 07:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:14:42] [INFO ] [Real]Absence check using state equation in 3899 ms returned sat
[2022-05-17 07:14:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:14:43] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 446 ms returned sat
[2022-05-17 07:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:14:48] [INFO ] [Nat]Absence check using state equation in 5300 ms returned sat
[2022-05-17 07:14:49] [INFO ] Computed and/alt/rep : 396/420/396 causal constraints (skipped 7 transitions) in 35 ms.
[2022-05-17 07:14:53] [INFO ] Added : 235 causal constraints over 47 iterations in 4863 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 281 reset in 450 ms.
Product exploration explored 100000 steps with 282 reset in 484 ms.
Built C files in :
/tmp/ltsmin15142093294307713477
[2022-05-17 07:14:54] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2022-05-17 07:14:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:14:54] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2022-05-17 07:14:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:14:54] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2022-05-17 07:14:54] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:14:54] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15142093294307713477
Running compilation step : cd /tmp/ltsmin15142093294307713477;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1710 ms.
Running link step : cd /tmp/ltsmin15142093294307713477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15142093294307713477;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14731223579677256868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 489/489 transitions.
Applied a total of 0 rules in 24 ms. Remains 540 /540 variables (removed 0) and now considering 489/489 (removed 0) transitions.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:15:09] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:15:10] [INFO ] Implicit Places using invariants in 848 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:15:10] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:15:13] [INFO ] Implicit Places using invariants and state equation in 3083 ms returned []
Implicit Place search using SMT with State Equation took 3933 ms to find 0 implicit places.
[2022-05-17 07:15:13] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:15:13] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:15:14] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 489/489 transitions.
Built C files in :
/tmp/ltsmin11460829917188017173
[2022-05-17 07:15:14] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2022-05-17 07:15:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:15:14] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2022-05-17 07:15:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:15:14] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2022-05-17 07:15:14] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:15:14] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11460829917188017173
Running compilation step : cd /tmp/ltsmin11460829917188017173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1797 ms.
Running link step : cd /tmp/ltsmin11460829917188017173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11460829917188017173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased95267704304274402.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 07:15:29] [INFO ] Flatten gal took : 23 ms
[2022-05-17 07:15:29] [INFO ] Flatten gal took : 22 ms
[2022-05-17 07:15:29] [INFO ] Time to serialize gal into /tmp/LTL4572790322495895091.gal : 4 ms
[2022-05-17 07:15:29] [INFO ] Time to serialize properties into /tmp/LTL5561834630812628684.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4572790322495895091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5561834630812628684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4572790...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"
Detected timeout of ITS tools.
[2022-05-17 07:15:44] [INFO ] Flatten gal took : 18 ms
[2022-05-17 07:15:44] [INFO ] Applying decomposition
[2022-05-17 07:15:44] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7077857093959943758.txt' '-o' '/tmp/graph7077857093959943758.bin' '-w' '/tmp/graph7077857093959943758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7077857093959943758.bin' '-l' '-1' '-v' '-w' '/tmp/graph7077857093959943758.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:15:44] [INFO ] Decomposing Gal with order
[2022-05-17 07:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:15:44] [INFO ] Removed a total of 331 redundant transitions.
[2022-05-17 07:15:44] [INFO ] Flatten gal took : 48 ms
[2022-05-17 07:15:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 13 ms.
[2022-05-17 07:15:44] [INFO ] Time to serialize gal into /tmp/LTL7243104775897052427.gal : 7 ms
[2022-05-17 07:15:44] [INFO ] Time to serialize properties into /tmp/LTL3108068100945318779.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7243104775897052427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3108068100945318779.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7243104...245
Read 1 LTL properties
Checking formula 0 : !((X(F("((i7.u0.newmsg25>=1)&&(i7.u119.reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((i7.u0.newmsg25>=1)&&(i7.u119.reply_45_5_to_right_24>=1))"
Reverse transition relation is NOT exact ! Due to transitions t51_t52, t73_t74, t93_t94, t122_t123, t146_t147, t158_t159, t186_t187, t202_t203, t818_t819, ...783
Computing Next relation with stutter on 3.06954e+32 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9857650929121984852
[2022-05-17 07:15:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9857650929121984852
Running compilation step : cd /tmp/ltsmin9857650929121984852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1219 ms.
Running link step : cd /tmp/ltsmin9857650929121984852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9857650929121984852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 125496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0))) U !X(p1)))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 131 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:15] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:16:16] [INFO ] Implicit Places using invariants in 935 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:16] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:16:20] [INFO ] Implicit Places using invariants and state equation in 4115 ms returned []
Implicit Place search using SMT with State Equation took 5052 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:20] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:16:21] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s567 1), p0:(AND (GEQ s69 1) (GEQ s410 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1114 ms.
Product exploration explored 100000 steps with 50000 reset in 1236 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-45-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-11 finished in 9596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(!p0) U (X((p1 U p2))||X(!p1))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 138 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:24] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:16:25] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:25] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:16:30] [INFO ] Implicit Places using invariants and state equation in 4355 ms returned []
Implicit Place search using SMT with State Equation took 5215 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:30] [INFO ] Computed 51 place invariants in 6 ms
[2022-05-17 07:16:31] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s45 1) (GEQ s604 1)), p1:(LT s688 1), p2:(GEQ s873 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 636 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-12 finished in 7007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1004 transition count 953
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1004 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1003 transition count 952
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1003 transition count 952
Applied a total of 6 rules in 133 ms. Remains 1003 /1006 variables (removed 3) and now considering 952/955 (removed 3) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:31] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:16:32] [INFO ] Implicit Places using invariants in 953 ms returned []
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:32] [INFO ] Computed 51 place invariants in 4 ms
[2022-05-17 07:16:36] [INFO ] Implicit Places using invariants and state equation in 4150 ms returned []
Implicit Place search using SMT with State Equation took 5106 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 1003 cols
[2022-05-17 07:16:36] [INFO ] Computed 51 place invariants in 5 ms
[2022-05-17 07:16:38] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1003/1006 places, 952/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1006 places, 952/955 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s5 1) (LT s874 1) (AND (GEQ s9 1) (GEQ s509 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 826 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-14 finished in 6780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(G((p0 U p1)))))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 962 transition count 492
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 543 transition count 492
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 840 place count 541 transition count 490
Iterating global reduction 2 with 2 rules applied. Total rules applied 842 place count 541 transition count 490
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 843 place count 541 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 540 transition count 489
Applied a total of 844 rules in 52 ms. Remains 540 /1006 variables (removed 466) and now considering 489/955 (removed 466) transitions.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:16:38] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:39] [INFO ] Implicit Places using invariants in 826 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:16:39] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:42] [INFO ] Implicit Places using invariants and state equation in 2861 ms returned []
Implicit Place search using SMT with State Equation took 3692 ms to find 0 implicit places.
[2022-05-17 07:16:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:16:42] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:42] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/1006 places, 489/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/1006 places, 489/955 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s34 1) (GEQ s414 1)), p0:(GEQ s282 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-15 finished in 4611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))&&F(p1)))'
Found a SL insensitive property : HirschbergSinclair-PT-45-LTLFireability-03
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 5 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 42 places and 42 transitions.
Drop transitions removed 409 transitions
Trivial Post-agglo rules discarded 409 transitions
Performed 409 trivial Post agglomeration. Transition count delta: 409
Iterating post reduction 0 with 409 rules applied. Total rules applied 409 place count 964 transition count 504
Reduce places removed 409 places and 0 transitions.
Iterating post reduction 1 with 409 rules applied. Total rules applied 818 place count 555 transition count 504
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 820 place count 553 transition count 502
Iterating global reduction 2 with 2 rules applied. Total rules applied 822 place count 553 transition count 502
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 823 place count 553 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 824 place count 552 transition count 501
Applied a total of 824 rules in 49 ms. Remains 552 /1006 variables (removed 454) and now considering 501/955 (removed 454) transitions.
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:16:43] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:44] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:16:44] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:16:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:16:48] [INFO ] Implicit Places using invariants and state equation in 3886 ms returned []
Implicit Place search using SMT with State Equation took 4736 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:16:48] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:48] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 552/1006 places, 501/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 552/1006 places, 501/955 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s312 1)), p0:(OR (LT s27 1) (LT s103 1) (LT s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 225 reset in 390 ms.
Product exploration explored 100000 steps with 218 reset in 459 ms.
Computed a total of 552 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 552 transition count 501
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 (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:16:50] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:50] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 147 ms returned sat
[2022-05-17 07:16:51] [INFO ] After 284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:16:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:16:51] [INFO ] After 35ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:16:51] [INFO ] After 98ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 07:16:51] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:16:51] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:16:52] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 287 ms returned sat
[2022-05-17 07:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:16:56] [INFO ] [Real]Absence check using state equation in 4051 ms returned sat
[2022-05-17 07:16:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:16:57] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 489 ms returned sat
[2022-05-17 07:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:17:01] [INFO ] [Nat]Absence check using state equation in 3191 ms returned sat
[2022-05-17 07:17:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:17:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 47 ms returned sat
[2022-05-17 07:17:01] [INFO ] Computed and/alt/rep : 401/427/401 causal constraints (skipped 18 transitions) in 37 ms.
[2022-05-17 07:17:06] [INFO ] Added : 217 causal constraints over 44 iterations in 4981 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Applied a total of 0 rules in 13 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:17:06] [INFO ] Computed 51 place invariants in 7 ms
[2022-05-17 07:17:06] [INFO ] Implicit Places using invariants in 829 ms returned []
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:17:06] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:17:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:17:10] [INFO ] Implicit Places using invariants and state equation in 3092 ms returned []
Implicit Place search using SMT with State Equation took 3923 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:17:10] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:10] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 552/552 places, 501/501 transitions.
Computed a total of 552 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 552 transition count 501
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 p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:17:11] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:11] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 142 ms returned sat
[2022-05-17 07:17:12] [INFO ] After 275ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 07:17:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:17:12] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-17 07:17:12] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-17 07:17:12] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:17:12] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:13] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 261 ms returned sat
[2022-05-17 07:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:17:17] [INFO ] [Real]Absence check using state equation in 4025 ms returned sat
[2022-05-17 07:17:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:17:18] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 464 ms returned sat
[2022-05-17 07:17:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:17:21] [INFO ] [Nat]Absence check using state equation in 3059 ms returned sat
[2022-05-17 07:17:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 07:17:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 44 ms returned sat
[2022-05-17 07:17:22] [INFO ] Computed and/alt/rep : 401/427/401 causal constraints (skipped 18 transitions) in 44 ms.
[2022-05-17 07:17:27] [INFO ] Added : 217 causal constraints over 44 iterations in 5094 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 182 reset in 388 ms.
Product exploration explored 100000 steps with 182 reset in 430 ms.
Applying partial POR strategy [true, true, false, true, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Support contains 5 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Applied a total of 0 rules in 19 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2022-05-17 07:17:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 501 rows 552 cols
[2022-05-17 07:17:28] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:29] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 552/552 places, 501/501 transitions.
Product exploration explored 100000 steps with 182 reset in 408 ms.
Product exploration explored 100000 steps with 183 reset in 449 ms.
Built C files in :
/tmp/ltsmin7933098062503219715
[2022-05-17 07:17:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7933098062503219715
Running compilation step : cd /tmp/ltsmin7933098062503219715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1298 ms.
Running link step : cd /tmp/ltsmin7933098062503219715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7933098062503219715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11156358172853445972.hoa' '--buchi-type=spotba'
LTSmin run took 6510 ms.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-03 finished in 54812 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-03 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a CL insensitive property : HirschbergSinclair-PT-45-LTLFireability-08
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1006/1006 places, 955/955 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 962 transition count 492
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 543 transition count 492
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 840 place count 541 transition count 490
Iterating global reduction 2 with 2 rules applied. Total rules applied 842 place count 541 transition count 490
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 843 place count 541 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 540 transition count 489
Applied a total of 844 rules in 50 ms. Remains 540 /1006 variables (removed 466) and now considering 489/955 (removed 466) transitions.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:17:38] [INFO ] Computed 51 place invariants in 3 ms
[2022-05-17 07:17:38] [INFO ] Implicit Places using invariants in 861 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:17:38] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:41] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:17:41] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:42] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 540/1006 places, 489/955 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/1006 places, 489/955 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s314 1))], 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][false, false]]
Product exploration explored 100000 steps with 282 reset in 436 ms.
Product exploration explored 100000 steps with 282 reset in 473 ms.
Computed a total of 540 stabilizing places and 489 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 540 transition count 489
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 157 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 369 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=184 )
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 210 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:17:43] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:17:44] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 310 ms returned sat
[2022-05-17 07:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:17:48] [INFO ] [Real]Absence check using state equation in 3971 ms returned sat
[2022-05-17 07:17:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:17:49] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 447 ms returned sat
[2022-05-17 07:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:17:55] [INFO ] [Nat]Absence check using state equation in 5329 ms returned sat
[2022-05-17 07:17:55] [INFO ] Computed and/alt/rep : 396/420/396 causal constraints (skipped 7 transitions) in 34 ms.
[2022-05-17 07:17:59] [INFO ] Added : 235 causal constraints over 47 iterations in 4922 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 489/489 transitions.
Applied a total of 0 rules in 19 ms. Remains 540 /540 variables (removed 0) and now considering 489/489 (removed 0) transitions.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:17:59] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:00] [INFO ] Implicit Places using invariants in 900 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:18:00] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:03] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3695 ms to find 0 implicit places.
[2022-05-17 07:18:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:18:03] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:04] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 489/489 transitions.
Computed a total of 540 stabilizing places and 489 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 540 transition count 489
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 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 377 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=125 )
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 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:18:04] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:05] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 308 ms returned sat
[2022-05-17 07:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:18:09] [INFO ] [Real]Absence check using state equation in 3927 ms returned sat
[2022-05-17 07:18:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:18:10] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 462 ms returned sat
[2022-05-17 07:18:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:18:16] [INFO ] [Nat]Absence check using state equation in 5357 ms returned sat
[2022-05-17 07:18:16] [INFO ] Computed and/alt/rep : 396/420/396 causal constraints (skipped 7 transitions) in 35 ms.
[2022-05-17 07:18:21] [INFO ] Added : 235 causal constraints over 47 iterations in 4934 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 281 reset in 456 ms.
Product exploration explored 100000 steps with 281 reset in 485 ms.
Built C files in :
/tmp/ltsmin17922746289865733055
[2022-05-17 07:18:22] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2022-05-17 07:18:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:22] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2022-05-17 07:18:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:22] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2022-05-17 07:18:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:22] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17922746289865733055
Running compilation step : cd /tmp/ltsmin17922746289865733055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1729 ms.
Running link step : cd /tmp/ltsmin17922746289865733055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17922746289865733055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14901022863143205115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 489/489 transitions.
Applied a total of 0 rules in 23 ms. Remains 540 /540 variables (removed 0) and now considering 489/489 (removed 0) transitions.
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:18:37] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:38] [INFO ] Implicit Places using invariants in 860 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:18:38] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:41] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned []
Implicit Place search using SMT with State Equation took 3923 ms to find 0 implicit places.
[2022-05-17 07:18:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 489 rows 540 cols
[2022-05-17 07:18:41] [INFO ] Computed 51 place invariants in 2 ms
[2022-05-17 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 489/489 transitions.
Built C files in :
/tmp/ltsmin13036279535120951834
[2022-05-17 07:18:41] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2022-05-17 07:18:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:41] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2022-05-17 07:18:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:41] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2022-05-17 07:18:41] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:41] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13036279535120951834
Running compilation step : cd /tmp/ltsmin13036279535120951834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1974 ms.
Running link step : cd /tmp/ltsmin13036279535120951834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13036279535120951834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10496779370958732778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 07:18:56] [INFO ] Flatten gal took : 18 ms
[2022-05-17 07:18:56] [INFO ] Flatten gal took : 18 ms
[2022-05-17 07:18:56] [INFO ] Time to serialize gal into /tmp/LTL1279266254120042677.gal : 3 ms
[2022-05-17 07:18:56] [INFO ] Time to serialize properties into /tmp/LTL7202828750245675959.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1279266254120042677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7202828750245675959.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1279266...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"
Detected timeout of ITS tools.
[2022-05-17 07:19:11] [INFO ] Flatten gal took : 18 ms
[2022-05-17 07:19:11] [INFO ] Applying decomposition
[2022-05-17 07:19:11] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9285288688336016495.txt' '-o' '/tmp/graph9285288688336016495.bin' '-w' '/tmp/graph9285288688336016495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9285288688336016495.bin' '-l' '-1' '-v' '-w' '/tmp/graph9285288688336016495.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:19:12] [INFO ] Decomposing Gal with order
[2022-05-17 07:19:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:19:12] [INFO ] Removed a total of 331 redundant transitions.
[2022-05-17 07:19:12] [INFO ] Flatten gal took : 44 ms
[2022-05-17 07:19:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 10 ms.
[2022-05-17 07:19:12] [INFO ] Time to serialize gal into /tmp/LTL9791576656257009761.gal : 7 ms
[2022-05-17 07:19:12] [INFO ] Time to serialize properties into /tmp/LTL13293975149603331459.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9791576656257009761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13293975149603331459.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9791576...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i1.u24.newmsg25>=1)&&(i1.u121.reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((i1.u24.newmsg25>=1)&&(i1.u121.reply_45_5_to_right_24>=1))"
Reverse transition relation is NOT exact ! Due to transitions t69_t70, t85_t86, t114_t115, t146_t147, t186_t187, t198_t199, t571_t572, t818_t819, i1.t144_t...788
Computing Next relation with stutter on 3.06954e+32 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12836433589898612249
[2022-05-17 07:19:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12836433589898612249
Running compilation step : cd /tmp/ltsmin12836433589898612249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1262 ms.
Running link step : cd /tmp/ltsmin12836433589898612249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12836433589898612249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 124387 ms.
[2022-05-17 07:19:42] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4869594660850889621
[2022-05-17 07:19:42] [INFO ] Computing symmetric may disable matrix : 955 transitions.
[2022-05-17 07:19:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:19:42] [INFO ] Computing symmetric may enable matrix : 955 transitions.
[2022-05-17 07:19:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:19:42] [INFO ] Applying decomposition
[2022-05-17 07:19:42] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12962511894984743578.txt' '-o' '/tmp/graph12962511894984743578.bin' '-w' '/tmp/graph12962511894984743578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12962511894984743578.bin' '-l' '-1' '-v' '-w' '/tmp/graph12962511894984743578.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:19:42] [INFO ] Computing Do-Not-Accords matrix : 955 transitions.
[2022-05-17 07:19:42] [INFO ] Decomposing Gal with order
[2022-05-17 07:19:42] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:19:42] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4869594660850889621
Running compilation step : cd /tmp/ltsmin4869594660850889621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 07:19:42] [INFO ] Removed a total of 90 redundant transitions.
[2022-05-17 07:19:42] [INFO ] Flatten gal took : 78 ms
[2022-05-17 07:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-17 07:19:42] [INFO ] Time to serialize gal into /tmp/LTLFireability11212493651203762874.gal : 12 ms
[2022-05-17 07:19:42] [INFO ] Time to serialize properties into /tmp/LTLFireability5348478552874869404.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11212493651203762874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5348478552874869404.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(F("((i5.i0.u22.newmsg25>=1)&&(i5.i0.u21.reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((i5.i0.u22.newmsg25>=1)&&(i5.i0.u21.reply_45_5_to_right_24>=1))"
Compilation finished in 4485 ms.
Running link step : cd /tmp/ltsmin4869594660850889621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin4869594660850889621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t9, t13, t16, t19, t23, t27, t31, t32, t35, t39, t42, t68, t177, t954, i0.t60, i0...1755
Computing Next relation with stutter on 4.42014e+32 deadlock states
Detected timeout of ITS tools.
[2022-05-17 07:42:39] [INFO ] Flatten gal took : 96 ms
[2022-05-17 07:42:39] [INFO ] Time to serialize gal into /tmp/LTLFireability2028150287279000591.gal : 7 ms
[2022-05-17 07:42:39] [INFO ] Time to serialize properties into /tmp/LTLFireability1653419911551257634.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2028150287279000591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1653419911551257634.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((X(F("((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"
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( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.100: LTL layer: formula: X(<>((LTLAPp2==true)))
pins2lts-mc-linux64( 2/ 8), 0.105: "X(<>((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.106: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.148: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.152: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.325: DFS-FIFO for weak LTL, using special progress label 959
pins2lts-mc-linux64( 0/ 8), 0.325: There are 960 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.325: State length is 1007, there are 957 groups
pins2lts-mc-linux64( 0/ 8), 0.325: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.325: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.325: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.325: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.269: ~120 levels ~960 states ~43528 transitions
pins2lts-mc-linux64( 7/ 8), 1.708: ~240 levels ~1920 states ~79656 transitions
pins2lts-mc-linux64( 7/ 8), 1.918: ~480 levels ~3840 states ~91480 transitions
pins2lts-mc-linux64( 0/ 8), 2.141: ~775 levels ~7680 states ~99016 transitions
pins2lts-mc-linux64( 1/ 8), 2.502: ~745 levels ~15360 states ~115616 transitions
pins2lts-mc-linux64( 2/ 8), 3.217: ~770 levels ~30720 states ~143944 transitions
pins2lts-mc-linux64( 3/ 8), 4.632: ~762 levels ~61440 states ~211368 transitions
pins2lts-mc-linux64( 3/ 8), 7.802: ~768 levels ~122880 states ~390488 transitions
pins2lts-mc-linux64( 3/ 8), 14.320: ~774 levels ~245760 states ~751456 transitions
pins2lts-mc-linux64( 3/ 8), 27.475: ~774 levels ~491520 states ~1556952 transitions
pins2lts-mc-linux64( 3/ 8), 52.054: ~774 levels ~983040 states ~3354496 transitions
pins2lts-mc-linux64( 3/ 8), 99.909: ~774 levels ~1966080 states ~7274904 transitions
pins2lts-mc-linux64( 3/ 8), 196.970: ~774 levels ~3932160 states ~15645656 transitions
pins2lts-mc-linux64( 3/ 8), 393.667: ~774 levels ~7864320 states ~33840304 transitions
pins2lts-mc-linux64( 3/ 8), 789.132: ~774 levels ~15728640 states ~72118072 transitions
pins2lts-mc-linux64( 6/ 8), 1622.448: ~774 levels ~31457280 states ~160360824 transitions
pins2lts-mc-linux64( 3/ 8), 2534.324: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2534.375:
pins2lts-mc-linux64( 0/ 8), 2534.375: mean standard work distribution: 1.8% (states) 3.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 2534.376:
pins2lts-mc-linux64( 0/ 8), 2534.376: Explored 46994780 states 265986352 transitions, fanout: 5.660
pins2lts-mc-linux64( 0/ 8), 2534.376: Total exploration time 2534.020 sec (2533.980 sec minimum, 2534.000 sec on average)
pins2lts-mc-linux64( 0/ 8), 2534.376: States per second: 18546, Transitions per second: 104966
pins2lts-mc-linux64( 0/ 8), 2534.376:
pins2lts-mc-linux64( 0/ 8), 2534.376: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 2534.376: Redundant explorations: -0.0967
pins2lts-mc-linux64( 0/ 8), 2534.376:
pins2lts-mc-linux64( 0/ 8), 2534.376: Queue width: 8B, total height: 6202, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 2534.376: Tree memory: 614.9MB, 13.7 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2534.376: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2534.376: Stored 1039 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2534.376: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2534.376: Est. total memory use: 614.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4869594660850889621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4869594660850889621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...892
Computing Next relation with stutter on 4.42014e+32 deadlock states
Detected timeout of ITS tools.
[2022-05-17 08:05:35] [INFO ] Flatten gal took : 33 ms
[2022-05-17 08:05:36] [INFO ] Input system was already deterministic with 955 transitions.
[2022-05-17 08:05:36] [INFO ] Transformed 1006 places.
[2022-05-17 08:05:36] [INFO ] Transformed 955 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-17 08:05:36] [INFO ] Time to serialize gal into /tmp/LTLFireability7542534237338258282.gal : 6 ms
[2022-05-17 08:05:36] [INFO ] Time to serialize properties into /tmp/LTLFireability6522621679430604904.ltl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7542534237338258282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6522621679430604904.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"))))
Formula 0 simplified : !XF"((newmsg25>=1)&&(reply_45_5_to_right_24>=1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="HirschbergSinclair-PT-45"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-45, 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 r114-smll-165264477500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-45.tgz
mv HirschbergSinclair-PT-45 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 ;